# Status Problem video Level Completes Likes 362 Stack Java Class - Explained Beginner % 0 356 Check if array contains all unique or distinct numbers Beginner % 0 355 Product of all Unique elements in a given array Beginner % 0 350 Find first three largest elements in a given array Beginner % 0 342 Find two smallest elements in a given array Beginner % 0 341 Front and Back Search in an 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 333 Sum the elements of an Array Beginner % 0 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 324 Stack Data Structure – Introduction and Implementation Beginner % 0 321 Bubble Sort and Optimized Bubble Sort Beginner % 1 311 Linear Search Algorithm Beginner % 0 300 Find the Largest Gap Between Elements in an Array Beginner % 0 271 Snake and Ladder Problem Hard % 1 262 Count and print all Subarrays with product less than K in O(n) Hard % 0 261 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 Stack Java Class - Explained Check if array contains all unique or distinct numbers Product of all Unique elements in a given array Find first three largest elements in a given array Find two smallest elements in a given array Front and Back Search in an 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 Sum the elements of an Array 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) Stack Data Structure – Introduction and Implementation Bubble Sort and Optimized Bubble Sort Linear Search Algorithm Find the Largest Gap Between Elements in an Array Snake and Ladder Problem Count and print all Subarrays with product less than K in O(n) Sliding Window Algorithm (Track the maximum of each subarray of size k) 1 2 3 4 5 6 7 8 9 10 11
