# Status Problem Level Completes Likes 106 Graph – Depth First Traversal Medium % 2 107 Print all substrings of a given string Medium % 0 108 Print all subarrays of a given array Medium % 0 109 Divide and Conquer - Rearrange array elements in special order Medium % 0 110 Remove Duplicates from a string Medium % 0 111 Find median of two sorted arrays of same size Medium % 0 112 Find local minimum or local maximum in O(1). Medium % 0 113 Majority Element- Boyer–Moore majority vote algorithm Medium % 0 114 Find the local minima in a given array Medium % 0 115 Maximum difference between two elements where larger element appears after the smaller element Medium % 0 116 Find the two repeating elements in a given array | 6 Approaches Medium % 1 117 Find two elements whose sum is closest to zero Medium % 1 118 Find the element which appears maximum number of times in the array. Medium % 0 119 Find duplicates in an given array in O(n) time and O(1) extra space. Medium % 0 120 Find longest Snake sequence in a given matrix Medium % 1 121 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 122 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 123 Print All Diagonals of a given matrix Medium % 1 124 Dynamic Programming - Maximum Subarray Problem Medium % 0 125 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 126 Introduction to Threaded Binary Tree Medium % 0 127 Swap Nodes in pairs in a Linked List by changing links Medium % 0 128 Convert BST to Greater Sum Tree Medium % 0 129 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 130 Reverse a Linked List in groups of given size 'K' Medium % 0 131 Generate Maximum revenue by selling K tickets from N windows Medium % 0 132 Convert binary tree to its Sum tree Medium % 1 133 Dynamic Programming - Maximum Product Cutting Problem. Medium % 1 134 Dynamic Programming - Longest Common Substring Medium % 0 135 Dynamic Programming - Longest Common Subsequence Medium % 0 136 Dynamic Programming - Rod Cutting Problem Medium % 1 137 Dynamic Programming - Coin Change Problem Medium % 1 138 Dynamic Programming - Minimum Cost Path Problem Medium % 1 139 Generate Well Ordered Passwords of a Given Length K Medium % 0 140 All N Length Strings from Given String of Length K Medium % 0 Graph – Depth First Traversal Print all substrings of a given string Print all subarrays of a given array Divide and Conquer - Rearrange array elements in special order Remove Duplicates from a string Find median of two sorted arrays of same size Find local minimum or local maximum in O(1). Majority Element- Boyer–Moore majority vote algorithm Find the local minima in a given array Maximum difference between two elements where larger element appears after the smaller element Find the two repeating elements in a given array | 6 Approaches Find two elements whose sum is closest to zero Find the element which appears maximum number of times in the array. Find duplicates in an given array in O(n) time and O(1) extra space. Find longest Snake sequence in a given matrix Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Print All Diagonals of a given matrix Dynamic Programming - Maximum Subarray Problem Kadane's Algorithm - Maximum Subarray Problem Introduction to Threaded Binary Tree Swap Nodes in pairs in a Linked List by changing links Convert BST to Greater Sum Tree Reverse Alternative 'k' nodes in a Linked List. Reverse a Linked List in groups of given size 'K' Generate Maximum revenue by selling K tickets from N windows Convert binary tree to its Sum tree Dynamic Programming - Maximum Product Cutting Problem. Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Dynamic Programming - Rod Cutting Problem Dynamic Programming - Coin Change Problem Dynamic Programming - Minimum Cost Path Problem Generate Well Ordered Passwords of a Given Length K All N Length Strings from Given String of Length K 1 2 3 4 5 6 7
