# Status Problem video Level Completes Likes 385 String to Integer (AtoI - ASCII to Integer) - Recursive Solution Medium % 0 384 Grouping of Anagrams Medium % 0 383 Print Processes and its messages from a given log file Medium % 0 379 Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2 Medium % 0 377 Convert Postfix to Infix Expression Medium % 0 373 Longest substring with at most two unique characters Medium % 0 372 Monotone Increasing Digits - Leetcode Medium % 1 371 Convert Infix to Prefix Expression Medium % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 354 Valid Multiple Parentheses Medium % 1 343 Generate all the strings of length n from 0 to k-1 Medium % 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 319 Get the Sum of Digits in a number till it become a single digit Medium % 0 317 Check if given number is Prime - O(√N) Solution Medium % 0 307 Swap two numbers using Bitwise XOR Operator Medium % 1 305 Find number of Distinct Permutations of a String Medium % 0 296 Replace all vowels with next consonant in a given string Medium % 0 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 1 2 3 4 5 6 7 8 9 10 11 12
