Name

Institute

Freelancer

Overall Coding Score: 620

Monthly Coding Score: 612

Weekly Coding Score: 108

- Number of Unique Paths
- Minimum number of Coins
- Maximum sum increasing subsequence
- Reach the Nth point
- Adjacents are not allowed
- Count number of hops
- Reach a given score
- Shop in Candy Store
- 0 - 1 Knapsack Problem
- Skip the work
- Maximum Sum Bitonic Subsequence
- Knapsack with Duplicate Items
- Sum of all substrings of a number
- Minimum Operations
- Increasing Sub Sequence
- Longest Palindromic Subsequence
- Rod Cutting
- Paths to reach origin
- Get Minimum Squares
- Shortest Common Supersequence
- Longest alternating subsequence
- Count of strings that can be formed using a, b and c under given constraints
- Maximum sum Problem
- Find number of times a string occurs as a subsequence
- Minimum Cost To Make Two Strings Identical
- Longest Repeating Subsequence
- Stickler Thief
- Minimal moves to form a string
- Mirror Tree
- Odd even level difference
- Distinct occurrences
- You and your books
- Full binary tree
- Sum of Leaf Nodes

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Print Diagonally
- Next Permutation
- Longest Increasing Subsequence
- 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
- Edit Distance
- nCr
- Maximum Rectangular Area in a Histogram
- Min Coin
- Consecutive 1's not allowed
- Count of Subarrays
- Longest Even Length Substring
- Path in Matrix
- Sum of bit differences
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Find Prime numbers in a range
- Number of paths in a matrix with k coins
- Possible words from Phone digits
- Modular Exponentiation for large numbers
- Relative Sorting
- Largest square formed in a matrix
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Sum of Query II
- Form a palindrome
- Smallest number on left
- Longest consecutive subsequence
- Stock span problem
- Convert an array to reduced form
- Minimum steps to get desired array
- Palindromic Array
- Unique partitions
- Maximum Sum Subsequence of length k
- Subsets with XOR value
- Jumbled Strings
- Palindromic Strings
- Max possible amount
- Super Primes
- Maximum Profit
- Minimize the heights
- Composite and Prime
- Taking 1 out of 3 consecutives
- X Total Shapes
- Total Decoding Messages
- Unique BST's
- Distinct Transformations
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Maximum calorie
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Recursively remove all adjacent duplicates
- Trie | (Insert and Search)
- Replace O's with X's
- Word Boggle
- Max absolute difference
- Print leaf nodes from preorder traversal of BST
- Is Sudoku Valid
- Find whether path exist
- Rearrange characters
- Count subsequences of type a^i b^j c^k
- Count in array
- Water Overflow
- Nearly Sorted Algorithm
- Infix to Postfix
- Geek collects the balls
- Largest Sum Subarray of Size at least K
- Smallest Positive missing number
- Longest Bitonic subsequence
- Mobile numeric keypad
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Minimum Time
- Perfect Sum Problem
- Job Sequencing Problem
- Number of palindromic strings
- Rotten Oranges
- Modify array to maximize sum of adjacent differences
- LCS of three strings
- Minimum cost to fill given weight in a bag
- Brackets in Matrix Chain Multiplication
- Matrix Chain Multiplication
- Maximum Tip Calculator
- Pizza Mania
- Geek and Strings
- The Painter's Partition Problem
- Reverse a Linked List in groups of given size.
- Count BST nodes that lie in a given range
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Min distance between two given nodes of a Binary Tree
- Make Binary Tree
- Check if subtree
- Clone a Binary Tree
- Remove loop in Linked List
- Max length chain
- Interleaved Strings
- Box Stacking
- Count Palindromic Subsequences
- Minimum Swaps to Sort
- Rat in a Maze Problem
- Pots of Gold Game
- Delete keys in a Linked list
- Merge two BST 's
- Largest Independent Set Problem
- Count Number of SubTrees having given Sum