# Status Problem video Level Completes Likes 223 Stock Single Sell Problem - Dynamic Programming - O(n) Medium % 2 221 Identifying Maximum Gain from Sequential Elements Medium % 0 219 Find the two repeating elements in a given array | 6 Approaches Medium % 1 217 Find two elements whose sum is closest to zero Medium % 1 216 Find the element which appears maximum number of times in the array Medium % 0 215 Find duplicates in an given array in O(n) time and O(1) space Medium % 0 209 Find longest Snake sequence in a given matrix Medium % 1 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 207 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 205 Print All Diagonals of a given matrix Medium % 1 199 Dynamic Programming - Maximum Subarray Problem Medium % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 194 Introduction to Threaded Binary Tree Medium % 0 190 Swap Nodes in pairs in a Linked List by changing links Medium % 0 189 Convert BST to Greater Sum Tree Medium % 0 187 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 186 Reverse a Linked List in groups of given size 'K' Medium % 0 185 Generate Maximum revenue by selling K tickets from N windows Medium % 0 183 Convert binary tree to its Sum tree Medium % 1 174 Dynamic Programming - Maximum Product Cutting Problem Medium % 1 Stock Single Sell Problem - Dynamic Programming - O(n) Identifying Maximum Gain from Sequential Elements 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) 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 1 2 3 4 5 6 7 8 9 10 11 12
