Problems # Status Problem Level Completes Likes 421 Goldbach's Conjecture Beginner % 0 422 Print All the Subsets of a Given Set (Power Set) Hard % 0 423 Convert Decimal into Irreducible Fraction Beginner % 0 424 Clock Angle Problem Beginner % 1 425 Print All Combinations of subset of size K from Given Array Hard % 0 426 Track the Maximum Element in a Stack. Medium % 0 427 Print All Possible Valid Combinations Of Parenthesis of Given 'N' Hard % 0 428 Graph Representation - Adjacency Matrix and Adjacency List Beginner % 1 429 Counting Sort Medium % 0 430 Towers Of Hanoi Beginner % 0 431 Generate All Strings of n bits. Medium % 0 432 Find The Missing Duplicate in a Given Array. Beginner % 0 433 Sort 3 Integers without using if condition OR use only Max() function. Beginner % 0 434 Euclidean algorithm - Greatest Common Divisor(GCD) Beginner % 0 435 Implement Queue Using Stacks Medium % 0 436 Alternate Splitting of a given Linked List Medium % 0 437 Reverse The Doubly Linked List Medium % 0 438 Swap Kth Node from the front with the Kth Node from the End Medium % 0 439 Print the Bottom View of the Binary Tree. Medium % 0 440 Delete X Nodes After Y Nodes In a Linked List Beginner % 0 441 Merge Sort in a Linked list Medium % 0 442 Merge a Linked list into another Linked List at Alternate Positions. Medium % 0 443 AVL Tree - Insertion Hard % 0 444 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 445 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 446 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 447 Print The Top View of a Binary Tree Medium % 0 448 Construct a Binary Tree from Given Inorder and Depth-First-Search. Hard % 0 449 Depth First Search/Traversal in Binary Tree Beginner % 0 450 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 451 Check if Array Contains All Elements Of Some Given Range Medium % 0 452 Check if Array is Consecutive Integers Beginner % 0 453 Find the subarray with sum to a Given Value. Medium % 0 454 In an Array, find the Smallest Subarray with Sum Greater than the Given Value Medium % 0 455 Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space Hard % 0 Goldbach's Conjecture Print All the Subsets of a Given Set (Power Set) Convert Decimal into Irreducible Fraction Clock Angle Problem Print All Combinations of subset of size K from Given Array Track the Maximum Element in a Stack. Print All Possible Valid Combinations Of Parenthesis of Given 'N' Graph Representation - Adjacency Matrix and Adjacency List Counting Sort Towers Of Hanoi Generate All Strings of n bits. Find The Missing Duplicate in a Given Array. Sort 3 Integers without using if condition OR use only Max() function. Euclidean algorithm - Greatest Common Divisor(GCD) Implement Queue Using Stacks Alternate Splitting of a given Linked List Reverse The Doubly Linked List Swap Kth Node from the front with the Kth Node from the End Print the Bottom View of the Binary Tree. Delete X Nodes After Y Nodes In a Linked List Merge Sort in a Linked list Merge a Linked list into another Linked List at Alternate Positions. AVL Tree - Insertion Construct a binary tree from given Inorder and Level Order Traversal Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion Print The Top View of a Binary Tree Construct a Binary Tree from Given Inorder and Depth-First-Search. Depth First Search/Traversal in Binary Tree Inorder Predecessor and Successor in Binary Search Tree Check if Array Contains All Elements Of Some Given Range Check if Array is Consecutive Integers Find the subarray with sum to a Given Value. In an Array, find the Smallest Subarray with Sum Greater than the Given Value Rearrange Positive and Negative Elements at Alternate Positions in an Array In O(1) Extra Space 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
