1. What is an "Algorithm"?

An algorithm is a step-by-step procedure or set of instructions used to solve a specific problem or perform a calculation in a finite amount of time.

2. What are the key characteristics of a "Good Algorithm"?

Input: Must have zero or more inputs.
Output: Must have at least one result.
Definiteness: Each step must be clear and unambiguous.
Finiteness: It must terminate after a finite number of steps.
Effectiveness: Each step must be simple enough to be executed manually.

3. What is "Time Complexity"?

A way to describe how the execution time of an algorithm grows as the size of the input (n) increases (e.g., O(1), O(n), O(log n)).

4. What is "Space Complexity"?

A way to describe how the total memory used by an algorithm grows as the size of the input (n) increases.

5. What is "Big O Notation"?

A mathematical notation used to represent the upper bound of an algorithm's complexity, providing a worst-case scenario.

6. What is "Recursion"?

A method of solving problems where a function calls itself as a subroutine, allowing it to reduce a complex problem into simpler sub-problems.

7. What is "Divide and Conquer"?

An algorithmic paradigm that recursively breaks down a problem into two or more sub-problems of the same or related type until they become simple enough to be solved directly. (e.g., Merge Sort, Quick Sort).

8. What is "Dynamic Programming"?

An algorithmic technique used to solve complex problems by breaking them down into simpler sub-problems, solving each sub-problem only once, and storing its result using a table (e.g., Fibonacci, Longest Common Subsequence).

9. What is "Memoization"?

An optimization technique used in dynamic programming where the results of expensive function calls are cached and returned when the same input occurs again.

10. What is a "Greedy Algorithm"?

An algorithmic paradigm that makes a locally optimal choice at each step with the hope of finding a global optimum (e.g., Dijkstra's, Huffman Coding, Kruskal's).

11. What is the difference between "Dynamic Programming" and "Greedy"?

DP: Considers all possible sequences to find the global optimum; uses sub-problem results.
Greedy: Makes the best immediate choice at each step; doesn't reconsider previous choices.

12. What is "Backtracking"?

An algorithmic technique for finding solutions incrementally, one piece at a time, and removing those solutions that fail to satisfy the constraints of the problem (e.g., N-Queens, Sudoku).

13. What is "Linear Search"?

A simple search algorithm that checks every element in a list sequentially until a match is found or the end of the list is reached. Complexity: O(n).

14. What is "Binary Search"?

An efficient search algorithm for sorted arrays that repeatedly narrows down the search interval by half. Complexity: O(log n).

15. What are common "Sorting Algorithms"?

Bubble Sort (O(n²))
Selection Sort (O(n²))
Insertion Sort (O(n²))
Merge Sort (O(n log n))
Quick Sort (O(n log n) average)
Heap Sort (O(n log n))

16. What is "Bubble Sort"?

A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

17. What is "Selection Sort"?

A sorting algorithm that repeatedly finds the minimum element from the unsorted part and puts it at the beginning.

18. What is "Insertion Sort"?

A sorting algorithm that builds the final sorted array one item at a time, picking one element at a time and "inserting" it into its correct position.

19. What is "Merge Sort"?

A divide-and-conquer sorting algorithm that splits the array into halves, sorts them recursively, and then merges the sorted halves.

20. What is "Quick Sort"?

A divide-and-conquer sorting algorithm that picks a "pivot" element and partitions the array such that elements smaller than the pivot are on the left and larger elements are on the right.

21. What is "Stable" vs "Unstable" Sorting?

Stable: Preserves the relative order of equal elements (e.g., Merge Sort, Insertion Sort).
Unstable: Does not guarantee the relative order of equal elements (e.g., Quick Sort, Heap Sort).

22. What is "In-Place" Sorting?

An algorithm that uses only a constant amount of extra memory space (e.g., Selection Sort, Quick Sort).

23. What is "Binary Search Tree" (BST) Search?

Searching for a value in a BST by comparing it with the root and recursively searching in the left or right subtree. Complexity: O(h), where h is the height.

24. What is "Dijkstra's Algorithm"?

A greedy algorithm used to find the shortest paths between nodes in a graph with non-negative edge weights.

25. What is "Floyd-Warshall Algorithm"?

A dynamic programming algorithm used to find all-pairs shortest paths in a weighted graph.

26. What is "Prim's Algorithm"?

A greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected graph.

27. What is "Kruskal's Algorithm"?

A greedy algorithm used to find the MST by sorting all edges and adding them to the result one by one if they don't form a cycle.

28. What is "Bellman-Ford Algorithm"?

An algorithm used to find the shortest paths in a graph that might have negative edge weights (also detects negative cycles).

29. What is "Breadth-First Search" (BFS)?

A graph traversal algorithm that explores all neighbor nodes at the current depth before moving to the nodes at the next depth level.

30. What is "Depth-First Search" (DFS)?

A graph traversal algorithm that explores as far as possible along each branch before backtracking.

31. What is "Topological Sort"?

An ordering of nodes in a directed acyclic graph (DAG) such that for every directed edge U -> V, node U comes before node V in the ordering.

32. What is "Hashing"?

A technique used to map data of any size to fixed-size values (hash codes) for fast data retrieval.

33. What is "Amortized Analysis"?

A method for finding the average performance of an operation in a sequence of operations, even if some operations are expensive.

34. What is the "Master Theorem"?

A mathematical formula used to determine the time complexity of divide-and-conquer recurrences.

35. What is "NP-Complete"?

A class of decision problems in computational complexity theory that are the "hardest" in NP (Non-deterministic Polynomial time). If any one can be solved in polynomial time, all can.

36. What is "Traveling Salesperson Problem" (TSP)?

A classic optimization problem where you must find the shortest possible route that visits every city in a given set exactly once and returns to the origin.

37. What is "Knapsack Problem"?

An optimization problem where you must determine the number of items of each type to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.

38. What is "Rabin-Karp Algorithm"?

A string-searching algorithm that uses hashing to find any one of a set of pattern strings in a text.

39. What is "KMP (Knuth-Morris-Pratt) Algorithm"?

An efficient string-searching algorithm that avoids redundant comparisons by using information from previous matches.

40. What is "Huffman Coding"?

A greedy algorithm used for lossless data compression, assigning variable-length codes to input characters based on their frequencies.

41. What is "Bit Manipulation"?

The use of bitwise operators (AND, OR, XOR, NOT, shift) to perform operations on binary representations of data, often for performance optimization.

42. What is "Space-Time Trade-off"?

A situation in algorithm design where you can reduce execution time by using more memory, or vice versa.

43. What is "Randomized Algorithm"?

An algorithm that uses a degree of randomness as part of its logic to improve performance or find a solution (e.g., Randomized Quick Sort).

44. What is the complexity of "Heap Sort"?

O(n log n) in all cases (best, average, worst).

45. What is the difference between "Iteration" and "Recursion"?

Iteration: Uses a loop to repeat a set of instructions; generally more memory-efficient.
Recursion: A function calls itself; often cleaner but can use more memory (stack space).

46. What is "Sliding Window" Technique?

An algorithmic optimization used to handle problems involving arrays or strings by maintaining a "window" of elements that "slides" across the data.

47. What is "Two Pointers" Technique?

Using two pointers (indices) to traverse a linear data structure simultaneously, usually to find a pair of elements that satisfy a condition.

48. What is "Matrix Chain Multiplication"?

A dynamic programming problem of finding the most efficient way to multiply an given sequence of matrices.

49. What is "Towers of Hanoi"?

A mathematical game or puzzle that is a classic example of a recursive algorithm.

50. What is the importance of "Data Structures" for "Algorithms"?

Data structures are the foundational containers for data, and the efficiency of an algorithm is often determined by how it interacts with the chosen data structure.

Algorithms Interview Questions

Table of Contents

What is an "Algorithm"?

What are the key characteristics of a "Good Algorithm"?

What is "Time Complexity"?

What is "Space Complexity"?

What is "Big O Notation"?

What is "Recursion"?

What is "Divide and Conquer"?

What is "Dynamic Programming"?

What is "Memoization"?

What is a "Greedy Algorithm"?

What is the difference between "Dynamic Programming" and "Greedy"?

What is "Backtracking"?

What is "Linear Search"?

What is "Binary Search"?

What are common "Sorting Algorithms"?

What is "Bubble Sort"?

What is "Selection Sort"?

What is "Insertion Sort"?

What is "Merge Sort"?

What is "Quick Sort"?

What is "Stable" vs "Unstable" Sorting?

What is "In-Place" Sorting?

What is "Binary Search Tree" (BST) Search?

What is "Dijkstra's Algorithm"?

What is "Floyd-Warshall Algorithm"?

What is "Prim's Algorithm"?

What is "Kruskal's Algorithm"?

What is "Bellman-Ford Algorithm"?

What is "Breadth-First Search" (BFS)?

What is "Depth-First Search" (DFS)?

What is "Topological Sort"?

What is "Hashing"?

What is "Amortized Analysis"?

What is the "Master Theorem"?

What is "NP-Complete"?

What is "Traveling Salesperson Problem" (TSP)?

What is "Knapsack Problem"?

What is "Rabin-Karp Algorithm"?

What is "KMP (Knuth-Morris-Pratt) Algorithm"?

What is "Huffman Coding"?

What is "Bit Manipulation"?

What is "Space-Time Trade-off"?

What is "Randomized Algorithm"?

What is the complexity of "Heap Sort"?

What is the difference between "Iteration" and "Recursion"?

What is "Sliding Window" Technique?

What is "Two Pointers" Technique?

What is "Matrix Chain Multiplication"?

What is "Towers of Hanoi"?

What is the importance of "Data Structures" for "Algorithms"?