- LCM And GCD
- Power of 2
- Series GP
- Nth Fibonacci Number
- Shortest path from 1 to n
- Set Bits
- Minimize the sum of product
- Sum of dependencies in a graph
- Sorted matrix
- Sum Terms Nth Row
- Swap and Maximize
- Alternative Sorting
- Rightmost different bit
- Count numbers divisible by M
- Max value after m range operation
- Shuffle integers
- Message Spreading
- Making elements distinct
- Inverse Permutation
- Ishaan Loves Chocolates
- Reducing Walls
- Maximum Perimeter of Triangle from array
- Prime String
- Selection Sort
- Add two fractions

Name

Institution

Rank in Institute

#2

Courses Attended

Overall Coding Score: 330

Monthly Coding Score: 0

Weekly Coding Score: 0

- Number of Unique Paths
- N meetings in one room
- Maximum sum increasing subsequence
- Reach the Nth point
- Subarray with given sum
- Shop in Candy Store
- 0 - 1 Knapsack Problem
- Cutted Segments
- Number that are not divisible
- Game of Death in a circle
- Raju and coins
- Largest number with given sum
- Maximize Dot Product
- Flip Bits
- Choose and Swap
- Count Pairs in an Array
- Sonam Gupta and her Boyfriend
- Flood fill Algorithm
- Minimum Operations
- Fractional Knapsack
- Recursive sequence
- Transitive closure of a Graph
- Count the paths
- Mr Modulo and Pairs
- Consecutive Array Elements
- K-Ary Tree
- Next Happy Number
- Non-Repeating Element
- Find if string is K-Palindrome or not
- Geek and his Binary Strings
- Maximum difference of zeros and ones in binary string
- Check if array contains contiguous integers with duplicates allowed
- Rearrange an array such that arr[i] = i
- Rope Cutting
- Ease the Array
- Count ways to express N as the sum of 1,3 and 4
- Cross the hurdles: The Game
- Counts Zeros Xor Pairs
- Hungry Pizza Lovers
- Ishaan and Sticks
- Find the closest pair from two arrays
- Common Divisor
- The Inverting Factor
- Maximum sum of increasing order elements from n arrays
- Charul and vessels
- Check if it is possible to survive on Island
- Searching in an array where adjacent differ by at most k
- The Optimal Selection
- Smallest number with sum of digits as N and divisible by 10^N
- Maximum number of customers that can be satisfied with given quantity
- Reaching the heights
- Delete array elements which are smaller than next or become smaller
- Lucky Ishaan
- Smallest greater elements in whole array
- Minimal moves to form a string
- Save Ironman
- DFS of Graph

- Coin Change
- Kadane's Algorithm
- Maximum Sub Array
- Longest Increasing Subsequence
- Longest Common Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Count of n digit numbers whose sum of digits equals to given sum
- Edit Distance
- nCr
- Min Coin
- Consecutive 1's not allowed
- Subset Sum Problem
- Number of Coins
- Rearrange an array with O(1) extra space
- Number of ways
- Subsequence matching
- Jumbled Strings
- Maximum Profit
- Circle of strings
- Nodes at even distance
- Your Social Network
- X Total Shapes
- Total Decoding Messages
- Longest Common Substring
- Negative weight cycle
- Hamiltonian Path
- Snake and Ladder Problem
- Shortest Source to Destination Path
- Divisibility tree
- Replace O's with X's
- Knight Walk
- Word Boggle
- Distance of nearest cell having 1
- Find whether path exist
- Unit Area of largest region of 1's
- Count subsequences of type a^i b^j c^k
- Stepping Numbers
- Perfect Sum Problem
- Job Sequencing Problem
- LCS of three strings
- Maximum Tip Calculator
- Maximize the sum of selected numbers from an array to make it empty