Anish
β
*Top 50 Coding Interview Questions (With Concepts)* π»π
1. What is time and space complexity?
2. Big-O Notation β Why is it important?
3. Difference between array and linked list
4. Stack vs Queue β Use cases
5. Implement a stack using arrays
6. What is a hash table?
7. How does a hashmap work internally?
8. Difference between recursion and iteration
9. Solve Fibonacci with recursion and memoization
10. Explain sliding window technique
11. Explain two-pointer approach with an example
12. Reverse a linked list
13. Detect cycle in a linked list
14. Merge two sorted linked lists
15. Find the middle of a linked list
16. Binary Search β Code and logic
17. Find first and last occurrence in sorted array
18. Implement a binary search tree
19. BST β Inorder, Preorder, Postorder traversal
20. Lowest Common Ancestor in BST
21. Height vs Depth of a tree
22. Level-order traversal using queue
23. Implement a min heap / max heap
24. Heap sort vs Merge sort
25. Quick sort β Pivot logic
26. Merge intervals problem
27. Kadane's algorithm for max subarray
28. Longest common prefix
29. Longest palindrome substring
30. Anagram detection
31. Count unique characters in a string
32. Implement LRU Cache
33. Dynamic programming β Top-down vs Bottom-up
34. Coin change problem
35. 0/1 Knapsack problem
36. Longest increasing subsequence
37. Topological sort in a DAG
38. Detect cycle in a graph (DFS)
39. Dijkstraβs algorithm
40. A* pathfinding algorithm
41. Trie β Insert and search
42. Word break problem
43. Backtracking β N Queens
44. Subsets and permutations
45. Bit manipulation β Count set bits
46. XOR tricks β Find missing number
47. Design a parking lot (OOP question)
48. Thread-safe singleton pattern
49. API rate limiter design
50. Debugging a memory leak in code
π¬ *Tap β€οΈ for more!*
22 Β· 6.1K Β·