Name

Institution

Coding Score

346

Problems Solved

120

Overall Rank: 1513

Monthly Rank: 165456

Weekly Rank: 6869

- Search in a Rotated Array
- Parenthesis Checker
- Number of Coins
- Maximum of all subarrays of size k
- Arrange Balls
- Inversion of array
- Reach the Nth point
- Adjacents are not allowed
- Max rope cutting
- Minimum element in a sorted and rotated array
- Pick values
- Longest Common Increasing Subsequence
- Cutted Segments
- Number of distinct subsequences
- Next larger element
- Maximum value
- Maximize Dot Product
- Flip Bits
- Optimal walk
- Count Increasing Subsequences
- Adding Ones
- Pairs with specific difference
- Mr. Binary
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Friends Pairing Problem
- Game of XOR
- Minimum Operations
- Largest zigzag sequence
- Rod Cutting
- Mobile numeric keypad
- Find the highest occurring digit in prime numbers in a range
- Count the number of ways to tile the floor of size n x m using 1 x m size tiles
- Minimum insertions to sort an array
- Minimum steps to delete a string
- Minimum steps to minimize n as per given condition
- Modify array to maximize sum of adjacent differences
- Count ways to increase LCS length of two strings by one
- Number of subsequences in a string divisible by n
- Shortest Uncommon Subsequence
- Find length of longest subsequence
- Count binary strings
- Ways to write n as sum
- LCS of three strings
- Longest subsequence-1
- Sum of average of all subsets
- Number of permutation with K inversions
- Longest repeating and non-overlapping substring
- Count digit groupings of a number
- Find number of times a string occurs as a subsequence
- Minimum Cost To Make Two Strings Identical
- Printing Maximum Sum Increasing Subsequence
- Stickler Thief
- Bell Numbers
- Maximum weight transformation of a given string
- Compute sum of digits in all numbers from 1 to n
- Total number of non-decreasing numbers with n digits
- Convert to Strictly increasing array
- Geek and its Game of Coins
- Diameter of Binary Tree
- Merge two sorted linked lists
- Transform to Sum Tree
- Distinct occurrences
- Split Singly Linked List Alternatingly
- Construct Tree from Inorder & Preorder

- Coin Change
- Number of Unique Paths
- Minimum number of jumps
- Count ways to reach the n’th stair
- Egg Dropping Puzzle
- Count of n digit numbers whose sum of digits equals to given sum
- Consecutive 1's not allowed
- Factorials of large numbers
- Number following a pattern
- Special Keyboard
- Number of ways
- Form a palindrome
- Unique partitions
- Maximum Sum Subsequence of length k
- Longest Arithmetic Progression
- Max possible amount
- Maximum Profit
- Taking 1 out of 3 consecutives
- Unique BST's
- Distinct Transformations
- Word Break
- Maximum calorie
- Count Palindrome Sub-Strings of a String
- Hamiltonian Path
- Substring - Subsequence problem
- Max absolute difference
- Count subsequences of type a^i b^j c^k
- Water Overflow
- Optimal binary search tree
- Largest Sum Subarray of Size at least K
- Little Murph and knots
- Pyramid form
- Probability of Knight
- Count even length
- Matrix Chain Multiplication
- Circular tour
- Largest BST
- Interleaved Strings
- Rat in a Maze Problem
- Construct tree from Inorder and LevelOrder