# Status Problem video Level Completes Likes 463 Combinations with sum K from a given number N with repetition Medium % 0 460 Construct the largest number from the given array Medium % 0 459 Given an array, find three-element sum closest to Zero Medium % 1 457 Given an array, print all unique subsets with a given sum. Medium % 0 456 Subsets Elements less than K. Medium % 0 455 Replace array elements with maximum element on the right. Medium % 0 454 Find all unique combinations of numbers (from 1 to 9 ) with sum to N Medium % 0 452 Activity Selection Problem Medium % 0 448 Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm Medium % 0 447 Check If Given Undirected Graph is a tree Medium % 0 443 Check the completeness of given binary tree | Set 2 - Using Level Order Traversal Medium % 0 439 Determine the given routing number belong to which bank Medium % 0 438 Check if interval is covered in given coordinates Medium % 0 437 Lexicographically previous permutation With One swap Medium % 1 436 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 431 Check the completeness of given binary tree | Set 1 - Using Node Count Medium % 0 430 Longest substring with at most K unique characters Medium % 2 428 Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1. Medium % 0 427 Number of Islands using BFS Medium % 0 423 Given Graph - Remove a vertex and all edges connect to the vertex Medium % 0 Combinations with sum K from a given number N with repetition Construct the largest number from the given array Given an array, find three-element sum closest to Zero Given an array, print all unique subsets with a given sum. Subsets Elements less than 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 1 2 3 4 5 6 7 8 9 10 11 12
