Name

Institution

Rank in Institute

#13

Overall Coding Score: 336

Monthly Coding Score: 24

Weekly Coding Score: 2

- Anagram
- Non Repeating Character
- Sum of Middle Elements of two sorted arrays
- Remove all duplicates from a given string
- Does robot moves circular
- Facing the sun
- Product array puzzle
- Count number of hops
- Count pairs with given sum
- Copy Set Bits in Range
- Reach a given score
- Count the Zeros
- Floor in a Sorted Array
- Buildings receiving sunlight
- Knapsack with Duplicate Items
- Roman Number to Integer
- Rod Cutting
- First negative integer in every window of size k
- Four Elements
- Group Anagrams Together
- Count all possible paths from top left to bottom right
- Number of Groups
- Toppers Of Class
- Count of strings that can be formed using a, b and c under given constraints
- Merging two unsorted arrays in sorted order
- Sum of two large numbers
- Pairs with Positive Negative values
- Word with maximum frequency
- Reverse a linked list
- Detect Loop in linked list
- Reverse a Doubly Linked List
- Right View of Binary Tree
- Mirror Tree
- Check for Balanced Tree
- Left View of Binary Tree
- Remove duplicate element from sorted Linked List
- DFS of Graph
- BFS of graph
- Max sum in the configuration
- Distinct occurrences
- Merge Sort for Linked List
- Height of Spiral Tree
- Sum of Leaf Nodes
- Reverse words in a given string

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Egg Dropping Puzzle
- Edit Distance
- Path in Matrix
- Trapping Rain Water
- Number of Coins
- Minimum Platforms
- Stock buy and sell
- Longest Palindrome in a String
- Number of ways
- Sum of Query II
- Stock span problem
- Palindromic Array
- Longest Arithmetic Progression
- Maximum Profit
- X Total Shapes
- Kth smallest element
- Longest Common Substring
- Trie | (Insert and Search)
- Find whether path exist
- Check Mirror in N-ary tree
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- Floyd Warshall
- Infix to Postfix
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Rotten Oranges
- Row with minimum number of 1's
- Reverse a Linked List in groups of given size.
- Count BST nodes that lie in a given range
- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Detect cycle in an undirected graph
- Print a Binary Tree in Vertical Order
- Find the number of islands
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- Delete keys in a Linked list
- k-th smallest element in BST
- Binary Tree to CDLL
- Unique BST's
- Count ways to N'th Stair(Order does not matter)