Name

Ravi Maurya

Rank in Institute

#313

Overall Coding Score: 178

Monthly Coding Score: 43

Weekly Coding Score: 0

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

- Number of Unique Paths
- Equal Sum and Product
- Sort an array of 0s, 1s and 2s
- Subarray with given sum
- Leaders in an array
- Least Prime Factor
- Min sum formed by digits
- Find sum of divisors
- Minimum Operations
- Count all possible paths from top left to bottom right
- 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
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Sum Tree
- Remove duplicate element from sorted Linked List
- Reverse Level Order Traversal
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Level order traversal Line by Line
- Odd even level difference
- Leaf at same level
- Check if Linked List is Palindrome
- 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
- Root to Leaf Paths
- Maximum path sum
- Check if Tree is Isomorphic
- Median of BST
- Sum of Leaf Nodes
- ZigZag Tree Traversal
- Maximum Area Rectangle

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