# Status Problem video Level Completes Likes 405 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 Medium 0.00 % 0 402 Check if Arithmetic Expression contains duplicate parenthesis Medium 0.00 % 0 401 Introduction to Bipartite Graphs OR Bigraphs Medium 0.00 % 0 396 Optimizing Test Execution: Managing Test Dependencies for Sequential Order Medium 0.17 % 0 395 Implement Graph Using Map or dictionary Medium 0.17 % 0 391 Check if given an edge is a bridge in the graph Medium 0.17 % 0 390 Convert Prefix to Postfix Expression Medium 0.00 % 0 388 Sort a given stack - Using Temporary Stack Medium 0.17 % 0 387 Convert Postfix to Prefix Expression Medium 0.00 % 0 386 Convert Integer to Roman Medium 0.17 % 0 385 String to Integer (AtoI - ASCII to Integer) - Recursive Solution Medium 0.17 % 0 384 Grouping of Anagrams Medium 0.17 % 0 383 Print Processes and its messages from a given log file Medium 0.00 % 0 379 Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Medium 0.00 % 0 377 Convert Postfix to Infix Expression Medium 0.17 % 0 373 Longest substring with at most two unique characters Medium 0.17 % 0 372 Monotone Increasing Digits - Leetcode Medium 0.00 % 1 371 Convert Infix to Prefix Expression Medium 0.17 % 0 365 Convert Infix to Postfix Expression Medium 0.17 % 0 363 Evaluation of Infix expressions Medium 0.17 % 0 361 Convert Prefix to Infix Expression Medium 0.00 % 0 354 Valid Multiple Parentheses Medium 0.68 % 1 343 Generate all the strings of length n from 0 to k-1 Medium 0.00 % 0 328 Heap Sort Medium 0.00 % 0 325 Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium 0.34 % 1 319 Get the Sum of Digits in a number till it become a single digit Medium 0.00 % 0 317 Check if given number is Prime - O(√N) Solution Medium 0.00 % 0 307 Swap two numbers using Bitwise XOR Operator Medium 0.34 % 1 305 Find number of Distinct Permutations of a String Medium 0.17 % 0 296 Replace all vowels with next consonant in a given string Medium 0.00 % 0 286 Introduction to Minimum Spanning Tree (MST) Medium 0.00 % 0 277 Graph – Count all paths between source and destination Medium 0.17 % 1 276 Graph – Find Number of non reachable vertices from a given vertex Medium 0.17 % 0 274 Graph – Detect Cycle in an Undirected Graph using DFS Medium 0.17 % 0 273 Graph – Detect Cycle in a Directed Graph Medium 0.34 % 1 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 Check if Arithmetic Expression contains duplicate parenthesis Introduction to Bipartite Graphs OR Bigraphs Optimizing Test Execution: Managing Test Dependencies for Sequential Order Implement Graph Using Map or dictionary Check if given an edge is a bridge in the graph 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 - Leetcode 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 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 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 1 2 3 4 5 6 7
