"# DsaQuestion2023"
"This repo contains a variety of DSA questions"
| Topic | Questions | Level | DAY | Completed |
|---|---|---|---|---|
| Array | Search an Element in an array | Easy | 1 | Yes |
| Array | Check if two arrays are equal or not | Easy | 1 | Yes |
| Array | Missing element of AP | Easy | 1 | Yes |
| Array | Cyclically rotate an array by one | Easy | 1 | Yes |
| Array | Find minimum and maximum element in an array | Easy | 2 | Yes |
| Array | Binary Array Sorting | Easy | 2 | Yes |
| Array | Move all negative elements to end | Easy | 2 | Yes |
| Array | Missing number | Easy | 2 | Yes |
| Array | Search Element in Matrix | Easy | 3 | Yes |
| Array | Find the fine | Easy | 3 | Yes |
| Array | Greater on right side | Easy | 3 | Yes |
| Array | Remove duplicate elements from sorted Array | Easy | 3 | Yes |
| Array | Subarray with given sum | Easy | 4 | No |
| Array | Sort an array of 0s, 1s and 2s | Easy | 4 | No |
| Array | Equilibrium Point | Easy | 4 | No |
| Array | Peak element | Easy | 4 | No |
| Array | Find Transition Point | Easy | 5 | No |
| Array | Alternate positive and negative numbers | Easy | 5 | No |
| Array | Union of Two Sorted Arrays | Easy | 5 | No |
| Array | Three way partitioning | Easy | 5 | No |
| Array | Frogs and Jumps | Easy | 6 | No |
| Array | Min Subsets with Consecutive Numbers | Easy | 6 | No |
| Array | Find Missing And Repeating | Medium | 6 | No |
| Array | Rearrange Array Alternately | Medium | 7 | No |
| Array | Pythagorean Triplet | Medium | 7 | No |
| Array | Rearrange an array with O(1) extra space | Medium | 7 | No |
| Array | Count triplets with sum smaller than X | Medium | 7 | No |
| Array | Boolean Matrix | Medium | 7 | No |
| Array | Row with max 1s | Medium | 7 | No |
| Array | Container With Most Water | Medium | 8 | No |
| Array | Maximum Triplet product | Medium | 8 | No |
| Array | Coins of Geekland | Medium | 8 | No |
| Array | Next Permutation | Medium | 9 | No |
| Array | Rotate Image | Medium | 9 | No |
| Array | Count Primes | Medium | 10 | No |
| Array | Watering Plants | Medium | 10 | No |
| Array | Arithmetic Subarrays | Medium | 10 | No |
| Array | Majority Element | Medium | 11 | No |
| Array | Max Circular Subarray Sum | Hard | 11 | No |
| Array | Count the subarrays having product less than k | Hard | 12 | No |
| Array | Maximum subset XOR | Hard | 12 | No |
| Array | Next Smallest Palindrome | Hard | 13 | No |
| Array | Count the number of subarrays | Hard | 13 | No |
| Array | Largest rectangle of 1s with swapping of columns allowed | Hard | 14 | No |
| Array | N/3 Repeat Number | Hard | 14 | No |
| String | Reverse a String | Easy | 15 | Yes |
| String | Check if strings are rotations of each other or not | Easy | 15 | Yes |
| String | Maximum Occuring Character | Easy | 15 | Yes |
| String | Binary String | Easy | 15 | Yes |
| String | Anagram of String | Easy | 16 | Yes |
| String | Merge two strings | Easy | 16 | Yes |
| String | Reverse words in a given string | Easy | 16 | Yes |
| String | Palindrome String | Easy | 16 | Yes |
| String | Longest Common Prefix in an Array | Easy | 17 | Yes |
| String | Roman Number to Integer | Easy | 17 | Yes |
| String | Length of Last Word | Easy | 17 | No |
| String | Longest Distinct characters in string | Easy | 17 | No |
| String | Remove all duplicates from a given string | Easy | 18 | No |
| String | Min Number of Flips | Easy | 18 | No |
| String | Meta Strings | Easy | 18 | No |
| String | Smallest window containing 0, 1 and 2 | Easy | 18 | No |
| String | Generate Grey Code Sequences | Easy | 19 | No |
| String | Sum of two large numbers | Medium | 20 | No |
| String | Length of the longest substring | Medium | 20 | No |
| String | Longest Prefix Suffix | Medium | 20 | No |
| String | Smallest distinct window | Medium | 21 | No |
| String | Case-specific Sorting of Strings | Medium | 21 | No |
| String | Excel Sheet | Part - 1 | Medium | 21 |
| String | Transform String | Medium | 22 | No |
| String | Remove and Reverse | Medium | 22 | No |
| String | String formation from substring | Medium | 22 | No |
| String | Minimum Days | Medium | 23 | No |
| String | Remove Consecutive Characters | Medium | 23 | No |
| String | Bulls and Cows | Medium | 23 | No |
| String | Atoi | Medium | 24 | No |
| String | Valid Ip Addresses | Hard | 24 | No |
| String | Integer To Roman | Hard | 25 | No |
| String | Minimum characters to be added at front to make string palindrome | Hard | 25 | No |
| String | Wildcard string matching | Hard | 26 | No |
| String | Longest Palindromic Substring in Linear Time | Hard | 26 | No |
| String | Numbers with one absolute difference | Hard | 27 | No |
| String | Stringoholics | Hard | 27 | No |
| String | Power of 2 | Hard | 28 | No |
| String | Justified Text | Hard | 28 | No |
| Searching and Sorting | Searching an element in a sorted array | Easy | 29 | Yes |
| Searching and Sorting | Last index of One | Easy | 29 | Yes |
| Searching and Sorting | Count the Zeros | Easy | 29 | Yes |
| Searching and Sorting | Elements in the Range | Easy | 29 | No |
| Searching and Sorting | Bubble Sort | Easy | 30 | Yes |
| Searching and Sorting | Insertion Sort | Easy | 30 | No |
| Searching and Sorting | First and last occurrences of X | Easy | 30 | No |
| Searching and Sorting | Count zeros in a sorted matrix | Easy | 30 | No |
| Searching and Sorting | Array Subset of another array | Easy | 31 | No |
| Searching and Sorting | Selection Sort | Easy | 31 | No |
| Searching and Sorting | Floor in a Sorted Array | Easy | 31 | No |
| Searching and Sorting | Radix Sort | Easy | 31 | No |
| Searching and Sorting | Search in a matrix | Easy | 32 | No |
| Searching and Sorting | Bitonic Point | Easy | 32 | No |
| Searching and Sorting | Two Repeated Elements | Easy | 32 | No |
| Searching and Sorting | Count More than n/k Occurences | Easy | 32 | No |
| Searching and Sorting | Number and the Digit Sum | Easy | 33 | No |
| Searching and Sorting | Find triplets with zero sum | Easy | 33 | No |
| Searching and Sorting | Sort The Array | Easy | 33 | No |
| Searching and Sorting | Sort in specific order | Easy | 33 | No |
| Searching and Sorting | Sort a String | Easy | 34 | No |
| Searching and Sorting | Triplet Family | Easy | 34 | No |
| Searching and Sorting | Merge and Sort | Easy | 34 | No |
| Searching and Sorting | Merging two unsorted arrays in sorted order | Easy | 34 | No |
| Searching and Sorting | Rope Cutting | Easy | 35 | No |
| Searching and Sorting | Make array elements unique | Easy | 35 | No |
| Searching and Sorting | Kth smallest element | Medium | 35 | No |
| Searching and Sorting | Smallest Positive missing number | Medium | 35 | Yes |
| Searching and Sorting | Sort an array according to the other | Medium | 36 | No |
| Searching and Sorting | Square root of a number | Medium | 36 | No |
| Searching and Sorting | Search in a row-column sorted Matrix | Medium | 36 | No |
| Searching and Sorting | Smallest factorial number | Medium | 37 | No |
| Searching and Sorting | Merge Sort | Medium | 37 | No |
| Searching and Sorting | Quick Sort | Medium | 37 | No |
| Searching and Sorting | Count Inversions | Medium | 38 | No |
| Searching and Sorting | Find All Four Sum Numbers | Medium | 38 | No |
| Searching and Sorting | Minimum Swaps to Sort | Medium | 38 | No |
| Searching and Sorting | Number of pairs | Medium | 39 | No |
| Searching and Sorting | Sort an Array | Medium | 39 | No |
| Searching and Sorting | Sorting Elements of an Array by Frequency | Medium | 39 | No |
| Searching and Sorting | Overlapping Intervals | Medium | 40 | No |
| Searching and Sorting | Find minimum number of Laptops required | Medium | 40 | No |
| Searching and Sorting | LCP | Medium | 40 | No |
| Searching and Sorting | Reach a Number | Medium | 41 | No |
| Searching and Sorting | Heaters | Medium | 41 | No |
| Searching and Sorting | Friends Of Appropriate Ages | Medium | 41 | No |
| Searching and Sorting | Koko Eating Bananas | Medium | 42 | No |
| Searching and Sorting | 3Sum | Medium | 42 | No |
| Searching and Sorting | 3Sum Closest | Medium | 42 | No |
| Searching and Sorting | Nth Digit | Medium | 42 | No |
| Searching and Sorting | Sort a 2D vector diagonally | Medium | 43 | No |
| Searching and Sorting | Maximum Intersecting Lines | Medium | 43 | No |
| Searching and Sorting | Merge Without Extra Space | Hard | 43 | No |
| Searching and Sorting | Median of the Subarrays | Hard | 44 | No |
| Searching and Sorting | Median of Array | Hard | 44 | No |
| Searching and Sorting | Implement Power Function | Hard | 45 | No |
| Searching and Sorting | WoodCutting Made Easy! | Hard | 45 | No |
| Searching and Sorting | Matrix Median | Hard | 46 | No |
| Searching and Sorting | Allocate Books | Hard | 46 | No |
| Searching and Sorting | Painter's Partition Problem | Hard | 47 | No |
| Searching and Sorting | Red Zone | Hard | 47 | No |
| Searching and Sorting | Max Sum of Rectangle No Larger Than K | Hard | 48 | No |
| Searching and Sorting | Smallest Good Base | Hard | 48 | No |
| Searching and Sorting | House Robber IV | Hard | 49 | No |
| Searching and Sorting | Maximum Gap | Hard | 49 | No |
| LinkedList | Print Linked List elements | Easy | 50 | No |
| LinkedList | Linked List Insertion | Easy | 50 | No |
| LinkedList | Count nodes of linked list | Easy | 50 | No |
| LinkedList | Check If Circular Linked List | Easy | 50 | No |
| LinkedList | Identical Linked Lists | Easy | 51 | No |
| LinkedList | Insert in a Sorted List | Easy | 51 | No |
| LinkedList | Insert in Middle of Linked List | Easy | 51 | No |
| LinkedList | Delete node in Doubly Linked List | Easy | 51 | No |
| LinkedList | Reverse a Doubly Linked List | Easy | 52 | No |
| LinkedList | Delete Alternate Nodes | Easy | 52 | No |
| LinkedList | Find the Sum of Last N nodes of the Linked List | Easy | 52 | No |
| LinkedList | Find n/k th node in Linked list | Easy | 52 | No |
| LinkedList | Detect Loop in linked list | Easy | 53 | No |
| LinkedList | Move Last Element to Front of a Linked List | Easy | 53 | No |
| LinkedList | Nth node from end of linked list | Easy | 53 | No |
| LinkedList | Finding middle element in a linked list | Easy | 53 | No |
| LinkedList | Reverse a linked list | Easy | 54 | No |
| LinkedList | Remove duplicate element from sorted Linked List | Easy | 54 | No |
| LinkedList | Delete without head pointer | Easy | 54 | No |
| LinkedList | Remove duplicates from an unsorted linked list | Easy | 54 | No |
| LinkedList | Delete a Node in Single Linked List | Easy | 55 | No |
| LinkedList | Given a linked list of 0s, 1s and 2s, sort it. | Easy | 55 | No |
| LinkedList | Find length of Loop | Easy | 55 | No |
| LinkedList | Intersection of two sorted Linked lists | Easy | 55 | No |
| LinkedList | Pairwise swap elements of a linked list | Easy | 56 | No |
| LinkedList | Sorted insert for circular linked list | Easy | 56 | No |
| LinkedList | Count Pairs whose sum is equal to X | Easy | 56 | No |
| LinkedList | Intersection of Two Linked Lists | Easy | 56 | No |
| LinkedList | Split a Circular Linked List into two halves | Easy | 57 | No |
| LinkedList | Union of Two Linked Lists | Easy | 57 | No |
| LinkedList | Linked List Matrix | Easy | 57 | No |
| LinkedList | XOR Linked List | Easy | 57 | No |
| LinkedList | Remove loop in Linked List | Medium | 58 | No |
| LinkedList | Intersection Point in Y Shaped Linked Lists | Medium | 58 | No |
| LinkedList | Check if Linked List is Palindrome | Medium | 58 | No |
| LinkedList | Rotate a Linked List | Medium | 59 | No |
| LinkedList | Merge two sorted linked lists | Medium | 59 | No |
| LinkedList | Delete nodes having greater value on right | Medium | 59 | No |
| LinkedList | Merge Sort for Linked List | Medium | 60 | No |
| LinkedList | Rearrange a linked list | Medium | 60 | No |
| LinkedList | Prime List | Medium | 60 | No |
| LinkedList | Length of longest palindrome in linked list | Medium | 61 | No |
| LinkedList | Reverse alternate nodes in Link List | Medium | 61 | No |
| LinkedList | Merge Sort on Doubly Linked List | Medium | 61 | No |
| LinkedList | Quick Sort on Linked List | Medium | 62 | No |
| LinkedList | QuickSort on Doubly Linked List | Medium | 62 | No |
| LinkedList | Remove all occurences of duplicates in a linked list | Medium | 62 | No |
| LinkedList | Insertion Sort for Singly Linked List | Medium | 63 | No |
| LinkedList | Reverse Alternate K Nodes | Medium | 63 | No |
| LinkedList | Linked List Cycle II | Medium | 63 | No |
| LinkedList | LRU Cache | Medium | 64 | No |
| LinkedList | Flatten a Multilevel Doubly Linked List | Medium | 64 | No |
| LinkedList | Clone a linked list with next and random pointer | Hard | 64 | No |
| LinkedList | Reorder List | Hard | 65 | No |
| LinkedList | Reverse a sublist of a linked list | Hard | 65 | No |
| LinkedList | LFU Cache | Hard | 66 | No |
| LinkedList | Reverse Nodes in k-Group | Hard | 66 | No |
| LinkedList | Design Skiplist | Hard | 67 | No |
| LinkedList | Subtraction in Linked List | Hard | 67 | No |
| Stack | Immediate Smaller Element | Easy | 68 | No |
| Stack | Implement stack using array | Easy | 68 | No |
| Stack | Implement Stack using Linked List | Easy | 68 | No |
| Stack | Pairwise Consecutive Elements | Easy | 68 | No |
| Stack | Parenthesis Checker | Easy | 69 | No |
| Stack | Sort a stack | Easy | 69 | No |
| Stack | Delete middle element of a stack | Easy | 69 | No |
| Stack | Maximum Difference | Easy | 69 | No |
| Stack | Print Bracket Number | Easy | 70 | No |
| Stack | Max sum in sub-arrays | Easy | 70 | No |
| Stack | String Manipulation | Easy | 70 | No |
| Stack | Make the array beautiful | Easy | 70 | No |
| Stack | Next Greater Element I | Easy | 71 | No |
| Stack | Baseball Game | Easy | 71 | No |
| Stack | Backspace String Compare | Easy | 71 | No |
| Stack | Next Greater Element | Medium | 71 | No |
| Stack | Get minimum element from stack | Medium | 72 | No |
| Stack | The Celebrity Problem | Medium | 72 | No |
| Stack | Smallest number on left | Medium | 72 | No |
| Stack | Asteroid Collision | Medium | 73 | No |
| Stack | Remove K Digits | Medium | 73 | No |
| Stack | Valid Expression | Medium | 73 | No |
| Stack | Find Maximum Equal sum of Three Stacks | Medium | 74 | No |
| Stack | MAXSPPROD | Medium | 74 | No |
| Stack | Decode String | Medium | 74 | No |
| Stack | Evaluate Expression | Medium | 75 | No |
| Stack | Redundant Braces | Medium | 75 | No |
| Stack | Next Greater Element II | Medium | 75 | No |
| Stack | Clumsy Factorial | Medium | 76 | No |
| Stack | Maximum Rectangular Area in a Histogram | Hard | 76 | No |
| Stack | Maximum of minimum for every window size | Hard | 77 | No |
| Stack | IPL 2021 - Final | Hard | 77 | No |
| Stack | IPL 2021 - Match Day 6 - Semi Final | Hard | 78 | No |
| Stack | Rain Water Trapped | Hard | 78 | No |
| Stack | Simplify Directory Path | Hard | 79 | No |
| Stack | Basic Calculator | Hard | 79 | No |
| Stack | Create Maximum Number | Hard | 80 | No |
| Stack | Tag Validator | Hard | 80 | No |
| Stack | Max Chunks To Make Sorted II | Hard | 81 | No |
| Queue | Queue Push & Pop | Easy | 81 | No |
| Queue | Queue Reversal | Easy | 81 | No |
| Queue | Implement Queue using array | Easy | 82 | No |
| Queue | Implement Queue using Linked List | Easy | 82 | No |
| Queue | Generate Binary Numbers | Easy | 82 | No |
| Queue | Stack using two queues | Easy | 82 | No |
| Queue | Queue using two Stacks | Easy | 83 | No |
| Queue | Reverse First K elements of Queue | Easy | 83 | No |
| Queue | Deque Implementations | Easy | 83 | No |
| Queue | Next Right Node | Easy | 83 | No |
| Queue | First Unique Character in a Str | Easy | 84 | No |
| Queue | Number of Recent Calls | Easy | 84 | No |
| Queue | Time Needed to Buy Tickets | Easy | 84 | No |
| Queue | First non-repeating character in a stream | Medium | 84 | No |
| Queue | Circular tour | Medium | 85 | No |
| Queue | Count the Reversals | Medium | 85 | No |
| Queue | Stack Permutations | Medium | 85 | No |
| Queue | Operations on PriorityQueue | Medium | 86 | No |
| Queue | Design Circular Deque | Medium | 86 | No |
| Queue | First non-repeating character in a stream of characters | Medium | 86 | No |
| Queue | Sliding Window Maximum | Medium | 87 | No |
| Queue | Stamping The Sequence | Hard | 87 | No |
| Queue | Minimum Number of K Consecutive Bit Flips | Hard | 88 | No |
| Queue | Count Subarrays With Fixed Bounds | Hard | 88 | No |
| Tree | Inorder Traversal | Easy | 89 | Yes |
| Tree | Preorder Traversal | Easy | 89 | Yes |
| Tree | Postorder Traversal | Easy | 89 | Yes |
| Tree | Count Leaves in Binary Tree | Easy | 89 | No |
| Tree | Size of Binary Tree | Easy | 90 | No |
| Tree | Sum of Binary Tree | Easy | 90 | No |
| Tree | Count Non-Leaf Nodes in Tree | Easy | 90 | No |
| Tree | Left View of Binary Tree | Easy | 90 | No |
| Tree | Right View of Binary Tree | Easy | 91 | No |
| Tree | Height of Binary Tree | Easy | 91 | Yes |
| Tree | Root to leaf paths sum | Easy | 91 | No |
| Tree | Check for Balanced Tree | Easy | 91 | No |
| Tree | Determine if Two Trees are Identical | Easy | 92 | Yes |
| Tree | Level order traversal | Easy | 92 | Yes |
| Tree | Level order traversal in spiral form | Easy | 92 | Yes |
| Tree | Mirror Tree | Easy | 92 | No |
| Tree | Print all nodes that don't have sibling | Easy | 93 | No |
| Tree | Maximum Depth Of Binary Tree | Easy | 93 | No |
| Tree | Shortest distance in infinite tree | Easy | 93 | No |
| Tree | Largest value in each level | Easy | 93 | No |
| Tree | Perfect Binary Tree | Easy | 94 | No |
| Tree | Nodes at Odd Levels | Easy | 94 | No |
| Tree | Remove Half Nodes | Easy | 94 | No |
| Tree | Find the maximum GCD of the siblings of a Binary Tree | Easy | 94 | No |
| Tree | Maximum Node Level | Easy | 95 | No |
| Tree | Deletion in a Binary Tree | Easy | 95 | No |
| Tree | Check if two Nodes are Cousins | Easy | 95 | No |
| Tree | Vertical Order traversal of Binary Tree | Medium | 95 | Yes |
| Tree | Diagonal Traversal | Medium | 96 | No |
| Tree | Flatten Binary Tree to Linked List | Medium | 96 | No |
| Tree | Merge two Binary Tree | Medium | 96 | No |
| Tree | Maximum Edge Removal | Medium | 97 | No |
| Tree | Populate Next Right Pointers Tree | Medium | 97 | No |
| Tree | Burn a Tree | Medium | 97 | No |
| Tree | Boundary Traversal of binary tree | Medium | 98 | Yes |
| Tree | Diameter of a Binary Tree | Medium | 98 | Yes |
| Tree | Sum Tree | Medium | 98 | No |
| Tree | Top View of Binary Tree | Medium | 99 | Yes |
| Tree | Bottom View of Binary Tree | Medium | 99 | Yes |
| Tree | Lowest Common Ancestor in a Binary Tree | Medium | 99 | No |
| Tree | Maximum difference between node and its ancestor | Medium | 100 | No |
| Tree | Serialize and Deserialize a Binary Tree | Medium | 100 | No |
| Tree | Maximum sum of Non-adjacent nodes | Medium | 100 | No |
| Tree | Foldable Binary Tree | Medium | 101 | No |
| Tree | Construct Binary Tree from Parent Array | Medium | 101 | No |
| Tree | Make Binary Tree From Linked List | Medium | 101 | No |
| Tree | Check Mirror in N-ary tree | Medium | 102 | No |
| Tree | Inorder Traversal (Iterative) | Medium | 102 | No |
| Tree | Postorder Traversal (Iterative) | Medium | 102 | No |
| Tree | Print Nodes having K leaves | Medium | 103 | No |
| Tree | Print Binary Tree levels in sorted order | Medium | 103 | No |
| Tree | Nodes at given distance in binary tree | Hard | 103 | No |
| Tree | Burning Tree | Hard | 104 | No |
| Tree | Check if all levels of two trees are anagrams or not | Hard | 104 | No |
| Tree | Binary Tree to DLL | Hard | 105 | No |
| Tree | Maximum Path Sum between 2 Special Nodes | Hard | 105 | No |
| Tree | Scrambled String | Hard | 106 | No |
| Tree | Check Tree Traversal | Hard | 106 | No |
| Tree | Corona Vaccine | Hard | 107 | No |
| Tree | Recover a Tree From Preorder | Hard | 107 | No |
| Binary Search Tree | Search a node in BST | Easy | 108 | No |
| Binary Search Tree | Minimum element in BST | Easy | 108 | No |
| Binary Search Tree | Check for BST | Easy | 108 | No |
| Binary Search Tree | Insert a node in a BST | Easy | 108 | No |
| Binary Search Tree | Kth largest element in BST | Easy | 109 | No |
| Binary Search Tree | Inorder Traversal and BST | Easy | 109 | No |
| Binary Search Tree | Binary Tree to BST | Easy | 109 | No |
| Binary Search Tree | Median of BST | Easy | 109 | No |
| Binary Search Tree | Kth Smallest Element In Tree | Easy | 110 | No |
| Binary Search Tree | BST Iterator | Easy | 110 | No |
| Binary Search Tree | 2-Sum Binary Tree | Easy | 110 | No |
| Binary Search Tree | Find Common Nodes in two BSTs | Easy | 110 | No |
| Binary Search Tree | Array to BST | Easy | 111 | No |
| Binary Search Tree | Inorder Successor in BST | Easy | 111 | No |
| Binary Search Tree | Print BST elements in given range | Easy | 111 | No |
| Binary Search Tree | Check whether BST contains Dead End | Easy | 111 | No |
| Binary Search Tree | Brothers From Different Roots | Easy | 112 | No |
| Binary Search Tree | Sum of k smallest elements in BST | Easy | 112 | No |
| Binary Search Tree | Minimum Distance Between | Easy | 112 | No |
| Binary Search Tree | Normal BST to Balanced BST | Easy | 112 | No |
| Binary Search Tree | Construct BST from Postorder | Easy | 113 | No |
| Binary Search Tree | Recover Binary Search Tree | Medium | 113 | No |
| Binary Search Tree | Valid BST from Preorder | Medium | 113 | No |
| Binary Search Tree | k-th smallest element in BST | Medium | 114 | No |
| Binary Search Tree | Delete a node from BST | Medium | 114 | No |
| Binary Search Tree | Largest BST | Medium | 114 | No |
| Binary Search Tree | Predecessor and Successor | Medium | 115 | No |
| Binary Search Tree | Preorder to PostOrder | Medium | 115 | No |
| Binary Search Tree | Find the Closest Element in BST | Medium | 115 | No |
| Binary Search Tree | Ceil in BST | Medium | 116 | No |
| Binary Search Tree | Preorder Traversal and BST | Medium | 116 | No |
| Binary Search Tree | Bheem Wants Ladoos | Medium | 116 | No |
| Binary Search Tree | Minimum Absolute Difference In BST | Medium | 117 | No |
| Binary Search Tree | Valentine Sum | Medium | 117 | No |
| Binary Search Tree | Pairs violating BST property | Medium | 117 | No |
| Binary Search Tree | Remove BST keys outside given range | Medium | 118 | No |
| Binary Search Tree | Print leaf nodes from preorder traversal of BST | Medium | 118 | No |
| Binary Search Tree | Delete nodes greater than k | Medium | 118 | No |
| Binary Search Tree | Balance a Binary Search Tree | Medium | 119 | No |
| Binary Search Tree | Merge two BST 's | Hard | 119 | No |
| Binary Search Tree | Fixing Two nodes of a BST | Hard | 120 | No |
| Binary Search Tree | Fixing Two swapped nodes of a BST | Hard | 120 | No |
| Binary Search Tree | Sorted Link List to BST | Hard | 120 | No |
| Binary Search Tree | Shortest Range In BST | Hard | 120 | No |
| Heaps | Implement a Maxheap/MinHeap using arrays and recursion. | Easy | 121 | No |
| Heaps | Height of Heap | Easy | 121 | No |
| Heaps | Relative Ranks | Easy | 121 | No |
| Heaps | Last Stone Weight | Easy | 121 | No |
| Heaps | Profit Maximisation | Easy | 122 | No |
| Heaps | Maximum Product of Two Elem | Easy | 122 | No |
| Heaps | Largest Number After Digit Swaps by Parity | Easy | 122 | No |
| Heaps | Minimum Amount of Time to Fil | Easy | 122 | No |
| Heaps | Take Gifts From the Richest P | Easy | 123 | No |
| Heaps | Minimum Cost of ropes | Easy | 123 | No |
| Heaps | Sum of elements between k1'th and k2'th smallest elements | Easy | 123 | No |
| Heaps | Merge two binary Max heaps | Easy | 123 | No |
| Heaps | Maximum distinct elements after removing K elements | Easy | 123 | No |
| Heaps | Gadgets of Doraland | Easy | 124 | No |
| Heaps | Merge K sorted arrays! | Easy | 124 | No |
| Heaps | Magician and Chocolates | Easy | 124 | No |
| Heaps | Heap Sort | Medium | 124 | No |
| Heaps | k largest elements | Medium | 125 | No |
| Heaps | Kth largest element in a stream | Medium | 125 | No |
| Heaps | Is Binary Tree Heap | Medium | 125 | No |
| Heaps | Kth element in Matrix | Medium | 126 | No |
| Heaps | Huffman Encoding | Medium | 126 | No |
| Heaps | K-th Smallest Prime Fraction | Medium | 126 | No |
| Heaps | Exam Room | Medium | 127 | No |
| Heaps | Rearrange characters | Medium | 127 | No |
| Heaps | BST to max heap | Medium | 127 | No |
| Heaps | Design Twitter | Medium | 128 | No |
| Heaps | Minimum increment/decrement to make array non-Increasing | Medium | 128 | No |
| Heaps | Find median in a stream | Hard | 128 | No |
| Heaps | Smallest range in K lists | Hard | 129 | No |
| Heaps | Reachable Nodes In Subdivided Graph | Hard | 129 | No |
| Heaps | Ways to form Max Heap | Hard | 130 | No |
| Heaps | Maximum Sum Combinations | Hard | 130 | No |
| Heaps | Dinner Plate Stacks | Hard | 131 | No |
| Heaps | Construct Target Array With | Hard | 131 | No |
| Heaps | Minimum Time to Visit a Cell In a Grid | Hard | 132 | No |
| Greedy | Bulbs | Easy | 132 | No |
| Greedy | Ishaan Loves Chocolates | Easy | 132 | No |
| Greedy | Assign Mice to Holes | Easy | 133 | No |
| Greedy | Majority Element | Easy | 133 | No |
| Greedy | Highest Product | Easy | 133 | No |
| Greedy | Swap and Maximize | Easy | 133 | No |
| Greedy | Good or Bad string | Easy | 134 | No |
| Greedy | N meetings in one room | Easy | 134 | No |
| Greedy | Longest Palindrome | Easy | 134 | No |
| Greedy | Assign Cookies | Easy | 134 | No |
| Greedy | Can Place Flowers | Easy | 135 | No |
| Greedy | Valid Palindrome II | Easy | 135 | No |
| Greedy | Minimum Cost to Move Chips | Easy | 135 | No |
| Greedy | Raju and coins | Easy | 135 | No |
| Greedy | Huffman Decoding | Easy | 136 | No |
| Greedy | Huffman Decoding-1 | Easy | 136 | No |
| Greedy | Largest number with given sum | Easy | 136 | No |
| Greedy | Disjoint Intervals | Medium | 136 | No |
| Greedy | Meeting rooms | Medium | 137 | No |
| Greedy | Minimum number of jumps | Medium | 137 | No |
| Greedy | Majority Element | Medium | 137 | No |
| Greedy | Minimize the Heights I | Medium | 138 | No |
| Greedy | Minimize the Heights II | Medium | 138 | No |
| Greedy | Minimum Platforms | Medium | 138 | No |
| Greedy | Fractional Knapsack | Medium | 138 | No |
| Greedy | Page Faults in LRU | Medium | 139 | No |
| Greedy | Valid Compressed String | Medium | 139 | No |
| Greedy | String rp or pr | Medium | 139 | No |
| Greedy | Coin Piles | Medium | 140 | No |
| Greedy | Police and Thieves | Medium | 140 | No |
| Greedy | Maximum number of events that can be attended | Medium | 140 | No |
| Greedy | Water the plants | Medium | 141 | No |
| Greedy | Binary Searchable elements | Medium | 141 | No |
| Greedy | Decrease Elements To Make A | Medium | 141 | No |
| Greedy | Minimum Cost to Move Chips to The Same Position | Medium | 142 | No |
| Greedy | Largest Permutation | Hard | 142 | No |
| Greedy | Distribute Candy | Hard | 143 | No |
| Greedy | Seats | Hard | 143 | No |
| Greedy | Gas Station | Hard | 144 | No |
| Greedy | Candy | Hard | 144 | No |
| Greedy | Patching Array | Hard | 145 | No |
| Greedy | Strong Password Checker | Hard | 145 | No |
| Greedy | IPO | Hard | 146 | No |
| Greedy | Super Washing Machines | Hard | 146 | No |
| Greedy | Course Schedule III | Hard | 147 | No |
| Greedy | Stamping The Sequence | Hard | 147 | No |
| BackTracking | Find all possible paths from top to bottom | Easy | 148 | No |
| BackTracking | Combinations | Easy | 148 | No |
| BackTracking | Binary Tree Paths | Easy | 148 | No |
| BackTracking | Gray Code | Easy | 148 | No |
| BackTracking | Letter Phone | Easy | 149 | No |
| BackTracking | Generate all Parentheses II | Easy | 149 | No |
| BackTracking | Permutation with Spaces | Easy | 149 | No |
| BackTracking | Binary Watch | Easy | 149 | No |
| BackTracking | Generate IP Addresses | Medium | 150 | No |
| BackTracking | Sudoku | Medium | 150 | No |
| BackTracking | Permutations | Medium | 150 | No |
| BackTracking | Maximal String | Medium | 151 | No |
| BackTracking | Kth Permutation Sequence | Medium | 151 | No |
| BackTracking | Palindrome Partitioning | Medium | 151 | No |
| BackTracking | Permutations of a given string | Medium | 152 | No |
| BackTracking | M-Coloring Problem | Medium | 152 | No |
| BackTracking | Combination Sum | Medium | 152 | No |
| BackTracking | Rat in a Maze Problem - I | Medium | 153 | No |
| BackTracking | Largest number in K swaps | Medium | 153 | No |
| BackTracking | Unique Subsets | Medium | 153 | No |
| BackTracking | Generate Parentheses | Medium | 154 | No |
| BackTracking | Rat Maze With Multiple Jumps | Medium | 154 | No |
| BackTracking | Coins and Game | Medium | 154 | No |
| BackTracking | NQueens | Hard | 155 | No |
| BackTracking | 24 Game | Hard | 155 | No |
| BackTracking | Maximum Good People Based on Statements | Hard | 156 | No |
| BackTracking | Expression Add Operators | Hard | 156 | No |
| Hashing | First Repeating element | Easy | 157 | No |
| Hashing | 2 Sum | Easy | 157 | No |
| Hashing | Union of two arrays | Easy | 157 | No |
| Hashing | First element to occur k times | Easy | 157 | No |
| Hashing | Diffk II | Easy | 158 | No |
| Hashing | Longest Substring Without Repeat | Easy | 158 | No |
| Hashing | Pairs With Given Xor | Easy | 158 | No |
| Hashing | Sum of f(a[i], a[j]) over all pairs in an array of n integers | Easy | 158 | No |
| Hashing | Substrings with same first and last characters | Easy | 159 | No |
| Hashing | Largest subarray with 0 sum | Easy | 159 | No |
| Hashing | Count distinct elements in every window | Easy | 159 | No |
| Hashing | Largest subarray of 0's and 1's | Easy | 159 | No |
| Hashing | Longest consecutive subsequence | Medium | 160 | No |
| Hashing | Colorful Number | Medium | 160 | No |
| Hashing | Subarray with B odd numbers | Medium | 160 | No |
| Hashing | An Increment Problem | Medium | 161 | No |
| Hashing | Substring Concatenation | Medium | 161 | No |
| Hashing | Copy List | Medium | 161 | No |
| Hashing | Triplet Sum in Array | Medium | 162 | No |
| Hashing | Nuts and Bolts Problem | Medium | 162 | No |
| Hashing | Subarrays with equal 1s and 0s | Medium | 162 | No |
| Hashing | Longest subarray with sum divisible by K | Medium | 163 | No |
| Hashing | Equal 0, 1 and 2 | Medium | 163 | No |
| Hashing | Points on the Straight Line | Hard | 163 | No |
| Hashing | Fraction | Hard | 164 | No |
| Hashing | Window String | Hard | 164 | No |
| Hashing | 4 Sum | Hard | 164 | No |
| Hashing | Two out of Three | Hard | 165 | No |
| Hashing | Joey doesn't share food | Hard | 165 | No |
| Graphs | BFS of graph | Easy | 166 | No |
| Graphs | DFS of Graph | Easy | 166 | No |
| Graphs | Shortest path from 1 to n | Easy | 166 | No |
| Graphs | Print adjacency list | Easy | 166 | No |
| Graphs | Maximum Weight Node | Easy | 167 | No |
| Graphs | Union-Find | Easy | 167 | No |
| Graphs | Eulerian Path in an Undirected Graph | Easy | 167 | No |
| Graphs | Find the Town Judge | Easy | 167 | No |
| Graphs | Find Center of Star Graph | Easy | 168 | No |
| Graphs | Path with good nodes! | Easy | 168 | No |
| Graphs | Largest Distance between nodes of a Tree | Easy | 168 | No |
| Graphs | Two teams? | Easy | 168 | No |
| Graphs | Region in BinaryMatrix | Easy | 169 | No |
| Graphs | Level Order | Easy | 169 | No |
| Graphs | Black Shapes | Easy | 169 | No |
| Graphs | Detect cycle in an undirected graph | Medium | 169 | No |
| Graphs | Detect cycle in a directed graph | Medium | 170 | No |
| Graphs | Topological sort | Medium | 170 | No |
| Graphs | Bipartite Graph | Medium | 170 | No |
| Graphs | Implementing Dijkstra Algorithm | Medium | 171 | No |
| Graphs | Minimum Spanning Tree(Kruksal and Prims) | Medium | 171 | No |
| Graphs | Strongly Connected Components (Kosaraju's Algo) | Medium | 171 | No |
| Graphs | Distance from the Source (Bellman-Ford Algorithm) | Medium | 172 | No |
| Graphs | Euler circuit and Path | Medium | 172 | No |
| Graphs | Rotten Oranges | Medium | 172 | No |
| Graphs | Steps by Knight | Medium | 173 | No |
| Graphs | Flood fill Algorithm | Medium | 173 | No |
| Graphs | Find the number of islands | Medium | 173 | No |
| Graphs | Shortest Source to Destination Path | Medium | 174 | No |
| Graphs | Unit Area of largest region of 1's | Medium | 174 | No |
| Graphs | Negative weight cycle | Medium | 174 | No |
| Graphs | Circle of strings | Medium | 175 | No |
| Graphs | Number of Provinces | Medium | 175 | No |
| Graphs | Knight Walk | Medium | 175 | No |
| Graphs | Bridge edge in a graph | Medium | 176 | No |
| Graphs | Hamiltonian Path | Medium | 176 | No |
| Graphs | Replace O's with X's | Medium | 176 | No |
| Graphs | Shortest path in Directed Acyclic Graph | Medium | 177 | No |
| Graphs | Word Search | Medium | 177 | No |
| Graphs | Course Schedule | Medium | 177 | No |
| Graphs | Maximum Bipartite Matching | Medium | 178 | No |
| Graphs | Number of Ways to Arrive at Destination | Medium | 178 | No |
| Graphs | Water Connection Problem | Medium | 178 | No |
| Graphs | Covid Spread | Medium | 179 | No |
| Graphs | Euler Circuit in an Undirected Graph | Medium | 179 | No |
| Graphs | Maximum Bipartite Matching | Medium | 179 | No |
| Graphs | Water Flow | Medium | 180 | No |
| Graphs | Possible paths between 2 vertices | Medium | 180 | No |
| Graphs | X Total Shapes | Medium | 180 | No |
| Graphs | Prerequisite Tasks | Medium | 181 | No |
| Graphs | Find whether path exist | Medium | 181 | No |
| Graphs | Strongly connected component (Tarjans's Algo) | Hard | 181 | No |
| Graphs | Alien Dictionary | Hard | 182 | No |
| Graphs | Minimum Cost Path | Hard | 182 | No |
| Graphs | Articulation Point - I | Hard | 183 | No |
| Graphs | Word Ladder I | Hard | 183 | No |
| Graphs | Largest Sum Cycle | Hard | 184 | No |
| Graphs | Shortest Path Using Atmost One Curved Edge | Hard | 184 | No |
| Graphs | Word Ladder II | Hard | 185 | No |
| Graphs | Assignment Problem | Hard | 185 | No |
| Graphs | Articulation Point - II | Hard | 186 | No |
| Graphs | Critical Connections | Hard | 186 | No |
| Graphs | Find number of closed islands | Hard | 187 | No |
| Dynamic Programming | Print first n Fibonacci Numbers | Easy | 188 | No |
| Dynamic Programming | Count numbers containing 4 | Easy | 188 | No |
| Dynamic Programming | Nth Fibonacci Number | Easy | 188 | No |
| Dynamic Programming | Stock buy and sell | Easy | 188 | No |
| Dynamic Programming | Count number of hops | Easy | 189 | No |
| Dynamic Programming | Coin ChangeProblem | Medium | 189 | No |
| Dynamic Programming | Number of Coins | Medium | 189 | No |
| Dynamic Programming | 0-1 Knapsack | Medium | 190 | No |
| Dynamic Programming | Tushar's Birthday Party | Medium | 190 | No |
| Dynamic Programming | Matrix Chain Multiplication | Medium | 190 | No |
| Dynamic Programming | Program for nth Catalan Number | Medium | 191 | No |
| Dynamic Programming | Kadane's Algorithm | Medium | 191 | No |
| Dynamic Programming | Longest Common Subsequence | Medium | 191 | No |
| Dynamic Programming | Longest Increasing Subsequence | Medium | 192 | No |
| Dynamic Programming | Longest Common Substring | Medium | 192 | No |
| Dynamic Programming | Longest Repeating Subsequence | Medium | 192 | No |
| Dynamic Programming | Longest Palindromic Subsequence | Medium | 193 | No |
| Dynamic Programming | Longest Arithmetic Progression | Medium | 193 | No |
| Dynamic Programming | Longest Bitonic subsequence | Medium | 193 | No |
| Dynamic Programming | Longest Common Increasing Subsequence | Medium | 194 | No |
| Dynamic Programming | Subset Sum Problem | Medium | 194 | No |
| Dynamic Programming | Count Palindromic Subsequences | Medium | 194 | No |
| Dynamic Programming | Longest Palindrome in a String | Medium | 195 | No |
| Dynamic Programming | Egg Dropping Puzzle | Medium | 195 | No |
| Dynamic Programming | Floyd Warshall | Medium | 195 | No |
| Dynamic Programming | Word Break | Medium | 196 | No |
| Dynamic Programming | Palindrome Partitioning II | Medium | 196 | No |
| Dynamic Programming | Shortest Common Supersequence | Medium | 196 | No |
| Dynamic Programming | LCS of three strings | Medium | 197 | No |
| Dynamic Programming | Box Stacking | Medium | 197 | No |
| Dynamic Programming | Count of Subarrays | Medium | 197 | No |
| Dynamic Programming | Longest alternating subsequence | Medium | 198 | No |
| Dynamic Programming | Count Cyclic Paths | Medium | 198 | No |
| Dynamic Programming | Ways to sum to N | Medium | 198 | No |
| Dynamic Programming | Maximum Sum Subsequence of length k | Medium | 199 | No |
| Dynamic Programming | Find length of longest subsequence | Medium | 199 | No |
| Dynamic Programming | Number of palindromic strings | Medium | 199 | No |
| Dynamic Programming | Palindromic Strings | Medium | 200 | No |
| Dynamic Programming | Trapping Rain Water | Medium | 200 | No |
| Dynamic Programming | Maximum Product Subarray | Medium | 200 | No |
| Dynamic Programming | nCr | Medium | 201 | No |
| Dynamic Programming | Maximize The Cut Segments | Medium | 201 | No |
| Dynamic Programming | Edit Distance | Medium | 201 | No |
| Dynamic Programming | Partition Equal Subset Sum | Medium | 202 | No |
| Dynamic Programming | Count ways to reach the n'th stair | Medium | 202 | No |
| Dynamic Programming | Stickler Thief | Medium | 202 | No |
| Dynamic Programming | Job Sequencing Problem | Medium | 203 | No |
| Dynamic Programming | Perfect Sum Problem | Medium | 203 | No |
| Dynamic Programming | Maximum sum increasing subsequence | Medium | 203 | No |
| Dynamic Programming | Max length chain | Medium | 204 | No |
| Dynamic Programming | Maximum path sum in matrix | Medium | 204 | No |
| Dynamic Programming | Regular Expression Match | Medium | 204 | No |
| Dynamic Programming | Smallest sequence with given Primes | Medium | 205 | No |
| Dynamic Programming | Wildcard Pattern Matching | Medium | 205 | No |
| Dynamic Programming | Tiling With Dominoes | Medium | 205 | No |
| Dynamic Programming | Paint House! | Medium | 206 | No |
| Dynamic Programming | Intersecting Chords in a Circle | Medium | 206 | No |
| Dynamic Programming | N digit numbers with digit sum S | Medium | 206 | No |
| Dynamic Programming | Kth Manhattan Distance Neighbourhood | Medium | 207 | No |
| Dynamic Programming | Best Time to Buy and Sell Stock atmost B times | Medium | 207 | No |
| Dynamic Programming | Best Time to Buy and Sell Stocks III | Medium | 207 | No |
| Dynamic Programming | Longest valid Parentheses | Medium | 208 | No |
| Dynamic Programming | Rod Cutting | Medium | 208 | No |
| Dynamic Programming | Max Rectangle in Binary Matrix | Medium | 208 | No |
| Dynamic Programming | Maximum Size Square Sub-matrix | Medium | 209 | No |
| Dynamic Programming | Maximum Path in Triangle | Medium | 209 | No |
| Dynamic Programming | Min Sum Path in Matrix | Medium | 209 | No |
| Dynamic Programming | Coin Sum Infinite | Medium | 210 | No |
| Dynamic Programming | Arrange II | Medium | 210 | No |
| Dynamic Programming | Interleaved Strings | Medium | 210 | No |
| Dynamic Programming | Consecutive 1's not allowed | Medium | 211 | No |
| Dynamic Programming | Unique BST's | Medium | 211 | No |
| Dynamic Programming | Minimum number of Coins | Medium | 211 | No |
| Dynamic Programming | Maximum Tip Calculator | Medium | 212 | No |
| Dynamic Programming | Snake and Ladder Problem | Medium | 212 | No |
| Dynamic Programming | Special Keyboard | Medium | 212 | No |
| Dynamic Programming | Minimum cost to fill given weight in a bag | Medium | 213 | No |
| Dynamic Programming | Count ways to N'th Stair(Order does not matter) | Medium | 213 | No |
| Dynamic Programming | Distinct occurrences | Medium | 213 | No |
| Dynamic Programming | Count subsequences of type a^i, b^j, c^k | Medium | 214 | No |
| Dynamic Programming | Special Matrix | Medium | 214 | No |
| Dynamic Programming | Number of ways | Medium | 214 | No |
| Dynamic Programming | Distinct Coloring | Medium | 215 | No |
| Dynamic Programming | Shortest XY distance in Grid | Medium | 215 | No |
| Dynamic Programming | Water Overflow | Medium | 215 | No |
| Dynamic Programming | Count possible ways to construct buildings | Medium | 216 | No |
| Dynamic Programming | Number of paths in a matrix with k coins | Medium | 216 | No |
| Dynamic Programming | Buy and Sell a Share at most twice | Medium | 216 | No |
| Dynamic Programming | Minimum steps to destination | Medium | 217 | No |
| Dynamic Programming | Player with max score | Medium | 217 | No |
| Dynamic Programming | Cutting Binary String | Medium | 217 | No |
| Dynamic Programming | Two water Jug problem | Medium | 218 | No |
| Dynamic Programming | Min cut Square | Medium | 218 | No |
| Dynamic Programming | Maximum sum of elements not part of LIS | Medium | 218 | No |
| Dynamic Programming | Count of AP Subsequences | Medium | 219 | No |
| Dynamic Programming | Pascal's Triangle | Medium | 219 | No |
| Dynamic Programming | Pascal's Triangle II | Medium | 219 | No |
| Dynamic Programming | Best Time to Buy and Sell Stock IV | Medium | 220 | No |
| Dynamic Programming | House Robber | Medium | 220 | No |
| Dynamic Programming | House Robber II | Medium | 220 | No |
| Dynamic Programming | Last Stone Weight II | Medium | 221 | No |
| Dynamic Programming | Predict the Winner | Medium | 221 | No |
| Dynamic Programming | Palindromic Partitioning | Hard | 221 | No |
| Dynamic Programming | Minimum sum partition | Hard | 222 | No |
| Dynamic Programming | Smallest window in a string containing all the characters of another string | Hard | 222 | No |
| Dynamic Programming | The Painter's Partition Problem-II | Hard | 223 | No |
| Dynamic Programming | Word Wrap | Hard | 223 | No |
| Dynamic Programming | Partition array to K subsets | Hard | 224 | No |
| Dynamic Programming | Word Break - Part 2 | Hard | 224 | No |
| Dynamic Programming | Maximum Profit | Hard | 225 | No |
| Dynamic Programming | Maximum Number of coins | Hard | 225 | No |
| Dynamic Programming | Minimum Points To Reach Destination | Hard | 226 | No |
| Dynamic Programming | Count occurrences of a given word in a 2-d array | Hard | 227 | No |
| Dynamic Programming | Print all LCS sequences | Hard | 227 | No |
| Dynamic Programming | Find all possible palindromic partitions of a String | Hard | 228 | No |
| Dynamic Programming | Strictly Increasing Array | Hard | 228 | No |
| Dynamic Programming | Brackets in Matrix Chain Multiplication | Hard | 229 | No |
| Dynamic Programming | Longest Zig-Zag Sub Sequence | Hard | 229 | No |
| Dynamic Programming | Longest Increasing Path in a Matrix | Hard | 230 | No |
| Dynamic Programming | Burst Balloons | Hard | 230 | No |
| Dynamic Programming | Russian Doll Envelopes | Hard | 231 | No |
| Dynamic Programming | Number of Ways to Stay in the | Hard | 231 | No |
| Dynamic Programming | Maximum Sum BST in Binary | Hard | 232 | No |
| Segment Tree | XOR of a given range | Easy | 233 | No |
| Segment Tree | Maximum prefix sum for a given range | Easy | 233 | No |
| Segment Tree | Range Minimum Query | Medium | 233 | No |
| Segment Tree | Nitika and her queries | Medium | 233 | No |
| Segment Tree | Smallest Subarray GCD | Medium | 234 | No |
| Segment Tree | Element left after performing alternate OR & XOR operation | Medium | 234 | No |
| Segment Tree | Array Partition | Hard | 234 | No |
| Segment Tree | Akku and Arrays | Hard | 235 | No |
| Segment Tree | Greater or Less | Hard | 235 | No |
| Trie | Unique rows in boolean matrix | Easy | 236 | No |
| Trie | Trie | (Insert and Search) | Medium | 236 |
| Trie | Word Boggle | Medium | 236 | No |
| Trie | Most frequent word in an array of strings | Medium | 236 | No |
| Trie | Maximum XOR subarray | Medium | 237 | No |
| Trie | CamelCase Pattern Matching | Medium | 237 | No |
| Trie | Trie | (Delete) | Medium | 237 |
| Trie | Word Boggle - II | Medium | 238 | No |
| Trie | Prefix match with other strings | Medium | 238 | No |
| Trie | Phone directory | Hard | 238 | No |
| Trie | Palindrome Pairs | Hard | 239 | No |
| Trie | Shortest Unique prefix for every word | Hard | 239 | No |
| Trie | Word Break (Trie) | Hard | 240 | No |
| Trie | Find duplicate rows in a binary matrix | Hard | 240 | No |
| Fenwick Tree | Range Sum Query - Mutable | Medium | 241 | No |
| Fenwick Tree | Count Number of Teams | Medium | 241 | No |
| Fenwick Tree | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard | 242 | No |
| Fenwick Tree | Count Increasing Quadruplets | Hard | 242 | No |