🚀 Top 200 Coding Interview Questions

🧠 1. Programming Fundamentals

1. What is programming?

2. What is an algorithm?

3. What is pseudocode?

4. What is a flowchart?

5. What is a variable?

6. What are data types?

7. What is type casting?

8. What are operators in programming?

9. What are conditional statements?

10. What are loops?

11. Difference between for, while, and do-while loops?

12. What are functions?

13. Difference between parameters and arguments?

14. What is recursion?

15. What is scope?

16. What are global and local variables?

17. What are arrays?

18. What are strings?

19. What is debugging?

20. What are syntax, logical, and runtime errors?

⚙️ 2. Object-Oriented Programming

1. What is Object-Oriented Programming OOP?

2. What is a class?

3. What is an object?

4. What is encapsulation?

5. What is abstraction?

6. What is inheritance?

7. What is polymorphism?

8. What is method overloading?

9. What is method overriding?

10. Difference between overloading and overriding?

11. What is a constructor?

12. Types of constructors?

13. What is destructor?

14. What is static keyword?

15. What is final keyword?

16. What is interface?

17. What is abstract class?

18. Difference between interface and abstract class?

19. What is object cloning?

20. What are access modifiers?

📊 3. Data Structures

1. What is a data structure?

2. Types of data structures?

3. What is an array?

4. What is a linked list?

5. Types of linked lists?

6. What is a stack?

7. What is a queue?

8. Difference between stack and queue?

9. What is a deque?

10. What is a priority queue?

11. What is a hash table?

12. What is hashing?

13. What are collisions in hashing?

14. What is a binary tree?

15. What is a binary search tree?

16. What is AVL tree?

17. What is heap?

18. Min Heap vs Max Heap?

19. What is a graph?

20. Types of graphs?

21. What is graph traversal?

22. BFS vs DFS?

23. What is a trie?

24. What is a segment tree?

25. What is Fenwick tree?

26. What is disjoint set Union-Find?

27. What is adjacency matrix?

28. What is adjacency list?

29. What is a circular linked list?

30. What is doubly linked list?

31. What is a sparse matrix?

32. What is dynamic array?

33. What is load factor?

34. What is collision resolution?

35. Linear probing vs chaining?

36. What is tree traversal?

37. Preorder vs Inorder vs Postorder?

38. What is level-order traversal?

39. What is recursion stack?

40. Time complexity of common data structures?

🚀 4. Algorithms

1. What is an algorithm?

2. What is time complexity?

3. What is space complexity?

4. What is Big O notation?

5. What is Big Theta notation?

6. What is Big Omega notation?

7. What is binary search?

8. What is linear search?

9. Difference between linear and binary search?

10. What is merge sort?

11. What is quick sort?

12. What is bubble sort?

13. What is insertion sort?

14. What is selection sort?

15. What is heap sort?

16. What is counting sort?

17. What is radix sort?

18. What is divide and conquer?

19. What is greedy algorithm?

20. What is dynamic programming?

21. What is memoization?

22. What is tabulation?

23. What is backtracking?

24. What is branch and bound?

25. What is recursion?

26. What is tail recursion?

27. What is sliding window?

28. What is two pointers technique?