# Status Problem video Level Completes Likes 299 Minimum number of guesses needed to find a number Beginner % 0 296 Replace all vowels with next consonant in a given string Medium % 0 293 Convert Number to base 3 String Representation Beginner % 1 257 Graph – Depth First Traversal Medium % 2 242 Find the Bit Flips Needed: Convert One Binary Number to Another Beginner % 1 241 Separate even and odd integers in a given array Beginner % 0 238 Separate 0’s and 1’s in a given array Beginner % 0 236 Find three elements in an array that sum to a given value Beginner % 1 234 Majority Element – Part 1 Beginner % 0 232 Check whether the given number is a perfect square 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 225 Swap two numbers without using extra variable Beginner % 0 224 Number of 1’s in bit representation of a number Beginner % 1 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 Minimum number of guesses needed to find a number Replace all vowels with next consonant in a given string Convert Number to base 3 String Representation Graph – Depth First Traversal Find the Bit Flips Needed: Convert One Binary Number to Another Separate even and odd integers in a given array Separate 0’s and 1’s in a given array Find three elements in an array that sum to a given value Majority Element – Part 1 Check whether the given number is a perfect square 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). Swap two numbers without using extra variable Number of 1’s in bit representation of a number 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
