# Status Problem video Level Completes Likes 394 Find the maximum number present in a String Beginner % 0 390 Convert Prefix to Postfix Expression Medium % 0 389 Convert Roman Number to Integer Beginner % 0 387 Convert Postfix to Prefix Expression Medium % 0 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 378 Longest contiguous character in a given String - O(N) Solution Beginner % 0 377 Convert Postfix to Infix Expression Medium % 0 375 String to Integer (AtoI - ASCII to Integer) Beginner % 1 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 369 Find duplicates Characters in the given String Beginner % 0 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 367 Sum of all Unique elements in a given array Beginner % 0 365 Convert Infix to Postfix Expression Medium % 0 364 Find three smallest elements in a given array Beginner % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 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 - Leetcode 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 1 2 3 4 5 6 7 8
