- LCM And GCD
- Sort The Array
- Nth Fibonacci Number
- Shortest path from 1 to n
- Remove Spaces
- Swap kth elements
- Intersection of two arrays
- Union of two arrays
- k largest elements
- Generate Binary Numbers
- Smallest number
- Rotate by 90 degree
- Maximize sum after K negations
- Minimize the sum of product
- Make a Distinct Digit Array
- Drive the car
- Does array represent Heap
- Swap and Maximize
- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Delete node in Doubly Linked List
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Merge Sort
- Mirror Tree
- Height of Binary Tree
- Heap Sort
- Finding middle element in a linked list
- Sum Tree
- Postorder Traversal
- Insert a node in Doubly linked list
- Preorder Traversal
- Count distinct elements in every window
- Find triplets with zero sum
- Level order traversal
- Linked List Insertion
- Insert in a Sorted List
- Ancestors in Binary Tree
- Root to Leaf Paths
- Circular Linked List Traversal
- Delete Alternate Nodes
- Identical Linked Lists
- Merge Lists Alternatingly
- Sum of Leaf Nodes

Name

Institution

Coding Score

546

Subjective Score

0

Problems Solved

227

Total Submissions

589

Overall Rank: 605

Monthly Rank: 6

Weekly Rank: 126

- a^b(Set 2)
- GCD of Array
- First Repeating Element
- Spirally traversing a matrix
- Number of Coins
- Number of paths in a matrix with k coins
- Jumping Numbers
- Segregate even and odd nodes in a Linked List
- N meetings in one room
- Maximum of all subarrays of size k
- Row with max 1s
- Array to BST
- Key Pair
- Inversion of array
- Subarray with given sum
- Stock span problem
- Count pairs with given sum
- Cutting Rectangles
- Search in a matrix
- Valid Substring
- Number that are not divisible
- Power of Numbers
- Next larger element
- Repeating GCD
- Magic numbers
- Number Game
- Min sum formed by digits
- Flood fill Algorithm
- Zero Sum Subarrays
- Fractional Knapsack
- Transitive closure of a Graph
- Array Subset of another array
- Subarray with 0 sum
- Subarray range with given sum
- Sum equals to Sum
- Sorted matrix
- Find pairs with given relation
- Sum of length
- Rotten Oranges
- Longest Repeating Subsequence
- GCD, LCM and Distributive Property
- Reverse a linked list
- Occurence of an integer in a Linked List
- Delete N nodes after M nodes of a linked list
- Rotate a Linked List
- Pairwise swap elements of a linked list by swapping data
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Rearrange a linked list
- Add 1 to a number represented as linked list
- linked list of strings forms a palindrome
- Compare two linked lists
- Linked List in Zig-Zag fashion
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Sorted insert for circular linked list
- Split a Circular Linked List into two halves
- Reverse a Doubly Linked List
- Insertion Sort
- Right View of Binary Tree
- K distance from root
- Maximum Width of Tree
- Delete without head pointer
- Diameter of Binary Tree
- Check for Balanced Tree
- n'th node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Decimal Equivalent of Binary Linked List
- Intersection of two sorted Linked lists
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Reverse Level Order Traversal
- Boundary Traversal of binary tree
- Reverse alternate levels of a perfect binary tree
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Root to leaf path sum
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Print BST elements in given range
- The Celebrity Problem
- Largest subarray with 0 sum
- Print a Binary Tree in Vertical Order
- Minimum Depth of a Binary Tree
- Odd even level difference
- Binary Tree to BST
- Unique rows in boolean matrix
- Serialize and Deserialize a Binary Tree
- Leaf at same level
- Check if Linked List is Palindrome
- Delete a Node in Single Linked List
- Kth largest element in BST
- Root to leaf paths sum
- Merge Sort for Linked List
- Split Singly Linked List Alternatingly
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Maximum path sum
- Max and min element in Binary Tree
- Linked List that is Sorted Alternatingly
- Triplet with 0 sum in BST
- Vertical sum
- Check if Tree is Isomorphic
- Predecessor and Successor
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes

- Coin Change
- Kadane's Algorithm
- Print Diagonally
- Longest Increasing Subsequence
- Longest Common Subsequence
- nCr
- Maximum Rectangular Area in a Histogram
- Path in Matrix
- Minimum Platforms
- Largest square formed in a matrix
- Minimum Cost of ropes
- Longest consecutive subsequence
- Convert an array to reduced form
- Tic-Tac-Toe
- Triplet Sum in Array
- Nodes at even distance
- Minimize the heights
- Unique BST's
- Snake and Ladder Problem
- Reverse Delete Algorithm for Minimum Spanning Tree
- Rearrange characters
- Floyd Warshall
- Huffman Encoding
- Maximum sum Rectangle
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Count BST nodes that lie in a given range
- Check for BST
- Bottom View of Binary Tree
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Delete a node from BST
- Min distance between two given nodes of a Binary Tree
- Topological sort
- Find the number of islands
- Circular tour
- Max rectangle
- Check if subtree
- Remove loop in Linked List
- Minimum Spanning Tree
- Strongly Connected Components (Kosaraju's Algo)
- Bipartite Graph
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- Smallest range in K lists
- k-th smallest element in BST
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Find a pair with given target in BST
- Complete Binary Tree
- Node at distance