# Status Problem video Level Completes Likes 317 Check if given number is Prime - O(√N) Solution Medium % 0 305 Find number of Distinct Permutations of a String Medium % 0 302 Fizz Buzz Challenge Beginner % 0 273 Graph – Detect Cycle in a Directed Graph Medium % 1 272 Graph – Software Installation Problem Medium % 0 261 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 256 Print all sub sequences of a given array Hard % 0 248 Remove Duplicates from a string | 4 Approaches Medium % 0 246 Dynamic programming – Minimum Jumps to reach to end Hard % 0 242 Find the Bit Flips Needed: Convert One Binary Number to Another Beginner % 1 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 235 Majority Element- Boyer–Moore majority vote algorithm Medium % 0 234 Majority Element – Part 1 Beginner % 0 230 Find the Index from which 0 starts Beginner % 0 228 Find the only element in array which appears only once Beginner % 1 227 Algorithm to calculate power(k,n). Beginner % 1 222 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 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 Check if given number is Prime - O(√N) Solution Find number of Distinct Permutations of a String Fizz Buzz Challenge Graph – Detect Cycle in a Directed Graph Graph – Software Installation Problem Sliding Window Algorithm (Track the maximum of each subarray of size k) Print all sub sequences of a given array Remove Duplicates from a string | 4 Approaches Dynamic programming – Minimum Jumps to reach to end Find the Bit Flips Needed: Convert One Binary Number to Another Separate 0’s and 1’s in a given array 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 Index from which 0 starts Find the only element in array which appears only once Algorithm to calculate power(k,n). Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Find the two repeating elements in a given array | 6 Approaches Find two elements whose sum is closest to zero 1 2 3 4 5 6 7 8
