Name

Institute

dav hehal

Overall Coding Score: 708

Monthly Coding Score: 190

Weekly Coding Score: 0

- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Count Leaves in Binary Tree
- Selection Sort
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Implement Queue using Linked List
- Implement Queue using array
- Find triplets with zero sum
- Operating an array
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Queue Reversal
- Sum of Binary Tree
- Count Non-Leaf Nodes in Tree
- Repetitive Addition Of Digits
- Searching a number
- Sort The Array
- Nth Fibonacci Number
- Dice throw
- Missing number in array
- Immediate Smaller Element
- Sum of distinct elements
- Number of occurrence
- k largest elements
- Minimum difference pair
- Sum of Digits Divisibility
- Ways To Tile A Floor
- Middle of Three
- Maximum Possible Sum of Products
- Searching an element in a sorted array
- Form a Triangle
- Sort in specific order
- Find the element that appears once in sorted array
- Find the smallest and second smallest element in an array
- Minimum Difference among K
- Stable Sort and Position

- Occurence of an integer in a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Sorted insert for circular linked list
- Reverse a Doubly Linked List
- Insertion Sort
- Merge Sort
- Quick Sort
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Sum Tree
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- Reverse Level Order Traversal
- Reverse alternate levels of a perfect binary tree
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Root to leaf path sum
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Level order traversal Line by Line
- Print BST elements in given range
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- K-Palindrome
- Leaf at same level
- Expression Tree
- Check if Linked List is Palindrome
- Delete a Node in Single Linked List
- Kth largest element in BST
- Minimum four sum subsequence
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Longest consecutive sequence in Binary tree
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Inorder Successor in BST
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Maximum path sum
- Max and min element in Binary Tree
- Perfect Binary Tree
- Linked List that is Sorted Alternatingly
- Full binary tree
- Triplet with 0 sum in BST
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Vertical sum
- Check if Tree is Isomorphic
- Predecessor and Successor
- Find length of Loop
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Brothers From Different Roots
- Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node)
- Exchange the Leaf Nodes
- Check if two Nodes are Cousins
- Sum of Leaf Nodes at Min Level
- Wave Array
- Search in a Rotated Array
- First Repeating Element
- Count Occurences of Anagrams
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Finding Number
- Segregate even and odd nodes in a Linked List
- Count distinct pairs with difference k
- Maximum sum increasing subsequence
- Array to BST
- Max Sum without Adjacents
- Length Unsorted Subarray
- Adjacents are not allowed
- Count number of hops
- Inorder Traversal and BST
- Three Great Candidates
- Reach a given score
- Minimum element in a sorted and rotated array
- 0 - 1 Knapsack Problem
- Skip the work
- Maximize The Cut Segments
- Floor in a Sorted Array
- Maximize Dot Product
- Pairs with specific difference
- Min Subsets with Consecutive Numbers
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Sum of k smallest elements in BST
- Pair with greatest product in array
- Friends Pairing Problem
- Gold Mine Problem
- Sum of all substrings of a number
- Palindromic patitioning
- Temple Offerings
- Evaluation of Postfix Expression
- Common elements
- Efficiently sorting numbers in range from 0 to n^2 - 1
- Element with left side smaller and right side greater
- Sequence of Sequence
- Array Subset of another array
- Paths to reach origin
- Get Minimum Squares
- Nth catalan number
- Find Pair Given Difference
- Count all possible paths from top left to bottom right
- Minimum Deletions
- Shortest Common Supersequence
- Sort the given array after applying the given equation
- Painting the Fence
- Sort by Absolute Difference
- Minimum insertions to sort an array
- Minimum number of deletions and insertions.
- Minimum number of deletions to make a sorted sequence
- Minimum steps to minimize n as per given condition
- Longest alternating subsequence
- Ways to sum to N
- Bitonic Generator Sort
- Count of strings that can be formed using a, b and c under given constraints
- Size of array after repeated deletion of LIS
- Find length of longest subsequence
- Find all distinct subset (or subsequence) sums
- Longest subsequence-1
- Sum of average of all subsets
- Maximum sum Problem
- Find number of times a string occurs as a subsequence
- Minimum Cost To Make Two Strings Identical
- High-effort vs. Low-effort
- Longest Repeating Subsequence

- Count BST nodes that lie in a given range
- Check for BST
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Delete a node from BST
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Circular tour
- Make Binary Tree From Linked List
- Kth element in Matrix
- Max length chain
- Largest BST
- Box Stacking
- Number of root to leaf paths
- Find the Closest Element in BST
- Merge two BST 's
- k-th smallest element in BST
- Binary Tree to CDLL
- Find a pair with given target in BST
- Populate Inorder Successor for all nodes
- Construct expression tree
- K-Sum Paths
- Construct tree from Inorder and LevelOrder
- Leaves to DLL
- Right Sibling in Binary Tree
- Duplicate Subtrees
- Construct a Full Binary Tree
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Egg Dropping Puzzle
- Edit Distance
- nCr
- Consecutive 1's not allowed
- Longest Even Length Substring
- Path in Matrix
- Subset Sum Problem
- Number of Coins
- Longest Palindrome in a String
- Relative Sorting
- Largest square formed in a matrix
- Sorting Elements of an Array by Frequency
- Number of ways
- Form a palindrome
- Preorder to Postorder
- Length of the longest substring
- Stock span problem
- Convert an array to reduced form
- Handshakes
- Number of pairs
- Minimum sum
- Special Matrix
- Next larger element
- Taking 1 out of 3 consecutives
- Total Decoding Messages
- Kth smallest element
- Longest Common Substring
- Infix to Postfix
- Longest Bitonic subsequence
- Maximum Intervals Overlap
- Minimum Time
- Word Wrap
- Perfect Sum Problem
- LCS of three strings
- Minimum cost to fill given weight in a bag
- Count even length
- Maximum bitonic subarray sum
- Optimal Strategy For A Game