Problems # Status Problem Level Completes Likes 36 Given an array, print all unique subsets with a given sum. Medium % 0 37 Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K. Medium % 0 38 Replace array elements with maximum element on the right. Medium % 0 39 Find all unique combinations of numbers (from 1 to 9 ) with sum to N Medium % 0 40 Activity Selection Problem Medium % 0 41 Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Medium % 0 42 Check If Given Undirected Graph is a tree Medium % 0 43 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 44 Determine the given routing number belong to which bank Medium % 0 45 Check if interval is covered in given coordinates Medium % 0 46 Lexicographically previous permutation With One swap Medium % 0 47 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 48 Check the completeness of given binary tree | Set 1 - Using Node Count Medium % 0 49 Longest substring with at most K unique characters Medium % 1 50 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 51 Number of Islands using BFS Medium % 0 52 Given Graph - Remove a vertex and all edges connect to the vertex Medium % 0 53 Number's Complement - 2 Approaches Medium % 0 54 Print all subsets of an array with a sum equal to zero Medium % 0 55 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 56 Breadth-First Search in Disconnected Graph Medium % 0 57 ZigZag OR Diagonal traversal in 2d array/Matrix using queue Medium % 0 58 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 59 Minimum Boats Required to rescue people Medium % 0 60 Number of Islands Medium % 0 61 Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Medium % 0 62 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2 Medium % 0 63 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 Medium % 0 64 Check if Arithmetic Expression contains duplicate parenthesis Medium % 0 65 Introduction to Bipartite Graphs OR Bigraphs Medium % 1 66 Determine the order of Tests when tests have dependencies on each other Medium % 0 67 Implement Graph Using Map - Java Medium % 0 68 Check if given an edge is a bridge in the graph Medium % 0 69 Convert Prefix to Postfix Expression Medium % 0 70 Sort a given stack - Using Temporary Stack Medium % 0 Given an array, print all unique subsets with a given sum. Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K. Replace array elements with maximum element on the right. Find all unique combinations of numbers (from 1 to 9 ) with sum to N Activity Selection Problem Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Check If Given Undirected Graph is a tree Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Determine the given routing number belong to which bank Check if interval is covered in given coordinates Lexicographically previous permutation With One swap Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Check the completeness of given binary tree | Set 1 - Using Node Count Longest substring with at most K unique characters Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Number of Islands using BFS Given Graph - Remove a vertex and all edges connect to the vertex Number's Complement - 2 Approaches Print all subsets of an array with a sum equal to zero Evaluation of Prefix Expressions (Polish Notation) | Set 2 Breadth-First Search in Disconnected Graph ZigZag OR Diagonal traversal in 2d array/Matrix using queue Evaluation of Prefix Expressions (Polish Notation) | Set 1 Minimum Boats Required to rescue people Number of Islands Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2 Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1 Check if Arithmetic Expression contains duplicate parenthesis Introduction to Bipartite Graphs OR Bigraphs Determine the order of Tests when tests have dependencies on each other Implement Graph Using Map - Java Check if given an edge is a bridge in the graph Convert Prefix to Postfix Expression Sort a given stack - Using Temporary Stack 1 2 3 4 5 6 7