Data Structures and Algorithms Problems

Array

     

  1. Find pair with given sum in the array
     
  2. Check if subarray with 0 sum is exists or not
     
  3. Print all sub-arrays with 0 sum
     
  4. Sort binary array in linear time
     
  5. Find a duplicate element in a limited range array
     
  6. Find largest sub-array formed by consecutive integers
     
  7. Find maximum length sub-array having given sum
     
  8. Find maximum length sub-array having equal number of 0’s and 1’s
     
  9. Sort an array containing 0’s, 1’s and 2’s(Dutch national flag problem)
     
  10. Inplace merge two sorted arrays
     
  11. Merge two arrays by satisfying given constraints
     
  12. Find index of 0 to replaced to get maximum length sequence of continuous ones
     
  13. Find maximum product of two integers in an array
     
  14. Shuffle a given array of elements (Fisher–Yates shuffle)
     
  15. Rearrange the array with alternate high and low elements
     
  16. Find equilibrium index of an array
     
  17. Find majority element in an array (Boyer–Moore majority vote algorithm)
     
  18. Move all zeros present in the array to the end
     
  19. Replace each element of array with product of every other element without using / operator
     
  20. Find Longest Bitonic Subarray in an array
     
  21. Find maximum difference between two elements in the array by satisfying given constraints
     
  22. Maximum subarray problem (Kadane’s algorithm)
     
  23. Print continuous subarray with maximum sum
     
  24. Maximum Sum Circular Subarray
     
  25. Find all distinct combinations of given length
     
  26. Find all distinct combinations of given length with repetition allowed
     
  27. Find maximum sequence of continuous 1’s formed by replacing at-most k zeroes by ones
     
  28. Find minimum sum subarray of given size k
     
  29. Find subarray having given sum in given array of integers
     
  30. Find the length of smallest subarray whose sum of elements is greater than the given number
     
  31. Find largest number possible from set of given numbers
     
  32. Find the smallest window in array sorting which will make the entire array sorted
     
  33. Find maximum sum path involving elements of given arrays
     
  34. Maximum profit earned by buying and selling shares any number of times
     
  35. Trapping Rain Water within given set of bars
     
  36. Longest Increasing Subsequence
     
  37. Longest Decreasing Subsequence Problem
     
  38. Find maximum product subarray in a given array
     
  39. Find maximum sum of subsequence with no adjacent elements
     
  40. Find minimum platforms needed in the station so to avoid any delay in arrival of any train
     
  41. Decode the array constructed from another array
     
  42. Sort an array using one swap
     
  43. Find Triplet with given sum in an array
     
  44. Length of longest continuous sequence with same sum in given binary arrays
     
  45. Rearrange array such that A[A[i]] is set to i for every element A[i]
     
  46. Reverse every consecutive m elements of the given subarray
     
  47. Maximum Product Subset Problem
     
  48. Find pairs with given difference k in the array
     
  49. Find pairs with given difference k in the array | Constant space solution
     
  50. 4 sum problem | Quadruplets with given sum
     
  51. Print all quadruplets with given sum | 4-sum problem extended
     
  52. Find odd occurring element in an array in single traversal
     
  53. Find two odd occurring element in an array without using any extra space
     
  54. Quickselect Algorithm
     
  55. Print all Triplets that forms Arithmetic Progression
     
  56. Print all triplets that forms Geometric Progression
     
  57.  

  58. Merging Overlapping Intervals
     
  59. Activity Selection Problem
     
  60. Job Sequencing Problem with Deadlines
     
  61. Introduction to Priority Queues using Binary Heaps
     
  62. Min Heap and Max Heap Implementation in C++
     
  63. Min Heap and Max Heap Implementation in Java
     
  64. Heap Sort (Out-of-place and In-place implementation in C++ and C)
     
  65. Check if given array represents min heap or not
     
  66. Convert Max Heap to Min Heap in linear time
     
  67. Find K’th largest element in an array
     
  68. Sort a K-Sorted Array
     
  69. Merge M sorted lists of variable length
     
  70. Find K’th smallest element in an array
     
  71. Find smallest range with at-least one element from each of the given lists
     
  72. Merge M sorted lists each containing N elements
     
  73. Insertion sort | Iterative & Recursive
     
  74. Selection sort | Iterative & Recursive
     
  75. Bubble sort | Iterative & Recursive
     
  76. Merge Sort
     
  77. Quicksort
     
  78. Iterative Implementation of Quicksort
     
  79. Hybrid QuickSort
     
  80. Quicksort using Dutch National Flag Algorithm
     
  81. Quick Sort using Hoare’s Partitioning scheme
     
  82. External merge sort
     
  83. Custom Sort | Sort elements by their frequency and Index
     
  84. Custom Sort | Sort elements of the array by order of elements defined by the second array
     
  85. Inversion Count of an array
     
  86. Segregate positive and negative integers in linear time
     
  87. Binary Search
     
  88. Ternary Search vs Binary search
     
  89. Interpolation search
     
  90. Exponential search
     
  91. Find number of rotations in a circularly sorted array
     
  92. Search an element in a circular sorted array
     
  93. Find first or last occurrence of a given number in a sorted array
     
  94. Count occurrences of a number in a sorted array with duplicates
     
  95. Find smallest missing element from a sorted array
     
  96. Find Floor and Ceil of a number in a sorted array
     
  97. Search in a nearly sorted array in O(logn) time
     
  98. Find number of 1’s in a sorted binary array
     
  99. Find the peak element in an array
     
  100. Maximum Sum Subarray using Divide & Conquer
     
  101. Find Minimum and Maximum element in an array using minimum comparisons
     
  102. Matrix Chain Multiplication
     
  103. 0-1 Knapsack problem
     
  104. Maximize value of the expression
     
  105. Partition problem
     
  106. Subset sum problem
     
  107. Minimum Sum Partition problem
     
  108. Rod Cutting
     
  109. Coin change-making problem (unlimited supply of coins)
     
  110. Coin Change Problem (Total number of ways to get the denomination of coins)
     
  111. Longest alternating subsequence
     
  112. Combinations of words formed by replacing given numbers with corresponding alphabets
     
  113. Decode the given sequence to construct minimum number without repeated digits
     
  114. All combinations of elements satisfying given constraints
     
  115. Find Missing Term in a Sequence in log(n) time
     
  116. Print all distinct Subsets of a given Set
     
  117. Find Floor and Ceil of a number in a sorted array (Recursive solution)
     
  118. Set both elements of a binary array to 0 in single line
     
  119. K-Partition Problem | Printing all Partitions
     
  120. 3 Partition Problem
     
  121. 3-partition problem extended | Print all partitions
     
  122. Iterative Merge Sort Algorithm (Bottom-up Merge Sort)
     
  123. Find two duplicate elements in an limited range array (using XOR)
     
  124. Find missing number and duplicate elements in an array
     
  125. Find Minimum and Maximum element in an array by doing minimum comparisons
     
  126. Find Frequency of each element in a sorted array containing duplicates
     
  127. Difference between Subarray, Subsequence and Subset
     

Backtracking

Bit Manipulation

 

  1. Bit Hacks – Part 1 (Basic)
     
  2. Bit Hacks – Part 2 (Playing with k’th bit)
     
  3. Bit Hacks – Part 3 (Playing with rightmost set bit of a number)
     
  4. Bit Hacks – Part 4 (Playing with letters of English alphabet)
     
  5. Bit Hacks – Part 5 (Find absolute value of an integer without branching)
     
  6. Bit Hacks – Part 6 (Random Problems)
     
  7. Brian Kernighan’s Algorithm to count set bits in an integer
     
  8. Compute parity of a number using lookup table
     
  9. Count set bits using lookup table
     
  10. Find the minimum or maximum of two integers without using branching
     
  11. Multiply 16-bit integers using 8-bit multiplier
     
  12. Round up to the next highest power of 2
     
  13. Round up to the previous power of 2
     
  14. Swap individual bits at given position in an integer
     
  15. Check if given number is power of 4 or not
     
  16. Reverse Bits of a given Integer
     
  17. Find odd occurring element in an array in single traversal
     
  18. Find two odd occurring element in an array without using any extra space
     
  19. Swap two bits at given position in an integer
     
  20. Add binary representation of two integers
     
  21. Swap Adjacent Bits of a Number
     
  22. Print all distinct Subsets of a given Set
     
  23. Perform Division of two numbers without using division operator (/)
     
  24. Check if adjacent bits are set in binary representation of a given number
     
  25. Conditionally negate a value without branching
     
  26. Find two duplicate elements in an limited range array (using XOR)
     
  27. Find missing number and duplicate elements in an array
     
  28. Check if given number is power of 8 or not
     
  29.  
     

  30. Generate binary numbers between 1 to N
     
  31. Efficiently implement power function | Recursive and Iterative
     
  32. Find square of a number without using multiplication and division operator | 3 methods
     
  33. Generate power set of a given set
     
  34. Huffman Coding
     

Binary Tree

 

  1. Check if two given binary trees are identical or not | Iterative & Recursive
     
  2. Calculate height of a binary tree | Iterative & Recursive
     
  3. Delete given Binary Tree | Iterative & Recursive
     
  4. Inorder Tree Traversal | Iterative & Recursive
     
  5. Preorder Tree Traversal | Iterative & Recursive
     
  6. Postorder Tree Traversal | Iterative & Recursive
     
  7. Level Order Traversal of Binary Tree
     
  8. Spiral Order Traversal of Binary Tree
     
  9. Reverse Level Order Traversal of Binary Tree
     
  10. Print all nodes of a given binary tree in specific order
     
  11. Print left view of binary tree
     
  12. Print Bottom View of Binary Tree
     
  13. Print Top View of Binary Tree
     
  14. Find next node in same level for given node in a binary tree
     
  15. Check if given binary tree is complete binary tree or not
     
  16. Determine if given two nodes are cousins of each other
     
  17. Print cousins of given node in a binary tree
     
  18. In-place convert given binary tree to its sum tree
     
  19. Check if given binary tree is a sum tree or not
     
  20. Combinations of words formed by replacing given numbers with corresponding alphabets
     
  21. Determine if given binary tree is a subtree of another binary tree or not
     
  22. Find diameter of a binary tree
     
  23. Check if given binary Tree has symmetric structure or not
     
  24. Convert binary tree to its mirror
     
  25. Check if binary tree can be converted to another by doing any no. of swaps of left & right child
     
  26. Find Lowest Common Ancestor (LCA) of two nodes in a binary tree
     
  27. Print all paths from root to leaf nodes in given binary tree
     
  28. Find ancestors of given node in a Binary Tree
     
  29. Find the distance between given pairs of nodes in a binary tree
     
  30. Find Vertical Sum in a given Binary Tree
     
  31. Print nodes in vertical order of a given Binary Tree (Vertical Traversal)
     
  32. Find the diagonal sum of given binary tree
     
  33. Print Diagonal Traversal of Binary Tree
     
  34. Print corner nodes of every level in binary tree
     
  35. In-place convert convert given Binary Tree to Doubly Linked List
     
  36. Sink nodes containing zero to the bottom of the binary tree
     
  37. Convert given binary tree to full tree by removing half nodes
     
  38. Truncate given binary tree to remove nodes which lie on a path having sum less than K
     
  39. Find maximum sum root-to-leaf path in a binary tree
     
  40. Check if given binary tree is height balanced or not
     
  41. Convert normal binary tree to Left-child right-sibling binary tree
     
  42. Determine if given Binary Tree is a BST or not
     
  43. Convert a Binary Tree to BST by maintaining its original structure
     
  44. Invert given Binary Tree | Recursive and Iterative solution
     
  45. Print Right View of a Binary Tree
     
  46. Print leaf to root path for every leaf node in a binary tree
     
  47. Find maximum width of given binary tree
     
  48. Build Binary Tree from given Parent array
     
  49. C++ Program to Print Binary Tree Structure
     

BST

Divide & Conquer

Dynamic Programming

 

  1. Introduction to Dynamic Programming
     
  2. Longest Common Subsequence | Introduction & LCS Length
     
  3. Longest Common Subsequence | Space optimized version
     
  4. Longest Common Subsequence of K-sequences
     
  5. Longest Common Subsequence | Finding all LCS
     
  6. Longest Common Substring problem
     
  7. Longest Palindromic Subsequence using Dynamic Programming
     
  8. Longest Repeated Subsequence problem
     
  9. Implement Diff Utility
     
  10. Shortest Common Supersequence | Introduction & SCS Length
     
  11. Shortest Common Supersequence | Finding all SCS
     
  12. Shortest Common Supersequence | Using LCS
     
  13. Longest Increasing Subsequence using Dynamic Programming
     
  14. Longest Bitonic Subsequence
     
  15. Increasing Subsequence with Maximum Sum
     
  16. The Levenshtein distance (Edit distance) problem
     
  17. Find size of largest square sub-matrix of 1’s present in given binary matrix
     
  18. Matrix Chain Multiplication
     
  19. Find the minimum cost to reach last cell of the matrix from its first cell
     
  20. Find longest sequence formed by adjacent numbers in the matrix
     
  21. Count number of paths in a matrix with given cost to reach destination cell
     
  22. 0-1 Knapsack problem
     
  23. Maximize value of the expression
     
  24. Partition problem
     
  25. Subset sum problem
     
  26. Minimum Sum Partition problem
     
  27. Find all N-digit binary strings without any consecutive 1’s
     
  28. Rod Cutting
     
  29. Maximum Product Rod Cutting
     
  30. Coin change-making problem (unlimited supply of coins)
     
  31. Coin Change Problem – Find total number of ways to get the denomination of coins
     
  32. Total possible solutions to linear equation of k variables
     
  33. Longest alternating subsequence
     
  34. Count number of times a pattern appears in given string as a subsequence
     
  35. Collect maximum points in a matrix by satisfying given constraints
     
  36. Count total possible combinations of N-digit numbers in a mobile keypad
     
  37. Find optimal cost to construct binary search tree
     
  38. Word Break Problem
     
  39. Word Break Problem | Using Trie Data Structure
     
  40. Wildcard Pattern Matching
     
     
  41. Find probability that a person is alive after taking N steps on the island
     
  42. Calculate sum of all elements in a sub-matrix in constant time
     
  43. Find maximum sum K x K sub-matrix in a given M x N matrix
     
  44. Find maximum sum submatrix present in a given matrix
     
  45. Find maximum sum of subsequence with no adjacent elements
     
  46. Maximum subarray problem (Kadane’s algorithm)
     
  47. Single-Source Shortest Paths – Bellman Ford Algorithm
     
  48. All-Pairs Shortest Paths – Floyd Warshall Algorithm
     
  49. Longest Decreasing Subsequence Problem
     
  50. Pots of Gold Game using Dynamic Programming
     
  51. Find minimum cuts needed for palindromic partition of a string
     
  52. Maximum Length Snake Sequence
     
  53. 3 Partition Problem
     
  54. Calculate size of the largest plus of 1’s in binary matrix
     
  55. Check if given string is interleaving of two other given strings
     
  56. Longest Increasing Subsequence using LCS
     

Graphs

 

  1. Terminology and Representations of Graphs
     
  2. Graph Implementation using STL
     
  3. Graph Implementation in C++ without using STL
     
  4. Implement Graph Data Structure in C
     
  5. Graph Implementation in Java using Collections
     
  6. Breadth First Search (BFS) | Iterative & Recursive Implementation
     
  7. Depth First Search (DFS) | Iterative & Recursive Implementation
     
  8. Arrival and Departure Time of Vertices in DFS
     
  9. Types of edges involved in DFS and relation between them
     
  10. Bipartite Graph
     
  11. Determine if a given graph is Bipartite Graph using DFS
     
  12. Minimum number of throws required to win Snake and Ladder game
     
  13. Topological Sorting in a DAG
     
  14. Kahn’s Topological Sort Algorithm
     
  15. Transitive Closure of a Graph
     
  16. Check if an undirected graph contains cycle or not
     
  17. Total paths in given digraph from given source to destination having exactly m edges
     
  18. Determine if an undirected graph is a Tree (Acyclic Connected Graph)
     
  19. 2-Edge Connectivity in the graph
     
  20. 2-Vertex Connectivity in the graph
     
  21. Check if given digraph is a DAG (Directed Acyclic Graph) or not
     
  22. Disjoint-Set Data Structure (Union-Find Algorithm)
     
  23. Chess Knight Problem – Find Shortest path from source to destination
     
  24. Check if given Graph is Strongly Connected or not
     
  25. Check if given Graph is Strongly Connected or not using one DFS Traversal
     
  26. Union-Find Algorithm for Cycle Detection in undirected graph
     
  27. Kruskal’s Algorithm for finding Minimum Spanning Tree
     
  28. Single-Source Shortest Paths – Dijkstra’s Algorithm
     
  29. Single-Source Shortest Paths – Bellman Ford Algorithm
     
  30. All-Pairs Shortest Paths – Floyd Warshall Algorithm
     
  31. Find Cost of Shortest Path in DAG using one pass of Bellman-Ford
     
  32. Least Cost Path in Weighted Digraph using BFS
     
  33.  
     

  34. Print all k-colorable configurations of the graph (Vertex coloring of graph)
     
  35. Print All Hamiltonian Path present in a graph
     
  36. Greedy coloring of graph
     

Heap

Linked List

 

  1. Introduction to Linked Lists
     
  2. Linked List Implementation | Part 1
     
  3. Linked List Implementation | Part 2
     
  4. Static Linked List in C
     
  5. Clone given Linked List
     
  6. Delete Linked List
     
  7. Pop operation in linked list
     
  8. Insert given node into the correct sorted position in the given sorted linked list
     
  9. Given a linked list, change it to be in sorted order
     
  10. Split the nodes of the given linked list into front and back halves
     
  11. Remove duplicates from a sorted linked list
     
  12. Move front node of the given list to the front of the another list
     
  13. Move even nodes to the end of the list in reverse order
     
  14. Split given linked list into two lists where each list containing alternating elements from it
     
  15. Construct a linked list by merging alternate nodes of two given lists
     
  16. Merge given sorted linked lists into one
     
  17. Merge Sort Algorithm for Singly Linked List
     
  18. Intersection of two given sorted linked lists
     
  19. Reverse linked list | Part 1 (Iterative Solution)
     
  20. Reverse linked list | Part 2 (Recursive Solution)
     
  21. Reverse every group of k nodes in given linked list
     
  22. Find K’th node from the end in a linked list
     
  23. Merge alternate nodes of two linked lists into the first list
     
  24. Merge two sorted linked lists from their end
     
  25. Delete every N nodes in a linked list after skipping M nodes
     
  26. Rearrange linked list in specific manner in linear time
     
  27. Check if linked list is palindrome or not
     
  28. Move last node to front in a given Linked List
     
  29. Rearrange the linked list in specific manner
     
  30. Detect Cycle in a linked list (Floyd’s Cycle Detection Algorithm)
     
  31. Sort linked list containing 0’s, 1’s and 2’s
     
  32. Stack Implementation using Linked List
     
  33. Queue Implementation using Linked List
     
  34. Remove duplicates from a linked list
     
  35. Rearrange the linked list so that it has alternating high, low values
     

Matrix

 

  1. Print Matrix in Spiral Order
     
  2. Create Spiral Matrix from given array
     
  3. Shift all matrix elements by 1 in Spiral Order
     
  4. Find Shortest path from source to destination in a matrix that satisfies given constraints
     
  5. Change all elements of row i and column j in a matrix to 0 if cell (i, j) has value 0
     
  6. Print diagonal elements of the matrix having positive slope
     
  7. Find all paths from first cell to last cell of a matrix
     
  8. Replace all occurrences of 0 that are not surrounded by 1 in a binary matrix
     
  9. In-place rotate the matrix by 90 degrees in clock-wise direction
     
  10. Count negative elements present in sorted matrix in linear time
     
  11. Report all occurrences of an element in row wise and column wise sorted matrix in linear time
     
  12. Calculate sum of all elements in a sub-matrix in constant time
     
  13. Find maximum sum K x K sub-matrix in a given M x N matrix
     
  14. Find maximum sum submatrix present in a given matrix
     
  15. Find probability that a person is alive after taking N steps on the island
     
  16. Count the number of islands
     
  17. Flood fill Algorithm
     
  18. Find shortest safe route in a field with sensors present
     
  19. Find all occurrences of given string in a character matrix
     
  20. Shortest path in a Maze | Lee algorithm
     
  21. Check if given matrix is Toeplitz matrix or not
     
  22. In-place rotate the matrix by 180 degrees
     
  23. Fill Binary Matrix with Alternating Rectangles of 0 and 1
     
  24.  
     

  25. Travelling Salesman Problem using Branch and Bound
     
  26. Collect maximum points in a matrix by satisfying given constraints
     
  27. Count number of paths in a matrix with given cost to reach destination cell
     
  28. Find longest sequence formed by adjacent numbers in the matrix
     
  29. Find the minimum cost to reach last cell of the matrix from its first cell
     
  30. Matrix Chain Multiplication
     
  31. Find size of largest square sub-matrix of 1’s present in given binary matrix
     
  32. Chess Knight Problem – Find Shortest path from source to destination
     
  33. Find Duplicate rows in a binary matrix
     
  34. Print all possible solutions to N Queens problem
     
  35. Print all Possible Knight’s Tours in a chessboard
     
  36. Find Shortest Path in Maze
     
  37. Find Longest Possible Route in a Matrix
     
  38. Calculate size of the largest plus of 1’s in binary matrix
     

Queue

Sorting

 

  1. Insertion sort | Iterative & Recursive
     
  2. Selection sort | Iterative & Recursive
     
  3. Bubble sort | Iterative & Recursive
     
  4. Merge Sort Algorithm
     
  5. Iterative Merge Sort Algorithm (Bottom-up Merge Sort)
     
  6. Quicksort Algorithm
     
  7. Iterative Implementation of Quicksort
     
  8. Hybrid QuickSort
     
  9. Quicksort using Dutch National Flag Algorithm
     
  10. Quick Sort using Hoare’s Partitioning scheme
     
  11. External merge sort
     
  12. Counting Sort Algorithm
     
  13. Custom Sort | Sort elements by their frequency and Index
     
  14. Custom Sort | Sort elements of the array by order of elements defined by the second array
     
  15. Inversion Count of an array
     
  16. Segregate positive and negative integers in linear time
     
  17. Efficiently Sort an Array with many Duplicated Values
     
  18.  
     

  19. Find the smallest window in array sorting which will make the entire array sorted
     
  20. Find largest number possible from set of given numbers
     
  21. Move all zeros present in the array to the end
     
  22. Sort binary array in linear time
     
  23. Sort linked list containing 0’s, 1’s and 2’s
     
  24. Merge Sort Algorithm for Singly Linked List
     
  25. Group anagrams together from given list of words
     
  26. Activity Selection Problem
     
  27. Lexicographic sorting of given set of keys
     
  28. Heap Sort
     
  29. Merge M sorted lists of variable length
     
  30. Merge M sorted lists each containing N elements
     
  31. Find all palindromic permutations of a string
     
  32. Find all lexicographically next permutations of a string sorted in ascending order
     
  33. Merge two sorted linked lists from their end
     
  34. Sort an array containing 0’s, 1’s and 2’s (Dutch national flag problem)
     
  35. Find pair with given sum in the array
     
  36. Inplace merge two sorted arrays
     
  37. Merge two arrays by satisfying given constraints
     
  38. Find maximum product of two integers in an array
     
  39. Find all distinct combinations of given length
     
  40. Find all distinct combinations of given length with repetition allowed
     
  41. Merging Overlapping Intervals
     
  42. Print all quadruplets with given sum | 4-sum problem extended
     
  43. 4 sum problem | Quadruplets with given sum
     

Stack

String

 

  1. Check if given string is a rotated palindrome or not
     
  2. Longest Palindromic Substring (Non-DP Space Optimized Solution)
     
  3. Check if repeated subsequence is present in the string or not
     
  4. Check if strings can be derived from each other by circularly rotating them
     
  5. Check if given set of moves is circular or not
     
  6. Convert given number into corresponding excel column name
     
  7. Determine if two strings are anagram or not
     
  8. Find all binary strings that can be formed from given wildcard pattern
     
  9. Find all interleavings of given strings
     
  10. Isomorphic Strings
     
  11. Find all possible palindromic substrings in a string
     
  12. Find all possible combinations of words formed from mobile keypad
     
  13. Find all possible combinations by replacing given digits with characters of the corresponding list
     
  14. Find all words from given list that follows same order of characters as given pattern
     
  15. Find first k non-repeating characters in a string in single traversal
     
  16. Group anagrams together from given list of words
     
  17. Introduction to Pattern Matching
     
  18. Inplace remove all occurrences of ‘AB’ and ‘C’ from the string
     
  19. Longest even length palidromic sum substring
     
  20. Print string in zig-zag form in k rows
     
  21. Reverse given text without reversing the individual words
     
  22. Run Length Encoding (RLE) data compression algorithm
     
  23. Validate an IP address
     
  24. Find the longest substring of given string containing k distinct characters
     
  25. Find all palindromic permutations of a string
     
  26. Find all substrings of a string that are permutation of a given string
     
  27. Find the longest substring of given string containing all distinct characters
     
  28. Find all Permutations of a given string
     
  29. Iterative Approach to find Permutations of a String in C++ and Java
     
  30. Generate all Permutations of a String in Java | Recursive & Iterative
     
  31. Find all lexicographically next permutations of a string sorted in ascending order
     
  32. Find Lexicographically minimal string rotation
     
  33. Find all strings of given length containing balanced parentheses
     
  34. Find all N-digit strictly increasing numbers (Bottom-Up and Top-Down Approach)
     
  35. Find all N-digit binary numbers having more 1’s than 0’s for any prefix
     
  36. Find all N-digit numbers with given sum of digits
     
  37. Find all N-digit binary numbers with k-bits set where k ranges from 1 to N
     
  38. Generate binary numbers between 1 to N
     
  39. Find all combinations of non-overlapping substrings of a string
     
  40. Check if given sentence is syntactically correct or not
     
  41. Calculate rank of given string among all its lexicographically sorted permutations
     
  42. Find all Lexicographic Permutations of a String
     
  43. Find all N-digit binary numbers with equal sum of bits in its two halves
     
  44. Check if given string is interleaving of two other given strings
     
  45. Difference between Subarray, Subsequence and Subset
     
  46. std::next_permutation | Overview & Implementation in C++
     
  47. std::prev_permutation | Overview & Implementation in C++
     
  48. Implementation of KMP Algorithm in C, C++ and Java
     
  49. Reverse String without using Recursion
     
  50. Reverse given string using Recursion
     
  51. Reverse a String in Java in 10 different ways
     
  52. Determine if a given string is palindrome or not
     
  53.  
     

  54. Combinations of words formed by replacing given numbers with corresponding alphabets
     
  55. Word Break Problem
     
  56. Wildcard Pattern Matching
     
  57. Count number of times a pattern appears in given string as a subsequence
     
  58. The Levenshtein distance (Edit distance) problem
     
  59. Longest Common Subsequence | Introduction & LCS Length
     
  60. Longest Common Subsequence | Space optimized version
     
  61. Longest Common Subsequence of K-sequences
     
  62. Longest Common Subsequence | Finding all LCS
     
  63. Longest Repeated Subsequence problem
     
  64. Longest Palindromic Subsequence using Dynamic Programming
     
  65. Longest Common Substring problem
     
  66. Shortest Common Supersequence | Introduction & SCS Length
     
  67. Shortest Common Supersequence | Finding all SCS
     
  68. Shortest Common Supersequence | Using LCS
     
  69. Implement Diff Utility
     
  70. Word Break Problem | Using Trie Data Structure
     
  71. Find minimum cuts needed for palindromic partition of a string
     

Trie

Greedy

Puzzles

 

  1. Clock angle problem – Find angle between hour and minute hand
     
  2. Add two numbers without using addition operator | 4 methods
     
  3. Generate power set of a given set
     
  4. Implement power function without using multiplication and division operators
     
  5. Print all numbers between 1 to N without using semicolon
     
  6. Swap two numbers without using third variable | 5 methods
     
  7. Determine the if condition to print specific output
     
  8. Find maximum, minimum of three numbers without using conditional statement and ternary operator | 4 methods
     
  9. Find numbers represented as sum of two cubes for two different pairs
     
  10. Print “Hello World” with empty main() function | 3 methods
     
  11. Tower of Hanoi Problem
     
  12. Print all numbers between 1 to N without using any loop | 4 methods
     
  13. Print a semicolon without using semicolon anywhere in the program
     
  14. Multiply two numbers without using multiplication operator or loops
     
  15. Find square of a number without using multiplication and division operator | 3 methods
     
  16. Find if a number is even or odd without using any conditional statement
     
  17. Set both elements of a binary array to 0 in single line
     
  18. Find minimum number without using conditional statement or ternary operator
     
  19. Perform Division of two numbers without using division operator (/)
     
  20. Generate 0 and 1 with 75% and 25% Probability
     
  21. Generate Desired Random Numbers With Equal Probability
     
  22. Return 0, 1 and 2 with equal Probability using the specified function
     
  23. Generate Fair Results from a Biased Coin
     
  24. Generate numbers from 1 to 7 with equal probability using specified function
     
  25. Implement Ternary Operator Without Using Conditional Expressions
     
  26. Determine if two integers are equal without using comparison and arithmetic operators
     
  27. Return 0 and 1 with equal Probability using the specified function
     
  28. Magnet Puzzle
     

STL

Recursion

Hashing

 
  Other links:
 




 
 

Thank you all being with us. 🙂

 




Leave a Reply

Notify of
avatar
Sort by:   newest | oldest | most voted
kimmy314
Guest
kimmy314

I personally found reading this very helpful. Read the problem, come up with a solution, compare your solution, read on to see if there is an optimization, think about the optimization, implement it, then go back and read about their optimized solution. Some problems have 4-5 stages of optimization which I found were good to read and simulates an interview better – building in small steps and increasingly getting harder.

Surya
Guest
Surya

Instead of “bookmarking and forgetting,” I’m making this my home page so I can do one of these a day. My goal will be to use this to both practice my skills, and learn new languages.
Thanks for compiling the list!

Alison M.
Guest
Alison M.

Thank you for this! I think I’m going to make this my home screen as well; or set an alert to visit the site at least once a day. I’ve gone through a few technical interviews. This will help me prep, get better at programming and feel more confident overall.

Pete
Guest
Pete

Bible for interview preparation (y)

Amit
Guest
Amit

This is surprisingly nice list. All problems I have encountered so far were very challenging..

Dave
Guest
Dave

While obtaining the correct solution is optimal, I believe these interview questions are supposed to gauge a person’s ability to think out loud and ability to flesh out a decent plan of attack. If you start writing code immediately without asking any questions then it’s not going to end well.

peter
Guest
peter

I’ve given technical tests to people in interviews before, and the problem has always been the same one, with a bit of tweaking here and there. The test lasts 90 minutes, using a laptop with an IDE.
To tell the truth I hate doing it, mainly because when I got asked to give the test, I spent some time tackling the problem myself just so I could get an idea of what was expected – I genuinely didn’t think I would have passed the new technical test for the company I was employed at!
I think that biases the interview somewhat as you sit there judging someone on a problem you’ve had the luxury of solving yourself in a more relaxed environment.
Maybe a better approach would be both interviewer and interviewee are given a problem from an independent third party. That way both of you have to work through it together, although I’m not sure of the practical realities of that.

Justin
Guest
Justin

Bookmarked this for when I actually know algorithms and data structures.

Sean
Guest
Sean

Just found out yesterday that I’ll be having my first interview for a Google Software Engineering position in about a month. This is truly going to be invaluable, thank you!

jlash0
Guest
jlash0

I flunked out of a half dozen first round technical interviews. Amazon, Microsoft, Google, a few startups, Facebook, etc. My mind would always blank out when it came to solving problems.

mike
Guest
mike

very useful, thkx~

henderson
Guest
henderson

This is great, thanks ^

Nilesh
Guest
Nilesh

This is awesome. Many thanks.

Adam
Guest
Adam

I really like the way this page is organized…

KKK
Guest

Is it normal that I won’t be able to answer most of these questions myself ?

Kunal
Guest
Kunal

Thanks I was looking for more of these challenges/questions.

GuyverGordon
Guest
GuyverGordon

Thank you so much this. This is truly an amazing site; something that I will use quite frequently in the months to come with my studies.

wpDiscuz