Data Structures and Algorithms Problems






 

  1. 1. Find a pair with the given sum in an array↗Easy
  2. 2. Check if a subarray with 0 sum exists or not↗Medium
  3. 3. Print all subarrays with 0 sum↗Medium
  4. 4. Sort binary array in linear time↗Easy
  5. 5. Find maximum length subarray having a given sum↗Medium
  6. 6. Find the largest subarray having an equal number of 0’s and 1’s↗Medium
  7. 7. Find the maximum product of two integers in an array↗Easy
  8. 8. Sort an array of 0’s, 1’s, and 2’s (Dutch National Flag Problem)↗Medium
  9. 9. In-place merge two sorted arrays↗Medium
  10. 10. Merge two arrays by satisfying given constraints↗Medium
  11. 11. Find index of 0 to be replaced to get the maximum length sequence of continuous ones↗Hard
  12. 12. Shuffle an array using Fisher–Yates shuffle algorithm↗Medium
  13. 13. Rearrange an array with alternate high and low elements↗Medium
  14. 14. Find equilibrium index of an array↗Easy
  15. 15. Find the largest subarray formed by consecutive integers↗Medium
  16. 16. Boyer–Moore Majority Vote Algorithm↗Easy
  17. 17. Move all zeros present in an array to the end↗Easy
  18. 18. Replace every array element with the product of every other element↗Medium
  19. 19. Longest Bitonic Subarray Problem↗Medium
  20. 20. Find maximum difference between two array elements that satisfies given constraints↗Medium
  21. 21. Maximum Sum Subarray Problem (Kadane’s Algorithm)↗Easy
  22. 22. Print continuous subarray with maximum sum↗Medium
  23. 23. Maximum Sum Circular Subarray↗Hard
  24. 24. Find all distinct combinations of a given length – I↗Medium
  25. 25. Find all distinct combinations of a given length – II↗Medium
  26. 26. Find maximum sequence of continuous 1’s formed by replacing at-most k 0’s by 1’s↗Medium
  27. 27. Find minimum sum subarray of size k↗Medium
  28. 28. Maximum Product Subarray Problem↗Hard
  29. 29. Find a subarray having the given sum in an integer array↗Medium
  30. 30. Find the smallest subarray length whose sum of elements is greater than k↗Medium
  31. 31. Find the smallest window in an array sorting which will make the entire array sorted↗Medium
  32. 32. Find maximum sum path involving elements of given arrays↗Medium
  33. 33. Find maximum profit earned by buying and selling shares any number of times↗Medium
  34. 34. Trapping Rain Water Problem↗Hard
  35. 35. Find minimum platforms needed to avoid delay in the train arrival↗Medium
  36. 36. Decode an array constructed from another array↗Medium
  37. 37. Sort an array in one swap whose two elements are swapped↗Easy
  38. 38. Find a triplet with the given sum in an array↗Medium
  39. 39. Find the longest continuous sequence length with the same sum in given binary arrays↗Hard
  40. 40. Reverse every consecutive m-elements of a subarray↗Medium
  41. 41. Maximum Product Subset Problem↗Easy
  42. 42. Find pairs with difference k in an array↗Easy
  43. 43. 4–Sum Problem | Quadruplets with a given sum↗Medium
  44. 44. Print all quadruplets with a given sum | 4 sum problem extended↗Medium
  45. 45. Count quadruplets with a zero sumMedium
  46. 46. Quickselect Algorithm↗Medium
  47. 47. Rearrange array such that A[A[i]] is set to i for every element A[i]↗Hard
  48. 48. Print all triplets that form an arithmetic progression↗Medium
  49. 49. Print all triplets that form a geometric progression↗Medium
  50. 50. Group elements of an array based on their first occurrence↗Medium
  51. 51. Find minimum difference between the index of two given elements present in an array↗Easy
  52. 52. Find maximum absolute difference between the sum of two non-overlapping subarrays↗Hard
  53. 53. Find all symmetric pairs in an array of pairs↗Medium
  54. 54. Find the closest pair to a given sum in two sorted arrays↗Medium
  55. 55. Partition an array into two subarrays with the same sum↗Easy
  56. 56. Find the count of distinct elements in every subarray of size k↗Medium
  57. 57. Find two numbers with maximum sum formed by array digits↗Easy
  58. 58. Print all subarrays of an array having distinct elements↗Medium
  59. 59. Find a triplet having the maximum product in an array↗Medium
  60. 60. Find the minimum index of a repeating element in an array↗Easy
  61. 61. Find a pair with a minimum absolute sum in an array↗Easy
  62. 62. Find an index of the maximum occurring element with equal probability↗Easy
  63. 63. Check if an array is formed by consecutive integers↗Medium
  64. 64. Find two non-overlapping pairs having the same sum in an array↗Medium
  65. 65. Add elements of two arrays into a new array↗Easy
  66. 66. Find minimum product among all combinations of triplets in an array↗Medium
  67. 67. Count distinct absolute values in a sorted array↗Medium
  68. 68. Print all combinations of positive integers in increasing order that sums to a number↗Hard
  69. 69. Find subarrays with a given sum in an array↗Medium
  70. 70. Find maximum length sequence of continuous ones (Using Sliding Window)↗Medium
  71. 71. Find maximum length sequence of continuous ones↗Medium
  72. 72. Find the index that divides an array into two non-empty subarrays with equal sum↗Easy
  73. 73. Efficiently calculate the frequency of all elements present in a limited range array↗Medium
  74. 74. Rearrange an array such that it contains alternate positive and negative numbers↗Medium
  75. 75. Find the sorted triplet in an array↗Medium
  76. 76. Shuffle an array according to the given order of elements↗Medium
  77. 77. Count the number of strictly increasing subarrays in an array↗Medium
  78. 78. Find duplicates within a range k in an array↗Easy
  79. 79. Find a minimum range with at least one element from each of the given arrays↗Hard
  80. 80. Find the longest subsequence formed by consecutive integers↗Medium
  81. 81. Determine the index of an element that satisfies given constraints in an array↗Easy
  82. 82. Find minimum moves required for converting a given array to an array of zeroes↗Medium
  83. 83. Left rotate an array↗Easy
  84. 84. Right rotate an array k times↗Easy
  85. 85. Activity Selection Problem↗Easy
  86. 86. Job Sequencing Problem with Deadlines↗Medium
  87. 87. 3–partition problem extended | Printing all partitions↗Hard
  88. 88. Count triplets which form an inversion in an array↗Easy
  89. 89. Determine whether an array can be divided into pairs with a sum divisible by k↗Medium
  90. 90. Find minimum removals required in an array to satisfy given constraints↗Medium
  91. 91. Find a pair with the given sum in a circularly sorted array↗Medium
  92. 92. Segregate positive and negative integers in linear time↗Easy
  93. 93. Find all distinct combinations of a given length that sum to a targetMedium
  94. 94. Find all duplicate elements in a limited range arrayEasy
  95. 95. Find the minimum and maximum element in an array using minimum comparisons↗Medium
  96. 96. Insertion Sort Algorithm↗Easy
  97. 97. Selection Sort Algorithm↗Easy
  98. 98. Bubble Sort Algorithm↗Easy
  99. 99. Merge Sort Algorithm↗Easy
  100. 100. Iterative Merge Sort Algorithm (Bottom-up Merge Sort)↗Medium
  101. 101. Quicksort Algorithm↗Medium
  102. 102. Hybrid QuickSort Algorithm↗Medium
  103. 103. Quicksort using Dutch National Flag Algorithm↗Medium
  104. 104. Quicksort algorithm using Hoare’s partitioning scheme↗Medium
  105. 105. Counting Sort Algorithm↗Easy
  106. 106. In-place vs out-of-place algorithmsBeginner
  107. 107. Inversion count of an array↗Hard
  108. 108. Problems solved using partitioning logic of QuicksortEasy
  109. 109. Sort elements by their frequency and index↗Medium
  110. 110. Sort an array based on order defined by another array↗Medium
  111. 111. Efficiently sort an array with many duplicated values↗Medium
  112. 112. Find the largest number possible from a given set of numbers↗Medium
  113. 113. Find surpasser count for each array element↗Hard
  114. 114. Segregate positive and negative integers using merge sort↗Medium
  115. 115. How to Boost QuickSort Performance?Easy
  116. 116. Water Jugs ProblemHard
  117. 117. Print matrix in spiral order↗Medium
  118. 118. Create a spiral matrix from a given array↗Medium
  119. 119. Shift all matrix elements by 1 in spiral order↗Medium
  120. 120. Change all elements of row i and column j in a matrix to 0 if cell (i, j) is 0↗Medium
  121. 121. Print diagonal elements of a matrix having a positive slope↗Medium
  122. 122. Replace all occurrences of 0 that are not surrounded by 1 in a binary matrix↗Medium
  123. 123. In-place rotate matrix by 90 degrees in a clockwise direction↗Easy
  124. 124. Count negative elements present in the sorted matrix in linear time↗Easy
  125. 125. Report all occurrences of an element in a row-wise and column-wise sorted matrix↗Medium
  126. 126. Check if a matrix is a Toeplitz or not↗Easy
  127. 127. In-place rotate matrix by 180 degrees↗Medium
  128. 128. Fill binary matrix with alternating rectangles of 0 and 1↗Medium
  129. 129. Find all common elements present in each row of a matrix↗Medium
  130. 130. Find common elements present in all rows of a matrix↗Medium
  131. 131. Find the index of a row containing the maximum number of 1’s in a binary matrix↗Hard
  132. 132. Find the largest square submatrix which is surrounded by all 1’s↗Medium
  133. 133. Print a spiral square matrix without using any extra space↗Hard
  134. 134. Young Tableau | Insert, Search, Extract-Min, Delete, Replace↗Hard
  135. 135. Replace all occurrences of 0 that are surrounded by 1 in a binary matrix↗Medium
  136. 136. Find the area of the largest rectangle of 1’s in a binary matrix↗Hard
  137. 137. Find maximum value of M[c][d] – M[a][b] over all choices of indexes↗Medium
  138. 138. Generate pascal triangle of the given sizeEasy
  139. 139. Find perimeter of an IslandEasy
  140. 140. Find kth smallest value in a sorted matrixMedium
  141. 141. Sort an array using Young tableau↗Hard
  142. 142. Print all possible solutions to N–Queens problem↗Hard
  143. 143. Print all possible Knight’s tours on a chessboard↗Hard
  144. 144. Find the shortest path in a maze↗Medium
  145. 145. Find the longest possible route in a matrix↗Medium
  146. 146. Find the path from source to destination in a matrix that satisfies given constraints↗Medium
  147. 147. Find the total number of unique paths in a maze from source to destination↗Medium
  148. 148. Find all combinations of elements satisfying given constraints↗Medium
  149. 149. K–Partition Problem | Printing all partitions↗Hard
  150. 150. Magnet Puzzle↗Hard
  151. 151. Find all paths from the first cell to the last cell of a matrix↗Medium
  152. 152. Print all shortest routes in a rectangular grid↗Medium
  153. 153. Find all distinct combinations of a given length with repetition allowed↗Medium
  154. 154. Print all combinations of numbers from 1 to n having sum n↗Medium
  155. 155. Print all triplets in an array with a sum less than or equal to a given number↗Medium
  156. 156. Check if a string is a rotated palindrome or not↗Medium
  157. 157. Longest Palindromic Substring Problem↗Medium
  158. 158. Check if a repeated subsequence is present in a string or not↗Hard
  159. 159. Check if strings can be derived from each other by circularly rotating them↗Easy
  160. 160. Check if a set of moves is circular or not↗Medium
  161. 161. Convert a number into a corresponding excel column name↗Medium
  162. 162. Convert column name in Excel to the corresponding numberEasy
  163. 163. Find all interleaving of given strings↗Easy
  164. 164. Isomorphic Strings↗Medium
  165. 165. Remove all extra spaces from a stringMedium
  166. 166. Find all possible palindromic substrings of a string↗Hard
  167. 167. Find all possible combinations of words formed from the mobile keypad↗Hard
  168. 168. Find all combinations by replacing given digits with corresponding list characters↗Hard
  169. 169. Find all words that follow the same order of characters as given pattern↗Medium
  170. 170. Group anagrams together from a list of words↗Medium
  171. 171. Find minimum operations required to transform a string into another string↗Hard
  172. 172. Determine whether a string can be transformed into another string in a single edit↗Medium
  173. 173. Remove all occurrences of AB and C from a string↗Easy
  174. 174. Find the longest even-length palindromic sum substring of a string↗Medium
  175. 175. Print string in the zigzag form in k rows↗Medium
  176. 176. Run Length Encoding (RLE) Data Compression Algorithm↗Easy
  177. 177. Find the longest substring of a string containing k distinct characters↗Hard
  178. 178. Find all palindromic permutations of a string↗Medium
  179. 179. Find all substrings of a string that are a permutation of another string↗Medium
  180. 180. Find the longest substring of a string containing distinct characters↗Medium
  181. 181. Find all permutations of a string – C++, Java, Python↗Hard
  182. 182. Iterative approach to finding permutations of a string↗Hard
  183. 183. Find all lexicographically next permutations of a string↗Hard
  184. 184. Lexicographically Minimal String Rotation↗Medium
  185. 185. Find all strings of a given length containing balanced parentheses↗Medium
  186. 186. Find all combinations of non-overlapping substrings of a string↗Medium
  187. 187. Determine whether a string is a palindrome or not↗Easy
  188. 188. Find the minimum number of inversions needed to make an expression balanced↗Medium
  189. 189. Construct the longest palindrome by shuffling or deleting characters from a string↗Medium
  190. 190. Print all combinations of phrases formed by picking words from each of the given lists↗Medium
  191. 191. Break a string into all possible combinations of non-overlapping substringsMedium
  192. 192. Convert a Roman numeral to an IntegerEasy
  193. 193. Remove adjacent duplicate characters from a string↗Easy
  194. 194. Find the first non-repeating character in a string by doing only one traversal of it↗Medium
  195. 195. Find all n-digit strictly increasing numbers (Bottom-up and Top-down approach)↗Medium
  196. 196. Find all n-digit binary numbers having more 1’s than 0’s for any prefix↗Medium
  197. 197. Find all n-digit numbers with a given sum of digits↗Hard
  198. 198. Find all n-digit binary numbers with k-bits set where k ranges from 1 to n↗Hard
  199. 199. Find all n-digit binary numbers with an equal sum of bits in their two halves↗Hard
  200. 200. Find all n-digit numbers with equal sum of digits at even and odd indices↗Hard
  201. 201. Find all lexicographic permutations of a string↗Hard
  202. 202. Determine if a string is a subsequence of another stringEasy
  203. 203. Find all lexicographically previous permutations of a stringHard
  204. 204. Replace all non-overlapping occurrences of a patternMedium
  205. 205. Find all substrings containing exactly k distinct characters↗Medium
  206. 206. Introduction to Pattern Matching↗Beginner
  207. 207. KMP Algorithm↗Hard
  208. 208. Reverse a string using recursionEasy
  209. 209. Determine whether the characters of a string follow a specified order or not↗Medium
  210. 210. Check if a sentence is syntactically correct or notMedium
  211. 211. Check a string for repeated substringsEasy
  212. 212. Find difference between two stringsEasy
  213. 213. Construct smallest number after removing k digits from a stringMedium
  214. 214. Number to word conversion↗Hard
  215. 215. Find all occurrences of the given string in a character matrix↗Hard
  216. 216. Shortest Superstring ProblemHard
  217. 217. Find the shortest route in a device to construct a given stringMedium
  218. 218. Find the minimum number possible by doing at-most k swaps↗Medium
  219. 219. Determine whether a string matches with a given pattern↗Hard
  220. 220. Difference between Subarray, Subsequence, and SubsetBeginner
  221. 221. Determine whether two strings are anagram or not↗Easy
  222. 222. Bit Hacks – Part 1 (Basic)Easy
  223. 223. Bit Hacks – Part 2 (Playing with k’th bit)Easy
  224. 224. Bit Hacks – Part 3 (Playing with the rightmost set bit of a number)Easy
  225. 225. Bit Hacks – Part 4 (Playing with letters of the English alphabet)Easy
  226. 226. Bit Hacks – Part 5 (Find the absolute value of an integer without branching)Easy
  227. 227. Find the total number of bits needed to be flipped↗Easy
  228. 228. Brian Kernighan’s Algorithm to count set bits in an integer↗Easy
  229. 229. Round up to the next highest power of 2↗Medium
  230. 230. Round up to the previous power of 2↗Medium
  231. 231. Compute the parity of a number using a lookup table↗Hard
  232. 232. Count set bits using a lookup table↗Hard
  233. 233. Multiply 16-bit integers using an 8-bit multiplierMedium
  234. 234. Swap two bits at a given position in an integer↗Medium
  235. 235. Swap individual bits at a given position in an integer↗Hard
  236. 236. Check if a number is a power of 4 or not↗Medium
  237. 237. Calculate hamming distance between two integersEasy
  238. 238. Generate an array with the set bit count of each indexEasy
  239. 239. Reverse bits of an integer↗Medium
  240. 240. Print binary representation of a number↗Easy
  241. 241. Add binary representation of two integers↗Easy
  242. 242. Swap adjacent bits of a number↗Medium
  243. 243. Check if adjacent bits are set in the binary representation of a number↗Easy
  244. 244. Reverse bits of an integer using a lookup table↗Hard
  245. 245. Circular shift on the binary representation of an integer by k positions↗Medium
  246. 246. Find XOR of two numbers without using the XOR operator↗Medium
  247. 247. Print all distinct subsets of a given set↗Hard
  248. 248. Find the missing number in an array↗Easy
  249. 249. Find the missing number in an array without using any extra space↗Easy
  250. 250. Find the odd occurring element in an array in a single traversal↗Easy
  251. 251. Find two odd occurring elements in an array without using any extra space↗Medium
  252. 252. Find all odd occurring elements in an array having a limited range of elements↗Medium
  253. 253. Find the duplicate element in a limited range array↗Medium
  254. 254. Find two duplicate elements in a limited range array (using XOR)↗Medium
  255. 255. Find the missing number and duplicate elements in an array↗Medium
  256. 256. Stack implementation using an array – C, C++, C++ (Using Templates), Java, Python↗Beginner
  257. 257. Check if an expression is balanced or not↗Easy
  258. 258. Find duplicate parenthesis in an expression↗Medium
  259. 259. Evaluate a postfix expression↗Easy
  260. 260. Decode a given sequence to construct a minimum number without repeated digits↗Hard
  261. 261. Design a stack that returns the minimum element in constant time↗Hard
  262. 262. Design a stack that returns a minimum element without using an auxiliary stackHard
  263. 263. Merging Overlapping Intervals↗Medium
  264. 264. Maximum Overlapping Intervals Problem↗Medium
  265. 265. Insert an interval by merging overlapping intervalsMedium
  266. 266. Convert an infix expression into a postfix expression↗Medium
  267. 267. Implement two stacks in a single arrayEasy
  268. 268. Recursive solution to sort a stack↗Hard
  269. 269. Reverse a stack using recursion↗Hard
  270. 270. Reverse a string using a stack data structureEasy
  271. 271. Find the next greater element for every array element↗Medium
  272. 272. Find the next greater element for every element in a circular array↗Hard
  273. 273. Find the previous smaller element for each array element↗Medium
  274. 274. Reverse an array in C++↗Easy
  275. 275. Longest Increasing Subsequence Problem↗Hard
  276. 276. Find all increasing subsequences of an arrayMedium
  277. 277. Find all elements in an array that are greater than all elements to their right↗Easy
  278. 278. Iterative Implementation of Quicksort↗Medium
  279. 279. Find all binary strings that can be formed from a wildcard pattern↗Medium
  280. 280. Find the length of the longest balanced parenthesis in a string↗Hard
  281. 281. Reverse text without reversing individual words↗Medium
  282. 282. Evaluate a given expressionHard
  283. 283. Reverse a string without using recursionEasy
  284. 284. Construct a string from an encoded sequenceHard
  285. 285. Inorder Tree Traversal↗Medium
  286. 286. Preorder Tree Traversal↗Medium
  287. 287. Postorder Tree Traversal↗Medium
  288. 288. Level order traversal of a binary tree↗Easy
  289. 289. Check if two binary trees are identical or not↗Easy
  290. 290. Print bottom view of a binary tree↗Medium
  291. 291. Print top view of a binary tree↗Medium
  292. 292. Calculate the height of a binary tree↗Easy
  293. 293. Delete a binary treeEasy
  294. 294. Spiral order traversal of a binary tree↗Medium
  295. 295. Reverse level order traversal of a binary tree↗Easy
  296. 296. In-place convert a binary tree to its sum tree↗Easy
  297. 297. Determine whether the given binary tree nodes are cousins of each other↗Medium
  298. 298. Print cousins of a given node in a binary tree↗Medium
  299. 299. Check if a binary tree is a sum tree or not↗Medium
  300. 300. Combinations of words formed by replacing given numbers with corresponding alphabets↗Hard
  301. 301. Determine whether a binary tree is a subtree of another binary tree↗Medium
  302. 302. Find the diameter of a binary tree↗Medium
  303. 303. Check if a binary tree is symmetric or not↗Easy
  304. 304. Convert a binary tree to its mirror↗Easy
  305. 305. Determine if a binary tree can be converted to another by swapping children↗Easy
  306. 306. Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree↗Medium
  307. 307. Print all paths from the root to leaf nodes of a binary tree↗Easy
  308. 308. Find ancestors of a given node in a binary tree↗Medium
  309. 309. Find distance between given pairs of nodes in a binary tree↗Hard
  310. 310. Find the diagonal sum of a binary tree↗Medium
  311. 311. Sink nodes containing zero to the bottom of a binary tree↗Hard
  312. 312. Convert a binary tree to a full tree by removing half nodes↗Medium
  313. 313. Truncate a binary tree to remove nodes that lie on a path having a sum less than k↗Medium
  314. 314. Find maximum sum root to leaf path in a binary tree↗Medium
  315. 315. Check if a binary tree is height-balanced or not↗Medium
  316. 316. Convert binary tree to Left-child right-sibling binary tree↗Medium
  317. 317. Print all paths from leaf to root node of a binary tree↗Medium
  318. 318. Iteratively print the leaf to root path for every leaf node in a binary tree↗Medium
  319. 319. Build a binary tree from a parent array↗Hard
  320. 320. Find all nodes at a given distance from leaf nodes in a binary tree↗Hard
  321. 321. Count all subtrees having the same value of nodes in a binary tree↗Medium
  322. 322. Find the maximum difference between a node and its descendants in a binary tree↗Medium
  323. 323. Find the maximum sum path between two leaves in a binary tree↗Hard
  324. 324. Construct a binary tree from inorder and preorder traversal↗Hard
  325. 325. Construct a binary tree from inorder and postorder traversals↗Hard
  326. 326. Construct a binary tree from inorder and level order sequence↗Hard
  327. 327. Construct a full binary tree from the preorder sequence with leaf node information↗Hard
  328. 328. Construct a full binary tree from a preorder and postorder sequence↗Hard
  329. 329. Find postorder traversal of a binary tree from its inorder and preorder sequence↗Medium
  330. 330. Set next pointer to the inorder successor of all nodes in a binary tree↗Easy
  331. 331. Find preorder traversal of a binary tree from its inorder and postorder sequence↗Hard
  332. 332. Find difference between sum of all nodes present at odd and even levels in a binary tree↗Easy
  333. 333. Clone a binary tree↗Easy
  334. 334. Clone a binary tree with random pointers↗Hard
  335. 335. Threaded Binary Tree – Overview and Implementation↗Medium
  336. 336. Determine if a binary tree satisfies the height-balanced property of a red–black tree↗Medium
  337. 337. Construct an ancestor matrix from a binary tree↗Easy
  338. 338. Find all possible binary trees having the same inorder traversal↗Hard
  339. 339. Perform boundary traversal on a binary tree↗Medium
  340. 340. Check if binary representation of a number is palindrome or not↗Easy
  341. 341. Check if each node of a binary tree has exactly one child↗Easy
  342. 342. Evaluate a Binary Expression Tree↗Easy
  343. 343. Construction of an expression tree↗Easy
  344. 344. Fix children-sum property in a binary tree↗Medium
  345. 345. Maximum path sum in a binary tree↗Hard
  346. 346. Create a mirror of an m–ary treeEasy
  347. 347. Print a two-dimensional view of a binary treeEasy
  348. 348. Construct a binary tree from an ancestor matrix↗Hard
  349. 349. Insertion in a BST↗Easy
  350. 350. Search a given key in BST↗Easy
  351. 351. Deletion from BST (Binary Search Tree)↗Medium
  352. 352. Construct a balanced BST from the given keys↗Easy
  353. 353. Determine whether a given binary tree is a BST or not↗Medium
  354. 354. Check if the given keys represent the same BSTs or not without building BST↗Hard
  355. 355. Find inorder predecessor for the given key in a BST↗Medium
  356. 356. Find the Lowest Common Ancestor (LCA) of two nodes in a BST↗Easy
  357. 357. Find k’th smallest node in a BST↗Easy
  358. 358. Find k’th largest node in a BST↗Easy
  359. 359. Find floor and ceil in a Binary Search Tree↗Medium
  360. 360. Convert a binary tree to BST by maintaining its original structure↗Medium
  361. 361. Remove nodes from a BST that have keys outside a valid range↗Medium
  362. 362. Find a pair with the given sum in a BST↗Easy
  363. 363. Find inorder successor for the given key in a BST↗Medium
  364. 364. Replace every array element with the least greater element on its right↗Medium
  365. 365. Fix a binary tree that is only one swap away from becoming a BST↗Hard
  366. 366. Update every key in a BST to contain the sum of all greater keys↗Medium
  367. 367. Check if a given sequence represents the preorder traversal of a BST↗Hard
  368. 368. Build a Binary Search Tree from a postorder sequence↗Hard
  369. 369. Build a Binary Search Tree from a preorder sequence↗Hard
  370. 370. Count subtrees in a BST whose nodes lie within a given range↗Medium
  371. 371. Find the size of the largest BST in a binary tree↗Hard
  372. 372. Calculate sum of root to leaf digits in a binary treeMedium
  373. 373. Count paths with the given sum in a binary treeHard
  374. 374. Print complete Binary Search Tree (BST) in increasing order↗Easy
  375. 375. Print binary tree structure with its contentsMedium
  376. 376. Binary Search Algorithm↗Easy
  377. 377. Find the number of rotations in a circularly sorted array↗Easy
  378. 378. Search an element in a circularly sorted array↗Medium
  379. 379. Find the first or last occurrence of a given number in a sorted array↗Easy
  380. 380. Count occurrences of a number in a sorted array with duplicates↗Medium
  381. 381. Find the smallest missing element from a sorted array↗Medium
  382. 382. Find floor and ceil of a number in a sorted integer array↗Easy
  383. 383. Search in a nearly sorted array in logarithmic time↗Medium
  384. 384. Find the number of 1’s in a sorted binary array↗Easy
  385. 385. Find the peak element in an array↗Medium
  386. 386. Maximum Subarray Sum using Divide and ConquerMedium
  387. 387. Efficiently implement power function↗Easy
  388. 388. Find the missing term in a sequence in logarithmic time↗Medium
  389. 389. Find floor and ceil of a number in a sorted array (Recursive solution)↗Easy
  390. 390. Find the frequency of each element in a sorted array containing duplicates↗Easy
  391. 391. Find the square root of a number using a binary search↗Easy
  392. 392. Division of two numbers using binary search algorithmMedium
  393. 393. Find the odd occurring element in an array in logarithmic time↗Medium
  394. 394. Find pairs with difference k in an array | Constant Space Solution↗Medium
  395. 395. Find k closest elements to a given value in an array↗Medium
  396. 396. Find the maximum value of j – i such that A[j] > A[i] in an array↗Medium
  397. 397. Longest Common Prefix (LCP) Problem↗Easy
  398. 398. Binary Search in C++ STL and Java CollectionsBeginner
  399. 399. Ternary Search vs Binary searchBeginner
  400. 400. Exponential search↗Easy
  401. 401. Unbounded Binary Search↗Easy
  402. 402. Interpolation search↗Easy
  403. 403. Introduction to Dynamic ProgrammingBeginner
  404. 404. Longest Common Subsequence Problem↗Medium
  405. 405. Longest Common Subsequence (LCS) | Space optimized version↗Medium
  406. 406. Longest Common Subsequence of k–sequences↗Medium
  407. 407. Longest Common Subsequence | Finding all LCS↗Hard
  408. 408. Longest Common Substring Problem↗Medium
  409. 409. Longest Palindromic Subsequence using Dynamic Programming↗Medium
  410. 410. Longest Repeated Subsequence Problem↗Medium
  411. 411. Implement Diff UtilityMedium
  412. 412. Shortest Common Supersequence Problem↗Medium
  413. 413. Shortest Common Supersequence | Finding all SCS↗Hard
  414. 414. Shortest Common Supersequence Problem using LCS↗Hard
  415. 415. Longest Increasing Subsequence using Dynamic Programming↗Hard
  416. 416. Longest Decreasing Subsequence Problem↗Hard
  417. 417. Longest Bitonic Subsequence↗Medium
  418. 418. Maximum Sum Increasing Subsequence Problem↗Medium
  419. 419. The Levenshtein distance (Edit distance) Problem↗Medium
  420. 420. Find the size of the largest square submatrix of 1’s present in a binary matrix↗Medium
  421. 421. Matrix Chain Multiplication using Dynamic Programming↗Hard
  422. 422. Find minimum cost to reach the last cell of a matrix from its first cell↗Medium
  423. 423. Find the longest sequence formed by adjacent numbers in the matrix↗Medium
  424. 424. Count the number of paths in a matrix with a given cost to reach the destination cell↗Medium
  425. 425. 0–1 Knapsack Problem↗Medium
  426. 426. Maximize the value of an expression↗Hard
  427. 427. Partition Problem using Dynamic Programming↗Medium
  428. 428. Subset Sum Problem – Dynamic Programming Solution↗Medium
  429. 429. 3–Partition Problem↗Medium
  430. 430. Minimum Sum Partition Problem↗Hard
  431. 431. Rod Cutting Problem↗Medium
  432. 432. Maximum Product Rod Cutting↗Medium
  433. 433. Coin change-making problem↗Medium
  434. 434. Coin Change Problem↗Hard
  435. 435. Total possible solutions to a linear equation of k variables↗Hard
  436. 436. Longest Alternating Subsequence Problem↗Medium
  437. 437. Longest Alternating Subsequence Problem – II↗Medium
  438. 438. Count the number of times a pattern appears in a given string as a subsequence↗Hard
  439. 439. Collect maximum points in a matrix by satisfying given constraints↗Hard
  440. 440. Find all n-digit binary numbers without any consecutive 1’s↗Easy
  441. 441. Count total possible combinations of n-digit numbers in a mobile keypad↗Medium
  442. 442. Word Break Problem – Dynamic Programming↗Hard
  443. 443. Determine the minimal adjustment cost of an arrayHard
  444. 444. Check if a string is k–palindrome or not↗Hard
  445. 445. Find total ways to achieve a given sum with n throws of dice having k faces↗Medium
  446. 446. Wildcard Pattern Matching↗Hard
  447. 447. Find the number of ways to fill an N × 4 matrix with 1 × 4 tiles↗Medium
  448. 448. Ways to reach the bottom-right corner of a matrix with exactly k turns allowed↗Hard
  449. 449. Weighted Interval Scheduling Problem↗Medium
  450. 450. Box Stacking Problem↗Hard
  451. 451. Find total ways to reach n’th stair with at-most m steps↗Medium
  452. 452. Find total ways to reach the n’th stair from the bottom↗Medium
  453. 453. Activity Selection Problem using Dynamic Programming↗Medium
  454. 454. Find the minimum number of deletions required to convert a string into a palindrome↗Medium
  455. 455. Calculate the minimum cost to reach the destination city from the source city↗Medium
  456. 456. Pots of Gold Game Problem using Dynamic Programming↗Hard
  457. 457. Find minimum cuts needed for the palindromic partition of a string↗Hard
  458. 458. Weighted Interval Scheduling – Dynamic Programming Solution↗Medium
  459. 459. Find minimum jumps required to reach the destination↗Medium
  460. 460. Find the probability that a person is alive after taking n steps on an island↗Medium
  461. 461. Maximum Length Snake Sequence↗Medium
  462. 462. Calculate the size of the largest plus of 1’s in a binary matrix↗Hard
  463. 463. Longest Increasing Subsequence using LCS↗Medium
  464. 464. Find maximum profit earned from at most k stock transactions↗Hard
  465. 465. Count all paths in a matrix from the first cell to the last cell↗Easy
  466. 466. Check if a string matches with the given wildcard pattern↗Hard
  467. 467. Check if a string is interleaving of two other given strings↗Medium
  468. 468. Find all employees who directly or indirectly reports to a manager↗Hard
  469. 469. Find optimal cost to construct a binary search tree↗Hard
  470. 470. Find the maximum sum of a subsequence with no adjacent elements↗Medium
  471. 471. Minimum-weight triangulation of a convex polygon↗Hard
  472. 472. Find maximum profit that can be earned by conditionally selling stocks↗Easy
  473. 473. Program to find n’th Fibonacci number↗Easy
  474. 474. Count decodings of a given sequence of digits↗Medium
  475. 475. Hat Check Problem – Counting Derangements↗Medium
  476. 476. Maximum Independent Set Problem↗Medium
  477. 477. Find the minimum number of squares that sum to a given number↗Medium
  478. 478. Truncate an integer array such that 2×min becomes more than max↗Hard
  479. 479. Longest Alternating Subarray Problem↗Easy
  480. 480. Find maximum profit earned from at most two stock transactions↗Hard
  481. 481. Find ways to calculate a target from elements of the specified array↗Medium
  482. 482. Calculate the sum of all elements in a submatrix in constant time↗Medium
  483. 483. Find maximum sum K × K submatrix in a given M × N matrix↗Hard
  484. 484. Find maximum sum submatrix present in a matrix↗Medium
  485. 485. Find the length of the longest path in a matrix with consecutive characters↗Medium
  486. 486. Collect maximum value of coins in a matrix↗Hard
  487. 487. Terminology and Representations of GraphsBeginner
  488. 488. Graph Implementation – C, C++, C++ STL, Java Collections, PythonBeginner
  489. 489. Depth First Search (DFS)Medium
  490. 490. Breadth-First Search (BFS)Medium
  491. 491. Arrival and departure time of vertices in DFSEasy
  492. 492. Types of edges involved in DFS and relation between themBeginner
  493. 493. Determine whether a graph is Bipartite using DFS↗Medium
  494. 494. Topological Sort Algorithm for DAG↗Medium
  495. 495. Kahn’s Topological Sort Algorithm↗Medium
  496. 496. Transitive closure of a graph↗Easy
  497. 497. Determine whether an undirected graph is a tree (Acyclic Connected Graph)↗Medium
  498. 498. 2–Edge Connectivity in a graph↗Hard
  499. 499. 2–Vertex Connectivity in a graphHard
  500. 500. Check if a digraph is a DAG (Directed Acyclic Graph) or not↗Medium
  501. 501. Disjoint–Set Data Structure (Union–Find Algorithm)Medium
  502. 502. Check if a graph is strongly connected or not↗Easy
  503. 503. Check if a graph is strongly connected or not using one DFS Traversal↗Hard
  504. 504. Union–Find Algorithm for cycle detection in a graph↗Medium
  505. 505. Single-Source Shortest Paths – Bellman–Ford Algorithm↗Medium
  506. 506. All-Pairs Shortest Paths – Floyd Warshall Algorithm↗Easy
  507. 507. Find the cost of the shortest path in DAG using one pass of Bellman–Ford↗Medium
  508. 508. Determine a negative-weight cycle in a graph↗Medium
  509. 509. Find all Possible Topological Orderings of a DAG↗Hard
  510. 510. Find correct order of alphabets in a given dictionary of ancient originHard
  511. 511. Find the longest path in a Directed Acyclic Graph (DAG)↗Hard
  512. 512. Print all k–colorable configurations of a graph (Vertex coloring of a graph)↗Medium
  513. 513. Print all Hamiltonian paths present in a graph↗Hard
  514. 514. Graph Coloring ProblemMedium
  515. 515. Kruskal’s Algorithm for finding Minimum Spanning Tree↗Hard
  516. 516. Eulerian cycle in directed graphs↗Hard
  517. 517. Find root vertex of a graph↗Medium
  518. 518. Check whether an undirected graph is Eulerian↗Medium
  519. 519. Check if a set of words can be rearranged to form a circle↗Hard
  520. 520. Find itinerary from the given list of departure and arrival airports↗Easy
  521. 521. Introduction to Priority Queues using Binary HeapsBeginner
  522. 522. Min Heap and Max Heap Implementation – C++, JavaBeginner
  523. 523. Check if an array represents a min-heap or not↗Medium
  524. 524. Convert max heap to min heap in linear time↗Easy
  525. 525. Find k’th largest element in an array↗Medium
  526. 526. Sort a k-sorted array↗Medium
  527. 527. Merge M sorted lists of variable length↗Hard
  528. 528. Find k’th smallest element in an array↗Medium
  529. 529. Find the smallest range with at least one element from each of the given lists↗Hard
  530. 530. Merge M sorted lists each containing N elementsHard
  531. 531. Find first k non-repeating characters in a string in a single traversal↗Medium
  532. 532. Connect n ropes with minimal cost↗Easy
  533. 533. Return k’th largest element in a stream↗Medium
  534. 534. Huffman Coding Compression AlgorithmHard
  535. 535. Replace each array element by its corresponding rank↗Easy
  536. 536. Single-Source Shortest Paths – Dijkstra’s Algorithm↗Medium
  537. 537. Construct a Cartesian tree from an inorder traversal↗Medium
  538. 538. Treap Data StructureBeginner
  539. 539. Implementation of Treap Data Structure (Insert, Search, and Delete)Hard
  540. 540. Heap Sort Algorithm↗Medium
  541. 541. Introsort Algorithm – Overview and C++ Implementation↗Hard
  542. 542. External Merge Sort AlgorithmHard
  543. 543. Introduction to Linked ListsBeginner
  544. 544. Linked List Implementation – C, C++, Java, Python↗Beginner
  545. 545. Linked List – Insertion at Tail↗Beginner
  546. 546. Static Linked ListBeginner
  547. 547. Clone a Linked List↗Easy
  548. 548. Delete a linked listEasy
  549. 549. Pop operation in a linked list↗Easy
  550. 550. Insert a node to its correct sorted position in a sorted linked list↗Easy
  551. 551. Rearrange linked list in increasing order (Sort linked list)↗Medium
  552. 552. Split nodes of a linked list into the front and back halves↗Easy
  553. 553. Remove duplicates from a sorted linked list↗Easy
  554. 554. Move the front node of a linked list in front of another list↗Easy
  555. 555. Move even nodes to the end of the linked list in reverse order↗Medium
  556. 556. Split a linked list into two lists where each list contains alternating elements from it↗Medium
  557. 557. Construct a linked list by merging alternate nodes of two given lists↗Easy
  558. 558. Merge two sorted linked lists into one↗Medium
  559. 559. Efficiently merge k sorted linked lists↗Hard
  560. 560. Intersection of two sorted linked lists↗Medium
  561. 561. Reverse a linked List – Iterative Solution↗Medium
  562. 562. Reverse a Linked List – Recursive Solution↗Hard
  563. 563. Reverse every group of k nodes in a linked list↗Medium
  564. 564. Find k’th node from the end of a linked list↗Easy
  565. 565. Merge alternate nodes of two linked lists into the first list↗Medium
  566. 566. Merge two sorted linked lists from their end↗Medium
  567. 567. Delete every N nodes in a linked list after skipping M nodes↗Easy
  568. 568. Rearrange linked list in a specific manner in linear time↗Medium
  569. 569. Check if a linked list is palindrome or not↗Medium
  570. 570. Move the last node to the front of a linked list↗Easy
  571. 571. Rearrange linked list in a specific manner↗Easy
  572. 572. Floyd’s Cycle Detection Algorithm↗Easy
  573. 573. Find start node of the cycle in a linked listMedium
  574. 574. Sort linked list containing 0’s, 1’s, and 2’s in a single traversal↗Medium
  575. 575. Remove duplicates from a linked list in a single traversal↗Easy
  576. 576. Rearrange linked list so that it has alternating high and low values↗Medium
  577. 577. Rearrange a linked list by separating odd nodes from even ones↗Medium
  578. 578. Calculate height of a binary tree with leaf nodes forming a circular doubly linked list↗Medium
  579. 579. XOR Linked List – Overview and Implementation in C/C++Medium
  580. 580. Recursively check if the linked list of characters is palindrome or not↗Medium
  581. 581. Merge two BSTs into a doubly-linked list in sorted order↗Hard
  582. 582. Remove redundant nodes from a path formed by a linked list↗Medium
  583. 583. Add a single-digit number to a linked list representing a number↗Medium
  584. 584. Reverse every alternate group of k nodes in a linked list↗Medium
  585. 585. Determine whether a linked list is palindrome or not↗Medium
  586. 586. Reverse a doubly linked list↗Easy
  587. 587. Pairwise swap adjacent nodes of a linked list↗Medium
  588. 588. Flatten a Linked ListHard
  589. 589. Check if a linked list of strings is palindromic↗Easy
  590. 590. Flatten a multilevel linked listMedium
  591. 591. Construct a height-balanced BST from an unbalanced BST↗Hard
  592. 592. Swap k’th node from beginning with k’th node from the end in a linked list↗Medium
  593. 593. Add two linked lists without using any extra space↗Medium
  594. 594. Remove all nodes from a linked list that matches a given keyEasy
  595. 595. Clone a linked list with random pointer↗Hard
  596. 596. Update random pointer for each linked list node to point to the maximum node↗Medium
  597. 597. Link nodes present in each level of a binary tree in the form of a linked list↗Hard
  598. 598. Convert a ternary tree to a doubly-linked list↗Medium
  599. 599. Construct a height-balanced BST from a sorted doubly linked list↗Hard
  600. 600. In-place merge two sorted linked lists without modifying links of the first list↗Medium
  601. 601. Reverse specified portion of a linked list↗Medium
  602. 602. Find the intersection point of two linked lists↗Medium
  603. 603. Extract leaves of a binary tree into a doubly-linked list↗Medium
  604. 604. Find the vertical sum of a binary tree↗Hard
  605. 605. In-place convert a binary tree to a doubly-linked list↗Hard
  606. 606. Find a triplet with the given sum in a BST↗Hard
  607. 607. Check whether the leaf traversal of given binary trees is the same or not↗Hard
  608. 608. Merge sort algorithm for a singly linked list↗Hard
  609. 609. Sort a doubly-linked list using merge sort↗Medium
  610. 610. Stack Implementation using a Linked List↗Beginner
  611. 611. Clock Angle Problem↗Easy
  612. 612. Add two numbers without using the addition operator | 5 methodsEasy
  613. 613. Generate the power set of a given set↗Medium
  614. 614. Implement power function without using multiplication and division operatorsEasy
  615. 615. Print all numbers between 1 to N without using a semicolonMedium
  616. 616. Swap two numbers without using a third variable | 5 methodsEasy
  617. 617. Determine the if condition to print the specific outputEasy
  618. 618. Find maximum and minimum value of a triplet without using a conditional statementMedium
  619. 619. Find numbers represented as the sum of two cubes for two different pairs↗Medium
  620. 620. Print “Hello World” with empty main function | 3 methodsMedium
  621. 621. Tower of Hanoi Problem↗Medium
  622. 622. Print all numbers between 1 to N without using any loop | 4 methodsEasy
  623. 623. Print a semicolon without using a semicolon anywhere in the programEasy
  624. 624. Multiply two numbers without using a multiplication operator or loopsEasy
  625. 625. Find the square of a number without using the multiplication and division operatorEasy
  626. 626. Check if a number is even or odd without using any conditional statementEasy
  627. 627. Set both elements of a binary array to 0 in a single lineEasy
  628. 628. Find minimum number without using conditional statement or ternary operatorMedium
  629. 629. Perform division of two numbers without using division operatorMedium
  630. 630. Generate 0 and 1 with 75% and 25% probability↗Medium
  631. 631. Generate desired random numbers with equal probability↗Medium
  632. 632. Return 0, 1, and 2 with equal probability using a specified function↗Medium
  633. 633. Generate numbers from 1 to 7 with equal probability using a specified function↗Hard
  634. 634. Get 0 and 1 with equal probability using a specified function↗Medium
  635. 635. Generate random input from an array according to given probabilities↗Medium
  636. 636. Generate fair results from a biased coin↗Hard
  637. 637. Implement ternary operator without using conditional expressionsMedium
  638. 638. Determine if two integers are equal without using comparison and arithmetic operatorsEasy
  639. 639. Compute modulus division without division and modulo operatorEasy
  640. 640. Write a C/C++ program without using the main functionEasy
  641. 641. Single line expressions to swap two integers in JavaEasy
  642. 642. Find maximum number without using conditional statement or ternary operatorEasy
  643. 643. Find minimum or maximum of two integers without using branchingHard
  644. 644. Solve a given set of problems without using multiplication or division operatorsMedium
  645. 645. Queue implementation using an array – C, C++, C++ (Using Templates), Java, Python↗Beginner
  646. 646. Queue Implementation using a Linked List↗Beginner
  647. 647. Implement a stack using the queue data structureMedium
  648. 648. Implement a queue using the stack data structureMedium
  649. 649. Efficiently print all nodes between two given levels in a binary tree↗Easy
  650. 650. Chess Knight Problem | Find the shortest path from source to destination↗Hard
  651. 651. Shortest path in a maze – Lee AlgorithmMedium
  652. 652. Find the shortest safe route in a field with sensors present↗Hard
  653. 653. Flood Fill Algorithm↗Medium
  654. 654. Count number of islands↗Medium
  655. 655. Find shortest path from source to destination in a matrix that satisfies given constraints↗Hard
  656. 656. Generate binary numbers between 1 to n using a queue↗Easy
  657. 657. Print nodes of a binary tree in vertical order↗Medium
  658. 658. Print all nodes of a perfect binary tree in a specific order↗Hard
  659. 659. Print left view of a binary tree↗Easy
  660. 660. Find the next node at the same level as the given node in a binary tree↗Medium
  661. 661. Check if a binary tree is a complete binary tree or not↗Medium
  662. 662. Print diagonal traversal of a binary tree↗Medium
  663. 663. Print corner nodes of every level in a binary tree↗Easy
  664. 664. Invert Binary Tree↗Easy
  665. 665. Find minimum passes required to convert all negative values in a matrix↗Hard
  666. 666. Convert a binary tree into a doubly-linked list in spiral order↗Hard
  667. 667. Check if a binary tree is a min-heap or not↗Medium
  668. 668. Invert alternate levels of a perfect binary tree↗Hard
  669. 669. Convert a Binary Search Tree into a Min Heap↗Hard
  670. 670. Snake and Ladder Problem↗Hard
  671. 671. Find the shortest distance of every cell from a landmine inside a maze↗Hard
  672. 672. Convert a multilevel linked list to a singly linked listMedium
  673. 673. Check if an undirected graph contains a cycle or not↗Medium
  674. 674. Find maximum cost path in a graph from a given source to a given destination↗Medium
  675. 675. Total paths in a digraph from a given source to a destination having exactly m edges↗Medium
  676. 676. Least cost path in a digraph from a given source to a destination having m edges↗Medium
  677. 677. Traverse a given directory using BFS and DFS in JavaEasy
  678. 678. Perform vertical traversal of a binary tree↗Medium
  679. 679. Compute the maximum number of nodes at any level in a binary tree↗Easy
  680. 680. Print right view of a binary tree↗Medium
  681. 681. Find the minimum depth of a binary tree↗Easy
  682. 682. Depth-First Search (DFS) vs Breadth-First Search (BFS)Beginner
  683. 683. Bipartite Graph↗Medium
  684. 684. Compute the least cost path in a weighted digraph using BFS↗Medium
  685. 685. Find the path between given vertices in a directed graph↗Easy
  686. 686. Construct a directed graph from an undirected graph that satisfies given constraintsMedium
  687. 687. Trie Implementation – C, C++, C++ (Memory Efficient), Java, PythonBeginner
  688. 688. Longest Common Prefix in a given set of strings (using Trie)↗Medium
  689. 689. Lexicographic sorting of a given set of keys↗Medium
  690. 690. Lexicographic rank of a string↗Hard
  691. 691. Find the maximum occurring word in a given set of strings↗Easy
  692. 692. Find first k maximum occurring words in a given set of stringsMedium
  693. 693. Find duplicate rows in a binary matrix↗Medium
  694. 694. Word Break Problem – Using Trie Data Structure↗Medium
  695. 695. Generate a list of possible words from a character matrix↗Hard
  696. 696. Find all words matching a pattern in the given dictionary↗Medium
  697. 697. Find the shortest unique prefix for every word in an array↗Medium
  698. 698. Remove loop from a linked list↗Medium
  699. 699. Find number of customers who could not get any computer↗Easy
  700. 700. Find the smallest missing positive number from an unsorted array↗Medium
  701. 701. Print all pairs of anagrams in a set of strings↗Medium
  702. 702. Find total arrangements such that no two balls of the same color are together↗Hard
  703. 703. Determine whether a BST is skewed from its preorder traversal↗Easy
  704. 704. Determine whether two nodes lie on the same path in a binary tree↗Medium
  705. 705. Find height of a binary tree represented by the parent array↗Medium
  706. 706. In-place merge two height-balanced BSTs↗Hard
  707. 707. Check if removing an edge can split a binary tree into two equal size trees↗Easy
  708. 708. Find read-write conflicts among given database transactions↗Medium
  709. 709. Construct a complete binary tree from its linked list representation↗Easy
  710. 710. Find the minimum number of merge operations to make an array palindrome↗Medium
  711. 711. Check whether a directed graph is Eulerian↗Medium
  712. 712. Count nodes in a BST that lies within a given range↗Easy
  713. 713. Check if a number is a power of 8 or not↗Medium
  714. 714. Check if a number is a perfect squareEasy
  715. 715. Shrink an array by removing triplets that satisfy given constraints↗Hard
  716. 716. Count distinct permutations of an array that sums to a targetMedium
  717. 717. Check if a string can be constructed from another stringEasy
  718. 718. Check children-sum property in a binary tree↗Easy

Rate this post

Average rating 4.87/5. Vote count: 5975

No votes so far! Be the first to rate this post.

We are sorry that this post was not useful for you!

Tell us how we can improve this post?

Thanks for reading.

To share your code in the comments, please use our online compiler that supports C, C++, Java, Python, JavaScript, C#, PHP, and many more popular programming languages.

Like us? Refer us to your friends and support our growth. Happy coding :)


guest
104 Comments
Most Voted
Newest Oldest
Inline Feedbacks
View all comments
Do NOT follow this link or you will be banned from the site!