# Status Problem video Level Completes Likes 222 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 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 214 Find the last non repeating character in a given string. Beginner % 0 213 Find the last repeating character in a given string Beginner % 0 211 Find the first repeating character in a given string Beginner % 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 206 Reverse the given Array without using built in function Beginner % 0 205 Print All Diagonals of a given matrix Medium % 1 204 Dynamic Programming - Edit Distance Problem Hard % 2 203 Dynamic Programming - Coin In a Line Game Problem Hard % 0 202 Dynamic Programming - Box Stacking Problem Hard % 0 201 Dynamic Programming - Split the String into Minimum number of Palindromes. Hard % 0 200 Dynamic Programming - Highway Billboard Problem Hard % 0 199 Dynamic Programming - Maximum Subarray Problem Medium % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 197 Convert Binary Tree into Threaded Binary Tree Hard % 0 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer 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 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 1 2 3
