- Inorder Traversal
- Postorder Traversal
- Minimum element in BST
- Height of Binary Tree
- Sum of Binary Tree
- Size of Binary Tree
- Preorder Traversal
- Count Leaves in Binary Tree
- Count Non-Leaf Nodes in Tree
- Average Count Array
- Fibonacci to N
- Sum of numbers in string
- Sort in specific order
- Sum of dependencies in a graph
- Searching an element in a sorted array
- Searching a number
- Number of occurrence
- Permutations of a given string

Name

Anubhav Raj Singh

Institute

Galgotias University

Courses Attended

Overall Coding Score: 263

Monthly Coding Score: 0

Weekly Coding Score: 0

- Check if Linked List is Palindrome
- Max Level Sum in Binary Tree
- Root to leaf paths sum
- Level order traversal
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Expression Tree
- Sum of leaf nodes in BST
- Root to Leaf Paths
- Maximum path sum
- Max and min element in Binary Tree
- Leaf at same level
- Full binary tree
- Symmetric Tree
- Vertical sum
- Check if Tree is Isomorphic
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Remove Half Nodes
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Deletion in a Binary Tree
- Nodes at Odd Levels
- Sum of the Longest Bloodline of a Tree (Sum of nodes on the longest path from root to leaf node)
- Check if two Nodes are Cousins
- Print all nodes that don't have sibling
- Delete Middle of Linked List
- Left View of Binary Tree
- Sum Tree
- Check for Balanced Tree
- Diameter of Binary Tree
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Determine if Two Trees are Identical
- Root to leaf path sum
- Level order traversal Line by Line
- Maximum Width of Tree
- Two Mirror Trees
- Mirror Tree
- K distance from root
- Right View of Binary Tree
- Odd even level difference
- Move all zeroes to end of array
- Number of Unique Paths
- Maximum number of zeroes
- Count Substrings
- Minimum Operations
- Find Nth root of M
- Maximum no of 1's row
- Finding Position
- Reach a given score
- Three Great Candidates

- Bottom View of Binary Tree
- K-Sum Paths
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Check for BST
- Count BST nodes that lie in a given range
- Count ways to N'th Stair(Order does not matter)
- Topological sort
- Serialize and Deserialize a Binary Tree
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Find the number of islands
- Bipartite Graph
- Number of root to leaf paths
- Find the Closest Element in BST
- Delete keys in a Linked list
- Add all greater values to every node in a BST
- Top View of Binary Tree
- Detect cycle in an undirected graph
- Detect cycle in a directed graph
- Construct expression tree
- Check if subtree
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Find whether path exist
- Shortest Source to Destination Path
- Unit Area of largest region of 1's
- Snake and Ladder Problem
- Hamiltonian Path
- Count of Subarrays
- Maximum Intervals Overlap
- Array Pair Sum Divisibility Problem
- M-Coloring Problem