# Status Problem video Level Completes Likes 260 Deque Implementation – Java Beginner % 0 250 Nuts & Bolts Problem (Lock & Key problem) Beginner % 0 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 237 Find three elements in an array that sum to a zero 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 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 220 Find the right most unset bit OR zero bit of a number Beginner % 1 218 Find the right most set bit of a number Beginner % 1 214 Find the last non repeating character in a given string. Beginner % 0 Deque Implementation – Java Nuts & Bolts Problem (Lock & Key problem) 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 zero 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 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 Find the right most unset bit OR zero bit of a number Find the right most set bit of a number Find the last non repeating character in a given string. 1 2 3 4 5 6 7 8 9 10 11 12
