awesome-interview-questions

A massive collection of interview questions for software engineers, data scientists, QA testers, DevOps, and mobile developers. Categorized by role and technology.

Creator: DOP251
Stars ⭐️: 80,500
Forked by: 9,300

Github Repo:
https://github.com/DopplerHQ/awesome-interview-questions

#Interviews #Careers #Tech
➖➖➖➖➖➖➖➖➖➖➖➖➖➖
Join @github_repositories_bds for more cool repositories. This channel belongs to @bigdataspecialist group

✅ Top 50 DSA (Data Structures & Algorithms) Interview Questions 📚⚙️

1. What is a Data Structure? 
2. What are the different types of data structures? 
3. What is the difference between Array and Linked List? 
4. How does a Stack work? 
5. What is a Queue? Difference between Queue and Deque? 
6. What is a Priority Queue? 
7. What is a Hash Table and how does it work? 
8. What is the difference between HashMap and HashSet? 
9. What are Trees? Explain Binary Tree. 
10. What is a Binary Search Tree (BST)? 
11. What is the difference between BFS and DFS? 
12. What is a Heap? 
13. What is a Trie? 
14. What is a Graph? 
15. Difference between Directed and Undirected Graph? 
16. What is the time complexity of common operations in arrays and linked lists? 
17. What is recursion? 
18. What are base case and recursive case? 
19. What is dynamic programming? 
20. Difference between Memoization and Tabulation? 
21. What is the Sliding Window technique? 
22. Explain Two-Pointer technique. 
23. What is the Binary Search algorithm? 
24. What is the Merge Sort algorithm? 
25. What is the Quick Sort algorithm? 
26. Difference between Merge Sort and Quick Sort? 
27. What is Insertion Sort and how does it work? 
28. What is Selection Sort?
29. What is Bubble Sort and its drawbacks? 
30. What is the time and space complexity of sorting algorithms? 
31. What is Backtracking? 
32. Explain the N-Queens Problem. 
33. What is the Kadane's Algorithm? 
34. What is Floyd’s Cycle Detection Algorithm? 
35. What is the Union-Find (Disjoint Set) algorithm? 
36. What are topological sorting and its uses? 
37. What is Dijkstra's Algorithm? 
38. What is Bellman-Ford Algorithm? 
39. What is Kruskal’s Algorithm? 
40. What is Prim’s Algorithm? 
41. What is Longest Common Subsequence (LCS)? 
42. What is Longest Increasing Subsequence (LIS)? 
43. What is a Palindrome Substring problem? 
44. What is the difference between greedy and dynamic programming? 
45. What is Big-O notation? 
46. What is the difference between time and space complexity? 
47. How to find the time complexity of a recursive function? 
48. What are amortized time complexities? 
49. What is tail recursion? 
50. How do you approach solving a coding problem in interviews?

💬 Tap ❤️ for the detailed answers!

✅ Top DSA Interview Questions with Answers: Part-1 🧠

1. What is a Data Structure? 
A data structure is a way to organize, store, and manage data efficiently so it can be accessed and modified easily. Examples: Arrays, Linked Lists, Stacks, Queues, Trees, Graphs.

2. What are the different types of data structures? 
- Linear: Arrays, Linked Lists, Stacks, Queues 
- Non-linear: Trees, Graphs 
- Hash-based: Hash Tables, Hash Maps 
- Dynamic: Heaps, Tries, Disjoint Sets

3. What is the difference between Array and Linked List? 
- Array: Fixed size, index-based access (O(1)), insertion/deletion is expensive 
- Linked List: Dynamic size, sequential access (O(n)), efficient insertion/deletion at any position

4. How does a Stack work? 
A Stack follows LIFO (Last In, First Out) principle. 
- Operations: push() to add, pop() to remove, peek() to view top 
- Used in: undo mechanisms, recursion, parsing

5. What is a Queue? Difference between Queue and Deque? 
A Queue follows FIFO (First In, First Out). 
- Deque (Double-Ended Queue): Allows insertion/removal from both ends. 
- Used in scheduling, caching, BFS traversal.

6. What is a Priority Queue? 
A type of queue where each element has a priority.
- Higher priority elements are dequeued before lower ones. 
- Implemented using heaps.

7. What is a Hash Table and how does it work? 
A structure that maps keys to values using a hash function. 
- Allows O(1) average-case lookup, insert, delete. 
- Handles collisions using chaining or open addressing.

8. What is the difference between HashMap and HashSet? 
- HashMap: Stores key-value pairs 
- HashSet: Stores only unique keys (no values) 
Both use hash tables internally.

9. What are Trees? Explain Binary Tree. 
A tree is a non-linear structure with nodes connected hierarchically. 
- Binary Tree: Each node has at most 2 children (left, right). 
Used in hierarchical data, parsers, expression trees.

10. What is a Binary Search Tree (BST)? 
A special binary tree where: 
- Left child < Node < Right child 
- Enables fast lookup, insert, and delete in O(log n) (average case). 
Maintains sorted structure.

Double Tap ♥️ For Part-2

✅ Top DSA Interview Questions with Answers: Part-2 🧠

11. What is the difference between BFS and DFS? 
- BFS (Breadth-First Search): Explores neighbors first (level by level). Uses a queue. 
- DFS (Depth-First Search): Explores depth (child nodes) first. Uses a stack or recursion. 
Used in graph/tree traversals, pathfinding, cycle detection.

12. What is a Heap? 
A binary tree with heap properties: 
- Max-Heap: Parent ≥ children 
- Min-Heap: Parent ≤ children 
Used in priority queues, heap sort, scheduling algorithms.

13. What is a Trie? 
A tree-like data structure used to store strings. 
Each node represents a character. 
Used in: autocomplete, spell-checkers, prefix search.

14. What is a Graph? 
A graph is a collection of nodes (vertices) and edges. 
- Can be directed/undirected, weighted/unweighted. 
Used in: networks, maps, recommendation systems.

15. Difference between Directed and Undirected Graph? 
- Directed: Edges have direction (A → B ≠ B → A) 
- Undirected: Edges are bidirectional (A — B) 
Used differently based on relationships (e.g., social networks vs. web links).

16. What is the time complexity of common operations in arrays and linked lists? 
- Array: 
  - Access: O(1)
- Insert/Delete: O(n) 
- Linked List: 
  - Access: O(n) 
  - Insert/Delete: O(1) at head

17. What is recursion? 
When a function calls itself to solve a smaller subproblem. 
Requires a base case to stop infinite calls. 
Used in: tree traversals, backtracking, divide & conquer.

18. What are base case and recursive case? 
- Base Case: Condition that ends recursion 
- Recursive Case: Part where the function calls itself 
Example: 

def fact(n):
    if n == 0: return 1   # base case
    return n * fact(n-1)  # recursive case

19. What is dynamic programming? 
An optimization technique that solves problems by breaking them into overlapping subproblems and storing their results (memoization). 
Used in: Fibonacci, knapsack, LCS.

20. Difference between Memoization and Tabulation? 
- Memoization (Top-down): Uses recursion + caching 
- Tabulation (Bottom-up): Uses iteration + table 
Both store solutions to avoid redundant calculations.

Double Tap ♥️ For Part-3

✅ Top DSA Interview Questions with Answers: Part-3 🧠

21. What is the Sliding Window technique? 
It’s an optimization method used to reduce time complexity in problems involving arrays or strings. You create a "window" over a subset of data and slide it as needed, updating results on the go. 
Example use case: Find the maximum sum of any k consecutive elements in an array.

22. Explain the Two-Pointer technique. 
This involves using two indices (pointers) to traverse a data structure, usually from opposite ends or the same direction. It's helpful for searching pairs or reversing sequences efficiently. 
Common problems: Two-sum, palindrome check, sorted array partitioning.

23. What is the Binary Search algorithm? 
It’s an efficient algorithm to find an element in a sorted array by repeatedly dividing the search range in half. 
Time Complexity: O(log n) 
Key idea: Compare the target with the middle element and eliminate half the array each step.

24. What is the Merge Sort algorithm? 
A divide-and-conquer sorting algorithm that splits the array into halves, sorts them recursively, and then merges them. 
Time Complexity: O(n log n) 
Stable? Yes 
Extra space? Yes, due to merging.

25. What is the Quick Sort algorithm?
It chooses a pivot, partitions the array so elements < pivot are left, and > pivot are right, then recursively sorts both sides. 
Time Complexity: Avg – O(n log n), Worst – O(n²) 
Fast in practice, but not stable.

26. Difference between Merge Sort and Quick Sort 
- Merge Sort is stable, consistent in performance (O(n log n)), but uses extra space. 
- Quick Sort is faster in practice and works in-place, but may degrade to O(n²) if pivot is poorly chosen.

27. What is Insertion Sort and how does it work? 
It builds the sorted list one item at a time by comparing and inserting items into their correct position. 
Time Complexity: O(n²) 
Best Case (nearly sorted): O(n) 
Stable? Yes 
Space: O(1)

28. What is Selection Sort? 
It finds the smallest element from the unsorted part and swaps it with the beginning. 
Time Complexity: O(n²) 
Space: O(1) 
Stable? No 
Rarely used due to inefficiency.

29. What is Bubble Sort and its drawbacks? 
It repeatedly compares and swaps adjacent elements if out of order. 
Time Complexity: O(n²) 
Space: O(1) 
Drawback: Extremely slow for large data. Educational, not practical.

30. What is the time and space complexity of common sorting algorithms?
- Bubble Sort → Time: O(n²), Space: O(1), Stable: Yes 
- Selection Sort → Time: O(n²), Space: O(1), Stable: No 
- Insertion Sort → Time: O(n²), Space: O(1), Stable: Yes 
- Merge Sort → Time: O(n log n), Space: O(n), Stable: Yes 
- Quick Sort → Avg Time: O(n log n), Worst: O(n²), Space: O(log n), Stable: No

Double Tap ♥️ For Part-4

✅ Top DSA Interview Questions with Answers: Part-4 📘⚙️

4️⃣1️⃣ What is Longest Common Subsequence (LCS)? 
LCS is the longest sequence that appears in the same order in both strings but not necessarily contiguously. 
Used in: diff tools, DNA sequencing. 
Approach: Dynamic Programming, O(n × m)

4️⃣2️⃣ What is Longest Increasing Subsequence (LIS)? 
It is the longest subsequence where each element is greater than the previous one. 
Approach: 
- DP: O(n²) 
- Binary Search: O(n log n)

4️⃣3️⃣ What is a Palindrome Substring problem? 
Find the longest or total number of substrings that are palindromes. 
Approach: 
- Expand Around Center (O(n²)) 
- DP Table 
- Manacher’s Algorithm (O(n))

4️⃣4️⃣ Difference between Greedy and Dynamic Programming? 
- Greedy: Makes the best local choice, may miss optimal global solution. 
- DP: Explores all choices with memoization, guarantees optimality. 
Example: 
- Greedy: Coin change (not always optimal) 
- DP: Coin change (optimal)

4️⃣5️⃣ What is Big-O Notation? 
It expresses time/space complexity in terms of input size n. 
Examples: 
- O(1): Constant 
- O(n): Linear 
- O(n²): Quadratic 
- O(log n): Binary Search

4️⃣6️⃣ Time vs Space Complexity? 
- Time Complexity: Time taken vs input size
- Space Complexity: Memory used 
Goal: Optimize both without sacrificing correctness.

4️⃣7️⃣ How to find time complexity of recursive function? 
Use Recurrence Relation 
Example: 
T(n) = T(n/2) + O(1) → O(log n) 
T(n) = 2T(n/2) + O(n) → O(n log n)

4️⃣8️⃣ What are Amortized Time Complexities? 
It’s the average time per operation over a sequence of operations. 
Example: Dynamic array resizing: 
- Most inserts: O(1) 
- Occasional resize: O(n) 
- Amortized: O(1)

4️⃣9️⃣ What is Tail Recursion? 
Recursive call is the last operation in the function. 
Benefit: Optimized by compilers to reduce stack usage. 
Example: 

def factorial(n, acc=1):
    if n == 0:
        return acc
    return factorial(n-1, acc*n)

5️⃣0️⃣ How to solve coding questions in interviews? 
- Understand the problem 
- Ask clarifying questions 
- Think out loud 
- Start with brute force 
- Optimize step-by-step 
- Test edge cases 
- Use clean, modular code

💬 Tap ❤️ for more!

Useful Algorithms for System Design Interviews

💻 Coding Interview Questions

1️⃣ What is the difference between an array and a linked list?
Answer: Arrays use contiguous memory and allow fast indexing. Linked lists use pointers and allow easy insert/delete.

2️⃣ What is time complexity?
Answer: It measures how runtime grows with input size (e.g., O(1), O(n), O(log n)).

3️⃣ What is a stack?
Answer: A data structure that follows LIFO (Last In, First Out).

4️⃣ What is a queue?
Answer: A data structure that follows FIFO (First In, First Out).

5️⃣ What is recursion?
Answer: A function calling itself until a base condition is met.

6️⃣ What is a hash table?
Answer: A data structure that stores key-value pairs for fast lookup.

7️⃣ Difference between == and === (or equivalent)?
Answer: == compares values, === compares value + type.

8️⃣ What is a variable?
Answer: A named storage location for data.

9️⃣ What is an infinite loop?
Answer: A loop that never stops because the exit condition is missing or false.

🔟 What is debugging?
Answer: The process of finding and fixing errors in code.

💻 Coding Interview Questions

1️⃣ What is an algorithm?
Answer: A step-by-step procedure to solve a problem.

2️⃣ What is Big-O notation?
Answer: It describes the worst-case time or space complexity of an algorithm.

3️⃣ What is a binary search?
Answer: A search algorithm that repeatedly divides a sorted array in half.

4️⃣ Linear search vs Binary search?
Answer: Linear search checks every element; binary search divides the search space (needs sorted data).

5️⃣ What is a function?
Answer: A reusable block of code that performs a specific task.

6️⃣ What is a compiler?
Answer: A program that translates source code into machine code.

7️⃣ What is an interpreter?
Answer: A program that executes code line by line.

8️⃣ What is a runtime error?
Answer: An error that occurs while the program is running.

9️⃣ What is memory leak?
Answer: When a program uses memory but fails to release it.

🔟 What is an exception?
Answer: An error that disrupts normal program execution and can be handled.

💻 Coding Interview Questions

1️⃣ What is an object?
Answer: An instance of a class containing data and methods.

2️⃣ What is a class?
Answer: A blueprint used to create objects.

3️⃣ What is OOP?
Answer: Object-Oriented Programming; it organizes code using objects and classes.

4️⃣ Name the four pillars of OOP.
Answer: Encapsulation, Inheritance, Polymorphism, Abstraction.

5️⃣ What is encapsulation?
Answer: Binding data and methods together and restricting direct access.

6️⃣ What is inheritance?
Answer: When a class derives properties and methods from another class.

7️⃣ What is polymorphism?
Answer: One interface, multiple implementations.

8️⃣ What is abstraction?
Answer: Hiding implementation details and showing only essentials.

9️⃣ What is an interface?
Answer: A contract that defines methods without implementation.

🔟 What is method overloading?
Answer: Multiple methods with the same name but different parameters.

PostgreSQL Architecture

💻 Coding Interview Questions

1️⃣ What is a database?
Answer: An organized collection of data for efficient storage and retrieval.

2️⃣ What is SQL?
Answer: Structured Query Language used to manage relational databases.

3️⃣ What is a primary key?
Answer: A unique identifier for each record in a table.

4️⃣ What is a foreign key?
Answer: A key that links one table to another.

5️⃣ What is normalization?
Answer: Organizing data to reduce redundancy.

6️⃣ What is an index in a database?
Answer: A structure that improves data retrieval speed.

7️⃣ What is a JOIN?
Answer: Combines rows from multiple tables based on a condition.

8️⃣ INNER JOIN vs LEFT JOIN?
Answer: INNER returns matching rows; LEFT returns all left-table rows.

9️⃣ What is ACID?
Answer: Atomicity, Consistency, Isolation, Durability.

🔟 What is a transaction?
Answer: A sequence of database operations executed as a single unit.

Program vs Process vs Thread

The “I’ve Never Seen This Before” Moment

🗯Scenario: The interviewer finishes explaining the problem and you realize you have never practiced anything like it.

👉 Do this: Shift into discovery mode. Ask about constraints, input size, and edge cases. Then propose a naive solution first and improve it. This shows structured thinking and calm problem solving, which often scores higher than instantly jumping to an optimal answer.

❔Interviewer:

Explain the difference between horizontal and vertical scaling.

✅ Answer:

Vertical scaling means increasing the resources of a single machine, such as adding more CPU or memory. It is simpler to implement but has hardware limits and can become a single point of failure.

Horizontal scaling means adding more machines and distributing the load across them. It provides better fault tolerance and scalability but introduces additional complexity such as load balancing, data consistency, and distributed coordination.

Modern high scale systems typically favor horizontal scaling because it supports elastic growth and higher availability.