- Minimum element in BST
- Height of Binary Tree
- Linked List Length Even or Odd?
- Finding middle element in a linked list
- Delete Alternate Nodes
- Identical Linked Lists
- Find triplets with zero sum
- Postorder Traversal
- Count Leaves in Binary Tree
- Inorder Traversal
- Count zeros in a sorted matrix
- Sum of Binary Tree
- Node at a given index in linked list
- Count nodes of linked list
- Preorder Traversal
- How Many X's?
- Total number of Strings
- Check set bits
- Area of a triangle
- Sum of numbers in string
- Pairs with given XOR
- Repetitive Addition Of Digits
- Rotate Array
- Missing number in array
- Permutations of a given string

Name

Institute

NA

Overall Coding Score: 257

Monthly Coding Score: 239

Weekly Coding Score: 0

- Ancestors in Binary Tree
- Max Level Sum in Binary Tree
- Convert Ternary Expression to Binary Tree
- Reverse a linked list
- Check if Linked List is Palindrome
- Leaf at same level
- Level of a Node in Binary Tree
- Root to Leaf Paths
- Perfect Binary Tree
- Full binary tree
- Construct Tree from Inorder & Preorder
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Maximum Node Level
- Diagonal Sum In Binary Tree
- Height of Spiral Tree
- Check if two Nodes are Cousins
- Add two numbers represented by linked lists
- Mirror Tree
- Maximum Width of Tree
- K distance from root
- Merge two sorted linked lists
- Merge Sort
- Detect Loop in linked list
- Sum Tree
- Remove duplicate element from sorted Linked List
- Determine if Two Trees are Identical
- Root to leaf path sum
- Lowest Common Ancestor in a BST
- Odd even level difference
- Rotate a Linked List
- Key Pair
- Count of strings that can be formed using a, b and c under given constraints
- Count Occurences of Anagrams
- Reverse words in a given string
- Sort an array of 0s, 1s and 2s
- Paths to reach origin
- Count distinct pairs with difference k
- Equilibrium point
- Count pairs with given sum
- Leaders in an array
- Subarray with given sum
- Reverse Bits
- Maximum sum increasing subsequence

- Reverse a Linked List in groups of given size.
- Leaves to DLL
- Construct tree from Inorder and LevelOrder
- Construct Tree from Preorder Traversal
- Construct a Full Binary Tree
- Check if subtree
- Tree from Postorder and Inorder
- Delete without head pointer
- Add all greater values to every node in a BST
- Binary Tree to CDLL
- Construct Binary Tree from Parent Array
- Remove loop in Linked List
- Make Binary Tree From Linked List
- Clone a Binary Tree
- Extreme nodes in alternate order
- Kth smallest element
- Is Binary Number Multiple of 3
- Inversion of array
- Parenthesis Checker
- Longest Increasing Subsequence
- Row with minimum number of 1's
- Kadane's Algorithm