TGViewer
Coding Interview Resources Coding Interview Resources @crackingthecodinginterview ยท 52.2K subscribers
Post #2684 3.44K
Top 50 Coding Interview Questions ๐Ÿ’ป๐Ÿš€

1. What is the time and space complexity of your code?
2. Difference between array and linked list.
3. How does a HashMap work internally?
4. What is recursion? Give an example.
5. Explain stack vs. queue.
6. What is a binary search and when to use it?
7. Difference between BFS and DFS.
8. What is dynamic programming?
9. Solve Fibonacci using memoization.
10. Explain two-pointer technique with an example.
11. What is a sliding window algorithm?
12. Detect cycle in a linked list.
13. Find the intersection of two arrays.
14. Reverse a string or linked list.
15. Check if a string is a palindrome.
16. What are the different sorting algorithms?
17. Explain quicksort vs. mergesort.
18. What is a binary search tree (BST)?
19. Inorder, Preorder, Postorder traversals.
20. Implement LRU Cache.
21. Find the longest substring without repeating characters.
22. Explain backtracking with N-Queens problem.
23. What is a trie? Where is it used?
24. Explain bit manipulation tricks.
25. Kadaneโ€™s Algorithm for maximum subarray sum.
26. What are heaps and how do they work?
27. Find kth largest element in an array.
28. How to detect cycle in a graph?
29. Topological sort of a DAG.
30. Implement a stack using queues.
31. Explain the difference between pass by value and reference.
32. What is memoization vs. tabulation?
33. Solve the knapsack problem.
34. Find duplicate numbers in an array.
35. What are function closures in Python/JavaScript?
36. How does garbage collection work in Java?
37. What are lambda functions?
38. Explain OOPs concepts: Inheritance, Polymorphism, Encapsulation, Abstraction.
39. What is multithreading vs. multiprocessing?
40. Difference between process and thread.
41. Implement a binary heap.
42. Explain prefix sum technique.
43. Design a parking lot system.
44. Find median in a stream of numbers.
45. Detect anagram strings.
46. Serialize and deserialize a binary tree.
47. Implement a trie with insert and search.
48. Explain design patterns like Singleton, Factory.
49. Discuss trade-offs between readability and performance.
50. How do you debug a tricky bug?

๐Ÿ’ฌ Tap โค๏ธ for detailed answers!
  • โค 14
  • ๐Ÿ‘ 2
More from @crackingthecodinginterview
  1. Oct 9, 2026๐Ÿ”ฅ SQL Interview Case Studies (Advanced Business Scenarios) ๐Ÿ’ฏ ๐Ÿง  Case Study 1: Find Repeaโ€ฆ
  2. Oct 9, 2026๐Ÿ‡ฎ๐Ÿ‡ณ ๐—š๐—ข๐—ฉ๐—˜๐—ฅ๐—ก๐— ๐—˜๐—ก๐—ง ๐—ข๐—™ ๐—œ๐—ก๐——๐—œ๐—” โ€” ๐—”๐—œ๐—–๐—ง๐—˜ ๐—œ๐—ก๐—ง๐—˜๐—ฅ๐—ก๐—ฆ๐—›๐—œ๐—ฃ๐—ฆ ๐Ÿฎ๐Ÿฌ๐Ÿฎ๐Ÿฒ ๐Ÿš€โ€ฆ
  3. Oct 8, 2026๐ŸŽ“ ๐— ๐—ถ๐—ฐ๐—ฟ๐—ผ๐˜€๐—ผ๐—ณ๐˜ ๐—™๐—ฅ๐—˜๐—˜ ๐—–๐—ผ๐˜‚๐—ฟ๐˜€๐—ฒ๐˜€ ๐˜„๐—ถ๐˜๐—ต ๐—–๐—ฒ๐—ฟ๐˜๐—ถ๐—ณ๐—ถ๐—ฐ๐—ฎ๐˜๐—ฒ๐˜€! ๐Ÿš€๐Ÿ”ฅ Upgrโ€ฆ
  4. Oct 7, 2026๐Ÿš€ DSA Topics Every Programmer Should Know ๐Ÿ’ป๐Ÿ”ฅ ๐Ÿ“ฆ 1. Arrays โœ” Traversal โœ” Searching โœ” Sorโ€ฆ
  5. Oct 7, 2026๐Ÿš€๐—ฃ๐—ฎ๐˜† ๐—”๐—ณ๐˜๐—ฒ๐—ฟ ๐—ฃ๐—น๐—ฎ๐—ฐ๐—ฒ๐—บ๐—ฒ๐—ป๐˜ ๐—ง๐—ฟ๐—ฎ๐—ถ๐—ป๐—ถ๐—ป๐—ด | ๐—•๐—ฒ๐—ฐ๐—ผ๐—บ๐—ฒ ๐—ฎ ๐—™๐˜‚๐—น๐—น๐˜€๐˜๐—ฎ๐—ฐโ€ฆ
  6. Oct 7, 2026๐— ๐—ฎ๐˜€๐˜๐—ฒ๐—ฟ ๐—ฃ๐—ผ๐˜„๐—ฒ๐—ฟ ๐—•๐—œ ๐—ณ๐—ผ๐—ฟ ๐—™๐—ฅ๐—˜๐—˜! ๐Ÿ”ฅ Learn Power BI through these FREE learninโ€ฆ
Threads Profile ViewerView any public Threads profile without an account.Open ThreadLook โ†’Writing with AI? Make it sound human.Metric37 rewrites AI drafts so they read naturally. Free AI detector, 1,500 words free.Try Metric37 โ†’