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