- Fibonacci Using Recursion
- Doubly linked list Insertion
- Preorder Traversal
- Linked List Insertion
- Implement Queue using array
- Implement stack using array
- Implement Stack using Linked List
- Minimum element in BST
- Identical Linked Lists
- Postorder Traversal
- Insert in Middle of Linked List
- Count Non-Leaf Nodes in Tree
- Height of Binary Tree
- Operations on Stack
- Absolute Value
- Count nodes of linked list
- Count Leaves in Binary Tree
- Sum of Digits of a Number
- Size of Binary Tree
- Convert Celsius To Fahrenheit
- Inorder Traversal

Name

tfv2

Rank in Institute

#288

Courses Attended

Campus Ambassador

Overall Coding Score: 199

Monthly Coding Score: 22

Weekly Coding Score: 0

- Removing consecutive duplicates - 2
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Level order traversal Line by Line
- Print BST elements in given range
- Digital Root
- Check if Linked List is Palindrome
- Level order traversal
- Count Total Digits in a Number
- Evaluation of Postfix Expression
- Find length of Loop
- Reverse First K elements of Queue
- Sum of Leaf Nodes
- ZigZag Tree Traversal
- Removing consecutive duplicates
- Delete middle element of a stack
- Get min at pop
- Pairwise swap of nodes in LinkeList
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Print adjacency list
- Factorial Of Number
- Mirror Tree
- Queue using two Stacks
- Sum Tree
- Merge two sorted linked lists
- Reverse a linked list
- Nth node from end of linked list
- Check for Balanced Tree
- Diameter of Binary Tree
- Maximum Width of Tree
- Left View of Binary Tree
- K distance from root
- Right View of Binary Tree
- Remove duplicates from an unsorted linked list
- Detect Loop in linked list
- Add two numbers represented by linked lists
- Given a linked list of 0s, 1s and 2s, sort it.
- Rotate a Linked List
- Root to leaf path sum
- Stack using two queues
- Level order traversal in spiral form
- Determine if Two Trees are Identical
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Remove duplicate element from sorted Linked List

- Detect cycle in an undirected graph
- Delete without head pointer
- Check for BST
- Count BST nodes that lie in a given range
- Parenthesis Checker
- Make Binary Tree From Linked List
- Stock span problem
- Topological sort
- Maximum difference between node and its ancestor
- Remove loop in Linked List
- Detect cycle in a directed graph
- Find the Closest Element in BST
- Intersection Point in Y Shapped Linked Lists
- Implementing Ceil in BST
- Implementing Floor in BST
- Swap Kth nodes from ends
- Foldable Binary Tree
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Unique BST's
- Steps by Knight