Count Balanced Binary Trees of Height h
Count Distinct Subsequences
Count Number of Increasing SubSequence
Count Number of Subsets having Given XOR Value
Count Number of Ways to Reach A Given Score in A Game
Count Number of Ways to jump to Reach End
Count Ways to Build Street Under Given Constraints
Count Ways to Reach the Nth Stair Using Step 1, 2 or 3
Count all subsequences having product less than K
Count of Different Ways to Express N As The Sum of 1, 3 And 4
Calculate Depth of A Full Binary Tree From Preorder
Check If All Leaves are At Same Level
Check If Binary Tree Has Duplicate Values
Check If Two Trees are Identical or Not
Check Whether A Binary Tree is Complete Or Not
Check Whether A Given Binary Tree is Perfect or Not
Check if Given Binary Tree is Sum Tree Or Not
Check if Tree is Symmetry or Not
Check if Two Trees are Mirror
Check if binary tree is BST or NOT
Construct A Tree From Inorder and Level Order
Construct Tree From Given Inorder and Preorder
Convert A Tree To Sum Tree
Convert Binary Tree to Doubly Linked List
Diagonal Sum of A Binary Tree
Diagonal Traversal of Binary Tree
Find All Root to Leaf Paths
Find Distance Between Two Nodes
Find The Maximum Sum In A Path From Leaf To Root
Left , Right and Boundary View
Level Order Traversal in Spiral Form
Maximum Value in A Binary Tree
Minimum Value in A Binary Tree
Nth Node in Inorder Traversal
Number of Binary Trees for Given Preorder Sequence Length
Print Ancestors of A Given Node
Print Level Traversal in Sorted Order
Print Postorder Traversal From Given Inorder And Preorder Traversals
Reverse Level Order Traversal
Sum of All the Parent Node Having Child N
Sum of Heights of All Individual Nodes
Sum of Leaf Nodes At Minimum Level
Vertical Order Of Binary Tree
Vertical Sum In Binary Tree
Find Bitonic Point in Given Bitonic Sequence
Find Closest Number in Array
Find Maximum Possible Stolen Value From Houses
Find a Fixed Point in a Given Array
Find the Element that appears once in a Sorted Array
Fractional Knapsack Problem
Highway Billboard Problem
Jacobsthal and Jacobsthal-Lucas numbers
K-th Element of Two Sorted Arrays
Largest Sum Contiguous Subarray
Longest Arithmetic Progression
Longest Bitonic Subsequence
Longest Common Increasing Subsequence
Longest Common Subsequence
Longest Geometric Progression
Longest Increasing Subsequence
Longest Palindromic Subsequence
Longest Repeated Subsequence
Longest Substring Without Repeating Characters
Matrix Chain Multiplication
Maximize the sum of index by muliplying the element at the index
Maximum Length Chain of Pairs
Maximum Product Subset of an Array
Maximum Size Subset with Given Sum
Maximum Subset Sum With No Repeating Digits
Maximum Sum Increasing Subsequence
Maximum games played by winner
Maximum length subsequence
Maximum path sum in a triangle
Maximum product of an increasing subsequence
Maximum size square sub-matrix with all 1s
Maximum sum of pairs with specific difference
Median of Two Sorted Arrays of Same Size
Minimum Cost to Fill Given Weight in A Bag
Minimum Insertions to Form a Palindrome
Minimum Insertions to Sort An Array
Minimum Number of Jumps to Reach ( M , N ) From ( 1 , 1 )
Minimum Number of Jumps to Reach End
Minimum Product Subset of an Array
Minimum Sum of Absolute Difference of Pairs of Two Arrays
Minimum Sum of Multiplications of N Numbers
Minimum Sum of Product of Two Arrays
Newman-Shanks-Williams prime
Number of N Digit(s) Stepping Numbers
Optimal Strategy for a Game
Power Set in Lexicographic order
Remove Invalid Parentheses
Rotation Count in Rotated Sorted Array
Size of The Subarray With Maximum Sum
Smallest Sum Contiguous Subarray
Split A Number into Maximum Composite Number
String Matching Algorithms
Sum of All Substrings of A String Representing A Number
Sum of Average of All Subsets
The Knight’s Tour Problem
Wildcard Pattern Matching
Folders and files Name Name Last commit message
Last commit date
parent directory
View all files
You can’t perform that action at this time.