Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 236 Find three elements in an array that sum to a given value Beginner % 1 235 Majority Element- Boyer–Moore majority vote algorithm Medium % 0 234 Majority Element – Part 1 Beginner % 0 233 Find the local minima in a given array Medium % 0 232 Check whether the given number is a perfect square Beginner % 0 231 Check if array is sorted using recursion Beginner % 0 230 Find the Index from which 0 starts Beginner % 0 229 Find the increasing OR decreasing point in an array Beginner % 0 228 Find the only element in array which appears only once Beginner % 1 227 Algorithm to calculate power(k,n). Beginner % 1 226 Find remainder without using modulo operator Beginner % 0 225 Swap two numbers without using extra variable Beginner % 0 224 Number of 1’s in bit representation of a number Beginner % 1 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 220 Find the right most unset bit OR zero bit of a number Beginner % 1 219 Find the two repeating elements in a given array | 6 Approaches Medium % 1 218 Find the right most set bit of a number Beginner % 1 217 Find two elements whose sum is closest to zero Medium % 1 Find three elements in an array that sum to a given value Majority Element- Boyer–Moore majority vote algorithm Majority Element – Part 1 Find the local minima in a given array Check whether the given number is a perfect square Check if array is sorted using recursion Find the Index from which 0 starts Find the increasing OR decreasing point in an array Find the only element in array which appears only once Algorithm to calculate power(k,n). Find remainder without using modulo operator Swap two numbers without using extra variable Number of 1’s in bit representation of a number 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 right most unset bit OR zero bit of a number Find the two repeating elements in a given array | 6 Approaches Find the right most set bit of a number Find two elements whose sum is closest to zero 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
