# Status Problem Level Completes Likes 36 Find all the numbers in the range which has prime set bits. Beginner % 0 37 Check if Arithmetic Expression contains duplicate parenthesis Medium % 0 38 Determine the order of Tests when tests have dependencies on each other Medium % 0 39 Find the maximum number present in a String Beginner % 0 40 Convert Prefix to Postfix Expression Medium % 0 41 Convert Roman Number to Integer Beginner % 0 42 Convert Postfix to Prefix Expression Medium % 0 43 String to Integer (AtoI - ASCII to Integer) - Recursive Solution Medium % 0 44 Grouping of Anagrams Medium % 0 45 Print Processes and its messages from a given log file Medium % 0 46 Longest contiguous character in a given String - O(N) Solution Beginner % 0 47 Convert Postfix to Infix Expression Medium % 0 48 String to Integer (AtoI - ASCII to Integer) Beginner % 1 49 Longest substring with at most two unique characters Medium % 0 50 Monotone Increasing Digits Medium % 1 51 Convert Infix to Prefix Expression Medium % 0 52 Find duplicates Characters in the given String Beginner % 0 53 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 54 Sum of all Unique elements in a given array Beginner % 0 55 Convert Infix to Postfix Expression Medium % 0 56 Find three smallest elements in a given array Beginner % 0 57 Evaluation of Infix expressions Medium % 0 58 Convert Prefix to Infix Expression Medium % 0 59 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Hard % 0 60 Merge K sorted Linked List - Using Priority Queue Hard % 0 61 Count Set bits in a given Number Beginner % 1 62 Check if array contains all unique or distinct numbers. Beginner % 0 63 Product of all Unique elements in a given array. Beginner % 0 64 Valid Multiple Parentheses Medium % 1 65 Check if given number is perfect square - O(√N) Solution Beginner % 0 66 Find first three largest elements in a given array Beginner % 0 67 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Hard % 0 68 Valid Brackets – Part 2 | Stack Method Beginner % 0 69 Find two smallest elements in a given array Beginner % 0 70 Find Number of reverse pairs in an array Hard % 1 Find all the numbers in the range which has prime set bits. Check if Arithmetic Expression contains duplicate parenthesis Determine the order of Tests when tests have dependencies on each other Find the maximum number present in a String Convert Prefix to Postfix Expression Convert Roman Number to Integer Convert Postfix to Prefix Expression String to Integer (AtoI - ASCII to Integer) - Recursive Solution Grouping of Anagrams Print Processes and its messages from a given log file Longest contiguous character in a given String - O(N) Solution Convert Postfix to Infix Expression String to Integer (AtoI - ASCII to Integer) Longest substring with at most two unique characters Monotone Increasing Digits Convert Infix to Prefix Expression Find duplicates Characters in the given String Max Flow Problem - Ford-Fulkerson Algorithm Sum of all Unique elements in a given array Convert Infix to Postfix Expression Find three smallest elements in a given array Evaluation of Infix expressions Convert Prefix to Infix Expression Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Merge K sorted Linked List - Using Priority Queue Count Set bits in a given Number Check if array contains all unique or distinct numbers. 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 Find the nearest building which has bike | Find nearest specific vertex from source in a graph. Valid Brackets – Part 2 | Stack Method Find two smallest elements in a given array Find Number of reverse pairs in an array 1 2 3 4
