# Status Problem Level Completes Likes 71 Convert Prefix to Postfix Expression Medium % 0 72 Sort a given stack - Using Temporary Stack Medium % 0 73 Convert Postfix to Prefix Expression Medium % 0 74 Convert Integer to Roman Medium % 0 75 String to Integer (AtoI - ASCII to Integer) - Recursive Solution Medium % 0 76 Grouping of Anagrams Medium % 0 77 Print Processes and its messages from a given log file Medium % 0 78 Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Medium % 0 79 Convert Postfix to Infix Expression Medium % 0 80 Longest substring with at most two unique characters Medium % 0 81 Monotone Increasing Digits Medium % 1 82 Convert Infix to Prefix Expression Medium % 0 83 Convert Infix to Postfix Expression Medium % 0 84 Evaluation of Infix expressions Medium % 0 85 Convert Prefix to Infix Expression Medium % 0 86 Valid Multiple Parentheses Medium % 1 87 Generate all the strings of length n from 0 to k-1. Medium % 0 88 Heap Sort – Java Implementation Medium % 0 89 Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium % 1 90 Get the Sum of Digits in a number till it become a single digit Medium % 0 91 Check if given number is Prime - O(√N) Solution – Java Program Medium % 0 92 Swap two numbers using Bitwise XOR Operator Medium % 1 93 Find number of Distinct Permutations of a String Medium % 0 94 Replace all vowels with next consonant in a given string Medium % 0 95 Introduction to Minimum Spanning Tree (MST) Medium % 0 96 Graph – Count all paths between source and destination Medium % 1 97 Graph – Find Number of non reachable vertices from a given vertex Medium % 0 98 Graph – Detect Cycle in an Undirected Graph using DFS Medium % 0 99 Graph – Detect Cycle in a Directed Graph Medium % 1 100 Graph – Software Installation Problem Medium % 0 101 Graph – Depth First Search in Disconnected Graph Medium % 1 102 Topological Sort Medium % 1 103 Minimum Copy Paste Operations Medium % 0 104 Print all sub sequences of a given String Medium % 0 105 Graph – Print all paths between source and destination Medium % 1 Convert Prefix to Postfix Expression Sort a given stack - Using Temporary Stack Convert Postfix to Prefix Expression Convert Integer to Roman String to Integer (AtoI - ASCII to Integer) - Recursive Solution Grouping of Anagrams Print Processes and its messages from a given log file Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Convert Postfix to Infix Expression Longest substring with at most two unique characters Monotone Increasing Digits Convert Infix to Prefix Expression Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Valid Multiple Parentheses Generate all the strings of length n from 0 to k-1. Heap Sort – Java Implementation 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 – Java Program Swap two numbers using Bitwise XOR Operator Find number of Distinct Permutations of a String Replace all vowels with next consonant in a given string Introduction to Minimum Spanning Tree (MST) Graph – Count all paths between source and destination Graph – Find Number of non reachable vertices from a given vertex Graph – Detect Cycle in an Undirected Graph using DFS Graph – Detect Cycle in a Directed Graph Graph – Software Installation Problem Graph – Depth First Search in Disconnected Graph Topological Sort Minimum Copy Paste Operations Print all sub sequences of a given String Graph – Print all paths between source and destination 1 2 3 4 5 6 7
