Name

cap

Rank in Institute

#66

Courses Attended

Campus Ambassador

Overall Coding Score: 637

Monthly Coding Score: 145

Weekly Coding Score: 0

- Number of Unique Paths
- Minimum number of Coins
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Maximum sum increasing subsequence
- Reach the Nth point
- Count number of hops
- Triplet Sum in Array
- Search in a matrix
- 0 - 1 Knapsack Problem
- Cutted Segments
- Maximize Dot Product
- Chocolate Distribution Problem
- Exit Point in a Matrix
- Flood fill Algorithm
- Maximum no of 1's row
- Gold Mine Problem
- Find the string in grid
- Longest Palindromic Subsequence
- Evaluation of Postfix Expression
- Find Pair Given Difference
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Stickler Thief
- Print Bracket Number
- Print adjacency list
- Insertion Sort
- Left View of Binary Tree
- Transform to Sum Tree
- DFS of Graph
- BFS of graph
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Tree to BST
- K-Palindrome
- Sort a stack

- Coin Change
- Kadane's Algorithm
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Count of n digit numbers whose sum of digits equals to given sum
- Edit Distance
- nCr
- Min Coin
- Consecutive 1's not allowed
- Path in Matrix
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Jumping Numbers
- Relative Sorting
- Largest square formed in a matrix
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Nuts and Bolts Problem
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Form a palindrome
- Preorder to Postorder
- Smallest number on left
- Longest consecutive subsequence
- Stock span problem
- Preorder Traversal and BST
- Number of pairs
- Special Matrix
- Next larger element
- X Total Shapes
- Total Decoding Messages
- Subsets
- Combination Sum - Part 2
- Kth smallest element
- Longest Common Substring
- Recursively remove all adjacent duplicates
- Shortest Source to Destination Path
- Replace O's with X's
- Knight Walk
- Find all four sum numbers
- Word Boggle
- Print leaf nodes from preorder traversal of BST
- Find whether path exist
- Largest prime factor
- Check Mirror in N-ary tree
- Unit Area of largest region of 1's
- Rearrange characters
- First non-repeating character in a stream
- Stepping Numbers
- Infix to Postfix
- Longest Bitonic subsequence
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Job Sequencing Problem
- Rotten Oranges
- Steps by Knight
- In First But Second
- Row with minimum number of 1's
- Save Gotham!
- Given a linked list, reverse alternate nodes and append at the end
- 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
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Add all greater values to every node in a BST
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Print a Binary Tree in Vertical Order
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Make Binary Tree From Linked List
- Check if subtree
- Extreme nodes in alternate order
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Interleaved Strings
- Multiply two strings
- Rat in a Maze Problem
- Bipartite Graph
- Find the Closest Element in BST
- Delete keys in a Linked list
- Print Nodes having K leaves
- Top View of Binary Tree
- k-th smallest element in BST
- Polynomial Addition
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Node at distance
- Leaves to DLL
- Construct Tree from Preorder Traversal
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Unit Area of largest region of 1's
- Sorting Elements of an Array by Frequency
- Count ways to N'th Stair(Order does not matter)