Problems # Status Problem Level Completes Likes 1 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 2 Maximum difference between two elements where larger element appears after the smaller element Medium % 0 3 Find the two repeating elements in a given array | 6 Approaches Medium % 1 4 Find two elements whose sum is closest to zero Medium % 0 5 Find the last non repeating character in a given string. Beginner % 0 6 Find the last repeating character in a given string. Beginner % 0 7 Find the first repeating character in a given string Beginner % 0 8 Find longest Snake sequence in a given matrix Medium % 0 9 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 0 10 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 0 11 Reverse the given Array without using built in function Beginner % 0 12 Print All Diagonals of a given matrix Medium % 0 13 Dynamic Programming - Edit Distance Problem Hard % 1 14 Dynamic Programming - Coin In a Line Game Problem Hard % 0 15 Dynamic Programming - Box Stacking Problem Hard % 0 16 Dynamic Programming - Split the String into Minimum number of Palindromes. Hard % 0 17 Dynamic Programming - Highway Billboard Problem Hard % 0 18 Dynamic Programming - Maximum Subarray Problem Medium % 0 19 Kadane's Algorithm - Maximum Subarray Problem Medium % 0 20 Convert Binary Tree into Threaded Binary Tree Hard % 0 21 Double Threaded Binary Tree Complete Implementation Hard % 0 22 Single Threaded Binary Tree Complete Implementation Hard % 0 23 Introduction to Threaded Binary Tree Medium % 0 24 Implement Stack Using Linked List Beginner % 0 25 Doubly Linked List Complete Implementation Beginner % 0 26 Circular Linked List Complete Implementation Beginner % 0 27 Swap Nodes in pairs in a Linked List by changing links Medium % 0 28 Convert BST to Greater Sum Tree Medium % 0 29 Shortest Range in K-sorted Lists Hard % 1 30 Reverse Alternative 'k' nodes in a Linked List. Medium % 0 31 Reverse a Linked List in groups of given size 'K' Medium % 0 32 Generate Maximum revenue by selling K tickets from N windows Medium % 0 33 Get the Sum of all left leaves in a Binary tree Beginner % 0 34 Convert binary tree to its Sum tree Medium % 1 35 Binary Tree-Postorder Traversal - Non Recursive Approach Beginner % 0 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer 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 last non repeating character in a given string. Find the last repeating character in a given string. Find the first repeating character in a given string 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 Reverse the given Array without using built in function Print All Diagonals of a given matrix Dynamic Programming - Edit Distance Problem Dynamic Programming - Coin In a Line Game Problem Dynamic Programming - Box Stacking Problem Dynamic Programming - Split the String into Minimum number of Palindromes. Dynamic Programming - Highway Billboard Problem Dynamic Programming - Maximum Subarray Problem Kadane's Algorithm - Maximum Subarray Problem Convert Binary Tree into Threaded Binary Tree Double Threaded Binary Tree Complete Implementation Single Threaded Binary Tree Complete Implementation Introduction to Threaded Binary Tree Implement Stack Using Linked List Doubly Linked List Complete Implementation Circular Linked List Complete Implementation Swap Nodes in pairs in a Linked List by changing links Convert BST to Greater Sum Tree Shortest Range in K-sorted Lists 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 Get the Sum of all left leaves in a Binary tree Convert binary tree to its Sum tree Binary Tree-Postorder Traversal - Non Recursive Approach 1 2
