# Status Problem video Level Completes Likes 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 239 Find local minimum or local maximum in O(1) Medium % 0 235 Majority Element- Boyer–Moore majority vote algorithm Medium % 0 233 Find the local minima in a given array Medium % 0 223 Stock Single Sell Problem - Dynamic Programming - O(n) Medium % 2 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 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 213 Find the last 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 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 Find two non-repeating numbers in an array in O(n) time and O(1) space Find local minimum or local maximum in O(1) Majority Element- Boyer–Moore majority vote algorithm Find the local minima in a given array Stock Single Sell Problem - Dynamic Programming - O(n) 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 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 the last 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 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 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
