- Count nodes of linked list
- Node at a given index in linked list
- Delete node in Doubly Linked List
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Height of Binary Tree
- Postorder Traversal
- Implement stack using array
- Implement Queue using array
- Doubly linked list Insertion at given position
- Remove duplicate elements from sorted Array
- Preorder Traversal
- Search a node in BST
- Find Number of Numbers
- Linked List Insertion
- Play with an array
- Minimum element in BST
- Identical Linked Lists
- Maximum in Struct Array
- Insert in Middle of Linked List
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Absolute Value
- Convert Celsius To Fahrenheit
- Quadratic Equation Roots
- Binary To Gray Code equivalent
- Gray to Binary equivalent
- Power of 2
- Tower Of Hanoi
- Reverse array in groups
- Rotate Array
- Adding two matrices
- k largest elements
- Sum of Digits of a Number
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Find minimum and maximum element in an array
- Rotate Array
- Multiply left and right array sum.
- First Come First Serve
- Ishaan Loves Chocolates
- Check set bits

Name

Gaurav Mantan

Institution

Rank in Institute

#13

Courses Attended

Overall Coding Score: 602

Monthly Coding Score: 2

Weekly Coding Score: 0

- Reverse a linked list
- Rotate 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
- Insertion Sort
- Quick Sort
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Level order traversal in spiral form
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Binary Heap Operations
- Level order traversal Line by Line
- Print BST elements in given range
- Josephus problem
- Check if Linked List is Palindrome
- Max distance between same elements
- Delete a Node in Single Linked List
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Children Sum Parent
- Find length of Loop
- Vertical Width of a Binary Tree
- Need Some Change
- Matrix Interchange
- Matrix Interchange - Java
- ArrayList Operation
- Max and Second Max
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Mother Vertex
- Find first set bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Exactly 3 Divisors
- Mean And Median of Array
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Maximum AND Value
- Minimum adjacent difference in a circular array
- Maximum occured integer
- Wave Array
- Frequencies of Limited Range Array Elements
- Equilibrium point
- Leaders in an array
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Inversion of array
- Two Repeated Elements
- Roof Top
- Union of Two Sorted Arrays
- Subarray with given sum
- Intersection of two sorted arrays
- Print adjacency list
- Naive Pattern Search
- Count Total Digits in a Number
- Digital Root
- Count pairs with given sum
- Largest Fibonacci Subsequence
- Min sum formed by digits
- Count Pairs in an Array
- Adding Ones
- Count the Zeros
- Pairs which are Divisible by 4
- Addition of submatrix
- Remove all duplicates from a given string
- Maximize Toys

- Count BST nodes that lie in a given range
- Check for BST
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Merge K sorted linked lists
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- LRU Cache
- Minimum Swaps to Sort
- Max sum subarray by removing at most one element
- Find the Closest Element in BST
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Count More than n/k Occurences
- Foldable Binary Tree
- Node at distance
- Maximum path sum from any node
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Maximum sum of Non-adjacent nodes
- Implementing Floor in BST
- Implementing Ceil in BST
- Pair Sum in BST
- Smallest Positive missing number
- Possible Words From Phone Digits
- Number of pairs
- Merge three sorted arrays
- Closer to sort
- Possible paths between 2 vertices
- Level of Nodes
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Stock span problem
- Next larger element
- Infix to Postfix
- Maximum of all subarrays of size k
- Kth largest element
- Kth smallest element
- Kth largest element in a stream
- K Most occurring elements
- Minimum Cost of ropes
- Nearly sorted
- Rearrange characters
- Job Sequencing Problem
- Minimum Platforms
- Count ways to N'th Stair(Order does not matter)
- Longest Increasing Subsequence
- Steps by Knight
- Minimum number of jumps
- Rotten Oranges
- Count only Repeated
- Smaller on Right
- Nearly Sorted Algorithm
- Find whether path exist
- Kth smallest element
- Unique BST's
- X Total Shapes
- Convert an array to reduced form
- Preorder to Postorder
- Row with max 1s
- Parenthesis Checker