- Repetitive Addition Of Digits
- Pythagorean Triplet
- Majority Element
- Rotate Array
- Permutations of a given string
- Missing number in array
- Swap two nibbles in a byte
- Count total set bits
- Convert array into Zig-Zag fashion
- Reverse array in groups
- Minimize the sum of product
- Last index of One
- Sum of numbers in string
- Sorted matrix
- Check set bits
- Twice counter
- Count nodes of linked list
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Preorder Traversal
- Implement strstr
- Binary String

Name

Ashish Uniyal

Rank in Institute

#5

Overall Coding Score: 654

Monthly Coding Score: 14

Weekly Coding Score: 0

- Anagram
- Search in a Rotated Array
- Squares in N*N Chessboard
- Maximize Toys
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Reverse words in a given string
- Activity Selection
- Sort an array of 0s, 1s and 2s
- N meetings in one room
- Maximum sum increasing subsequence
- Multiply two polynomals
- Subarray with given sum
- Leaders in an array
- Count number of hops
- Count pairs with given sum
- Reach a given score
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Cutted Segments
- Equilibrium point
- Buildings receiving sunlight
- Chocolate Distribution Problem
- Decode the pattern
- Minimum Operations
- Element with left side smaller and right side greater
- First negative integer in every window of size k
- Paths to reach origin
- Nth catalan number
- Second most repeated string in a sequence
- Count all possible paths from top left to bottom right
- Shortest Common Supersequence
- Maximum sum Problem
- Maximum height of the staircase
- Reverse a linked list
- K distance from root
- Mirror Tree
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- DFS of Graph
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Level order traversal Line by Line
- Distinct occurrences
- Expression Tree
- Max Level Sum in Binary Tree
- Special Stack
- Sort a stack
- Level order traversal
- Maximum path sum
- Counting Sort
- Full binary tree
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Huffman Decoding-1
- Vertical sum
- Count Pairs whose sum is equal to X
- Maximum Node Level
- Children Sum Parent
- Linked List Matrix
- Rotate doubly Linked List
- Learning Structs
- Sum of Big Integers
- Back to Front
- Pair Sum in Vector
- Reverse words in a given string

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Excel Sheet | Part - 1
- Print Diagonally
- Overlapping Intervals
- Longest Increasing Subsequence
- Minimum number of jumps
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Edit Distance
- Maximum Rectangular Area in a Histogram
- Consecutive 1's not allowed
- Path in Matrix
- Trapping Rain Water
- Subset Sum Problem
- Stock buy and sell
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Row with max 1s
- Boolean Matrix Problem
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Sum of Query II
- Preorder to Postorder
- Length of the longest substring
- Longest consecutive subsequence
- Palindromic Array
- Max possible amount
- Bleak Numbers
- Maximum Profit
- Minimize the heights
- X Total Shapes
- Word Break
- Kth smallest element
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Shortest Source to Destination Path
- Trie | (Insert and Search)
- Knight Walk
- Is Sudoku Valid
- Find whether path exist
- Rearrange characters
- Count subsequences of type a^i b^j c^k
- Floyd Warshall
- Maximum Intervals Overlap
- Perfect Sum Problem
- Array Pair Sum Divisibility Problem
- Page Faults in LRU
- Rotten Oranges
- Longest Common Prefix in an Array
- Steps by Knight
- Optimal Strategy For A Game
- Reverse a Linked List in groups of given size.
- 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
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Extreme nodes in alternate order
- Clone a Binary Tree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Box Stacking
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- k-th smallest element in BST
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Find a pair with given target in BST
- Occurences of 2 as a digit
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct tree from Inorder and LevelOrder
- Leaves to DLL
- Convert Level Order Traversal to BST
- C++ Generic sort
- Unique BST's
- Unit Area of largest region of 1's
- Count ways to N'th Stair(Order does not matter)