Name

**

Rank in Institute

#22

Courses Attended

Overall Coding Score: 1111

Monthly Coding Score: 0

Weekly Coding Score: 0

- Power of 2
- Majority Element
- Permutations of a given string
- Missing number in array
- Number of paths
- Count total set bits
- Number is sparse or not
- Bit Difference
- Check if a number is power of another number
- Longest Consecutive 1's
- Minimize the sum of product
- Check if two arrays are equal or not
- Check if string is rotated by two places
- Find first set bit
- Find first repeated character
- Does array represent Heap
- Find the element that appears once in sorted array
- First element to occur k times
- Check whether K-th bit is set or not
- Uncommon characters
- Rightmost different bit
- Set kth bit
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Implement Stack using Linked List
- Implement Queue using Linked List
- Binary Search
- Implement strstr
- Implement Atoi
- Find triplets with zero sum

- Anagram
- Wave Array
- Search in a Rotated Array
- Maximize Toys
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Count Occurences of Anagrams
- Reverse words in a given string
- Activity Selection
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Longest Distinct characters in string
- Count distinct pairs with difference k
- N meetings in one room
- Remove Duplicates
- Maximum sum increasing subsequence
- Array to BST
- Length Unsorted Subarray
- Reach the Nth point
- Subarray with given sum
- Adjacents are not allowed
- Leaders in an array
- Swap all odd and even bits
- Count number of hops
- Triplet Sum in Array
- Possible paths
- Number of subsets and mean
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Cutted Segments
- Equilibrium point
- Pairs with specific difference
- Mr. Binary
- Find Maximum Sum Strictly Increasing Subarray
- Chocolate Distribution Problem
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Flood fill Algorithm
- Longest K unique characters substring
- Friends Pairing Problem
- Gold Mine Problem
- Find largest word in dictionary
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Temple Offerings
- K-th element of two sorted Arrays
- Common elements
- Rod Cutting
- Element with left side smaller and right side greater
- Sequence of Sequence
- Array Subset of another array
- Count the paths
- Minimum Deletions
- Shortest Common Supersequence
- Largest Permutation
- Swapping pairs make sum equal
- Minimum insertions to sort an array
- Minimum number of deletions and insertions.
- Minimum number of deletions to make a sorted sequence
- Minimum steps to minimize n as per given condition
- Longest alternating subsequence
- Shortest Uncommon Subsequence
- Find all distinct subset (or subsequence) sums
- Longest subsequence-1
- Number of permutation with K inversions
- Minimum indexed character
- Stickler Thief
- Minimum Swaps for Bracket Balancing
- Chicks in a Zoo
- Rearrange array such that even positioned are greater than odd
- Arya's Long String
- Charul and vessels
- Transmutation
- Sum Array
- Maximum Integer Value
- 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
- Reverse a Doubly Linked List
- Merge Sort
- Quick Sort
- Right View of Binary Tree
- K distance from root
- 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
- Sum Tree
- Transform to Sum Tree
- Level order traversal in spiral form
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Largest subarray of 0's and 1's
- Largest subarray with 0 sum
- Binary Tree to BST
- K-Palindrome
- Is Binary Tree Heap
- Josephus problem
- You and your books
- Expression Tree
- Check if Linked List is Palindrome
- Longest Consecutive Subsequence
- Kth largest element in BST
- Count distinct elements in every window
- Inorder Successor in BST
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Root to Leaf Paths
- Maximum path sum
- Max and min element in Binary Tree
- Symmetric Tree
- Construct Tree from Inorder & Preorder
- Merge Lists Alternatingly
- Check if Tree is Isomorphic
- Predecessor and Successor
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- ZigZag Tree Traversal
- Tilt of Binary Tree
- Pairwise swap of nodes in LinkeList
- Smallest window in a string containing all the characters of another string

- Coin Change
- Kadane's Algorithm
- Maximum Sub Array
- Overlapping Intervals
- Next Permutation
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Egg Dropping Puzzle
- Edit Distance
- Longest Span with same Sum in two Binary arrays
- Consecutive 1's not allowed
- Count of Subarrays
- Path in Matrix
- Subset Sum Problem
- Number of Coins
- Stock buy and sell
- Largest Number formed from an Array
- Possible words from Phone digits
- Longest Palindrome in a String
- Modular Exponentiation for large numbers
- Relative Sorting
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Design a tiny URL or URL shortener
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Form a palindrome
- Inversion of array
- Stock span problem
- M-Coloring Problem
- Tic-Tac-Toe
- Unique partitions
- Subsets with XOR value
- Jumbled Strings
- Bleak Numbers
- Number of pairs
- Coin Piles
- Maximum XOR subset
- Circle of strings
- Queries on Strings
- Minimize the heights
- Next larger element
- X Total Shapes
- Total Decoding Messages
- Distinct Transformations
- Combination Sum - Part 2
- Kth smallest element
- Longest Common Substring
- Snake and Ladder Problem
- Recursively remove all adjacent duplicates
- Tricky Subset Problem
- Shortest Source to Destination Path
- Trie | (Insert and Search)
- Knight Walk
- Substring - Subsequence problem
- Count of AP Subsequences
- Word Boggle
- Max absolute difference
- Find whether path exist
- First non-repeating character in a stream
- Zero Sum Subarrays
- Smallest window in a string containing all the characters of another string
- Smallest distinct window
- Minimum number of steps to reach a given number.
- Floyd Warshall
- Geek collects the balls
- Largest Sum Subarray of Size at least K
- Longest Bitonic subsequence
- Mobile numeric keypad
- Pyramid form
- Maximum Intervals Overlap
- Perfect Sum Problem
- Longest Path in a matrix
- Array Pair Sum Divisibility Problem
- Page Faults in LRU
- Count possible ways to construct buildings
- Min cut Square
- Rotten Oranges
- Modify array to maximize sum of adjacent differences
- Probability of Knight
- Two water Jug problem
- Longest repeating and non-overlapping substring
- Longest Common Prefix in an Array
- Subarray Inversions
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Pizza Mania
- Killing Spree
- Number of subarrays with maximum values in given range
- Lazy Pasha
- Subarrays with equal 1s and 0s
- Longest Sub-Array with Sum K
- Sick Pasha
- Beautiful SubSequence
- Water Connection Problem
- The Painter's Partition Problem
- Minimum swaps and K together
- Maximize the sum of selected numbers from an array to make it empty
- Optimal Strategy For A Game
- Given a linked list, reverse alternate nodes and append at the end
- Reverse a Linked List in groups of given size.
- 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
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Min distance between two given nodes of a Binary Tree
- Topological sort
- Print a Binary Tree in Vertical Order
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Circular tour
- Make Binary Tree From Linked List
- Check if subtree
- Kth element in Matrix
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Minimum Spanning Tree
- Largest BST
- Interleaved Strings
- Box Stacking
- Multiply two strings
- Minimum Swaps to Sort
- Rat in a Maze Problem
- Max sum subarray by removing at most one element
- Find the Closest Element in BST
- Pots of Gold Game
- Merge two BST 's
- Merge k Sorted Arrays
- k-th smallest element in BST
- Find a pair with given target in BST
- Construct tree from Inorder and LevelOrder
- Node at distance
- Largest Independent Set Problem
- Construct a Full Binary Tree
- Count Number of SubTrees having given Sum
- Trapping Rain Water
- Unique BST's
- Unit Area of largest region of 1's
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Count ways to N'th Stair(Order does not matter)

- Minimum sum partition
- Maximum of minimum for every window size
- Merge Without Extra Space
- Allocate minimum number of pages
- Largest rectangle of 1’s with swapping of columns allowed
- Word Break - Part 2
- Minimum Cost Path
- N-Queen Problem
- Solve the Sudoku
- Find median in a stream
- Max Circular Subarray Sum
- Minimum number of elements
- Distinct palindromic substrings
- Longest Zig-Zag Sub Sequence
- Convert to Strictly increasing array
- Phone directory
- Queries on a Matrix
- Binary Tree to DLL
- AVL Tree Insertion
- Maximum subset XOR
- Alien Dictionary
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST