# Status Problem video Level Completes Likes 359 Merge K sorted Linked List - Using Priority Queue Hard % 0 357 Count Set bits in a given Number Beginner % 1 355 Product of all Unique elements in a given array Beginner % 0 354 Valid Multiple Parentheses Medium % 1 352 Check if given number is perfect square - O(√N) Solution Beginner % 0 350 Find first three largest elements in a given array Beginner % 0 346 Valid Brackets – Part 2 | Stack Method Beginner % 0 342 Find two smallest elements in a given array Beginner % 0 340 Print all Unique elements in a given array Beginner % 0 338 Find Number of reverse pairs in an array Hard % 1 337 Find first two largest elements in a given array Beginner % 0 336 Calculate Logn base r – Java Implementation Beginner % 0 334 Dijkstra Algorithm Implementation – TreeSet Hard % 0 330 Check if Given Number is power of 2 Beginner % 1 329 Rotate the given array in cycles Beginner % 0 328 Heap Sort Medium % 0 325 Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium % 1 319 Get the Sum of Digits in a number till it become a single digit Medium % 0 317 Check if given number is Prime - O(√N) Solution Medium % 0 302 Fizz Buzz Challenge Beginner % 0 Merge K sorted Linked List - Using Priority Queue Count Set bits in a given Number Product of all Unique elements in a given array Valid Multiple Parentheses Check if given number is perfect square - O(√N) Solution Find first three largest elements in a given array Valid Brackets – Part 2 | Stack Method Find two smallest elements in a given array Print all Unique elements in a given array Find Number of reverse pairs in an array Find first two largest elements in a given array Calculate Logn base r – Java Implementation Dijkstra Algorithm Implementation – TreeSet Check if Given Number is power of 2 Rotate the given array in cycles Heap Sort Find no of reverse pairs in an array which is sorted in two parts in O(N) Get the Sum of Digits in a number till it become a single digit Check if given number is Prime - O(√N) Solution Fizz Buzz Challenge 1 2 3 4 5 6 7
