Name

RAVI MAURYA

Rank in Institute

#348

Overall Coding Score: 181

Monthly Coding Score: 0

Weekly Coding Score: 0

- Minimum element in BST
- Postorder Traversal
- Finding middle element in a linked list
- Preorder Traversal
- Count nodes of linked list
- Node at a given index in linked list
- Sum of Binary Tree
- Height of Binary Tree
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Power of 2
- Reverse array in groups
- Rotate Array
- Missing number in array
- Number of paths

- Odd even level difference
- Check if Linked List is Palindrome
- Level order traversal Line by Line
- Lowest Common Ancestor in a BST
- Determine if Two Trees are Identical
- Reverse Level Order Traversal
- Remove duplicate element from sorted Linked List
- Leaf at same level
- Median of BST
- Nth node from end of linked list
- Maximum path sum
- Root to Leaf Paths
- Level order traversal
- Intersection of Two Linked Lists
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- K distance from root
- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- BigInteger Multiply
- Right View of Binary Tree
- Sum of Leaf Nodes
- Mirror Tree
- Maximum Width of Tree
- Maximum Area Rectangle
- ZigZag Tree Traversal
- Diameter of Binary Tree
- Left View of Binary Tree
- Sum Tree
- Count all possible paths from top left to bottom right
- Minimum Operations
- Find sum of divisors
- Min sum formed by digits
- Least Prime Factor
- Leaders in an array
- Subarray with given sum
- Sort an array of 0s, 1s and 2s
- Equal Sum and Product
- Number of Unique Paths

- Count Number of SubTrees having given Sum
- Count ways to N'th Stair(Order does not matter)
- k-th smallest element in BST
- Top View of Binary Tree
- Remove loop in Linked List
- Boundary Traversal of binary tree
- Diagonal Traversal of Binary Tree
- Intersection Point in Y Shapped Linked Lists
- Delete without head pointer
- Bottom View of Binary Tree
- Check for BST
- Reverse a Linked List in groups of given size.
- Maximum of all subarrays of size k
- Print Diagonally
- Trie | (Insert and Search)
- First non-repeating character in a stream
- Sum Of Prime
- Kadane's Algorithm