# Status Problem video Level Completes Likes 559 Minimizing Taxis for Maximum Efficiency Hard % 1 525 Find the number of pairs with odd XOR Beginner % 2 499 Compare two version numbers of a software Medium % 1 473 Given an array, count the number of pairs with a given sum. Beginner % 0 471 Two Sum Problem Beginner % 0 459 Given an array, find three-element sum closest to Zero Medium % 1 451 Find the sum of overlapping elements in two sets Beginner % 0 425 Check if the given binary tree is Full or not Beginner % 1 422 Print Stack in reverse order Beginner % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 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 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 369 Find duplicates Characters in the given String Beginner % 0 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 365 Convert Infix to Postfix Expression Medium % 0 Minimizing Taxis for Maximum Efficiency Find the number of pairs with odd XOR Compare two version numbers of a software Given an array, count the number of pairs with a given sum. Two Sum Problem Given an array, find three-element sum closest to Zero Find the sum of overlapping elements in two sets Check if the given binary tree is Full or not Print Stack in reverse order Evaluation of Prefix Expressions (Polish Notation) | Set 1 Find the maximum number present in a String Convert Prefix to Postfix Expression Convert Roman Number to Integer Convert Postfix to Prefix Expression Convert Postfix to Infix Expression String to Integer (AtoI - ASCII to Integer) Longest substring with at most two unique characters Find duplicates Characters in the given String Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression 1 2 3 4
