Name

nevermind

Rank in Institute

#34

Campus Ambassador

Overall Coding Score: 1001

Monthly Coding Score: 462

Weekly Coding Score: 32

- Prime Number
- Majority Element
- Shortest path from 1 to n
- Missing number in array
- Number of paths
- Count numbers containing 4
- k largest elements
- Ways To Tile A Floor
- Generate Binary Numbers
- Find first set bit
- Does array represent Heap
- Find the element that appears once in sorted array
- Print first n Fibonacci Numbers
- Finding middle element in a linked list
- Binary Search
- Replace all 0's with 5
- Find triplets with zero sum

- Anagram
- Number of Unique Paths
- Maximize Toys
- Trailing zeroes in factorial
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Count Occurences of Anagrams
- Reverse words in a given string
- Sort an array of 0s, 1s and 2s
- Finding Number
- Maximum value in a bitonic array
- Next greater number set digits
- Does robot moves circular
- N meetings in one room
- Remove Duplicates
- Addition of submatrix
- Maximum sum increasing subsequence
- Triangular Number
- Max Sum without Adjacents
- Key Pair
- Maximum Difference
- Length Unsorted Subarray
- Reverse Bits
- Reach the Nth point
- Subarray with given sum
- Adjacents are not allowed
- Leaders in an array
- Count number of hops
- Count pairs with given sum
- Triplet Sum in Array
- Reach a given score
- Overlapping rectangles
- Shop in Candy Store
- Largest number possible
- Count the Zeros
- 0 - 1 Knapsack Problem
- Trail of ones
- Skip the work
- Cutted Segments
- Smallest number subset
- Power of Numbers
- Left out candies
- Permutation with Spaces
- Equilibrium point
- Floor in a Sorted Array
- Maximize Dot Product
- Flip Bits
- Finding the numbers
- Minimum Energy
- Knapsack with Duplicate Items
- Flood fill Algorithm
- Roman Number to Integer
- Gold Mine Problem
- Smallest subarray with sum greater than x
- Find largest word in dictionary
- Minimum Operations
- Find all pairs with a given sum
- Check if frequencies can be equal
- Largest zigzag sequence
- Palindromic patitioning
- Largest Fibonacci Subsequence
- Longest Palindromic Subsequence
- Common elements
- Rod Cutting
- Divisible by 5 or not-1
- First negative integer in every window of size k
- Find the highest occurring digit in prime numbers in a range
- Paths to reach origin
- Subarray with 0 sum
- Get Minimum Squares
- Combine the strings
- Nth catalan number
- Find the closest prime number to a given number
- Count all possible paths from top left to bottom right
- Minimum Deletions
- Shortest Common Supersequence
- Divisibility by 999
- Ways to sum to N
- Subset with sum divisible by m
- 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
- High-effort vs. Low-effort
- Longest Repeating Subsequence
- Stickler Thief
- Special Numbers
- Maximum Height Tree
- Find if string is K-Palindrome or not
- Count ways to express N as the sum of 1,3 and 4
- Cutting Binary String
- Check if any valid sequence is divisible by M
- Reverse a linked list
- Rotate a Linked List
- Given a linked list of 0s, 1s and 2s, sort it.
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- 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
- Left View of Binary Tree
- Sum Tree
- Transform to Sum Tree
- Queue using two Stacks
- Stack using two queues
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Print all nodes that don't have sibling
- Lowest Common Ancestor in a BST
- Binary Heap Operations
- Run Length Encoding
- Largest subarray of 0's and 1's
- Largest subarray with 0 sum
- Minimum Depth of a Binary Tree
- K-Palindrome
- Equilibrium index of an array
- Is Binary Tree Heap
- Distinct occurrences
- Sorted subsequence of size 3
- Josephus problem
- You and your books
- Kth largest element in BST
- Count distinct elements in every window
- Special Stack
- Three way partitioning
- Sort a stack
- Level order traversal
- Index Of an Extra Element
- Intersection of Two Linked Lists
- Ancestors in Binary Tree
- Construct Tree from Inorder & Preorder
- Huffman Decoding-1
- Count Pairs whose sum is equal to X
- ZigZag Tree Traversal
- Find the Frequency

- Coin Change
- Kadane's Algorithm
- Print Diagonally
- Overlapping Intervals
- Maximum Index
- Next Permutation
- Longest Increasing Subsequence
- Parenthesis Checker
- 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)
- Count of n digit numbers whose sum of digits equals to given sum
- Edit Distance
- nCr
- Maximum Rectangular Area in a Histogram
- Consecutive 1's not allowed
- Longest Even Length Substring
- Path in Matrix
- Trapping Rain Water
- String formation from substring
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Number following a pattern
- Stock buy and sell
- Largest Number formed from an Array
- Number of paths in a matrix with k coins
- Jumping Numbers
- Longest Palindrome in a String
- Maximum of all subarrays of size k
- Largest square formed in a matrix
- Row with max 1s
- Boolean Matrix Problem
- Sorting Elements of an Array by Frequency
- Rotate a 2D array without using extra space
- Special Keyboard
- Number of ways
- Minimum Cost of ropes
- Sum of Query II
- Form a palindrome
- Inversion of array
- Length of the longest substring
- Longest consecutive subsequence
- Palindromic Array
- Is Binary Number Multiple of 3
- Maximum Sum Subsequence of length k
- Longest Arithmetic Progression
- Max possible amount
- Coin Piles
- Maximum Profit
- Circle of strings
- Largest number in K swaps
- Special Matrix
- Minimize the heights
- Next larger element
- X Total Shapes
- Unique BST's
- Subsets
- Combination Sum
- Combination Sum - Part 2
- Word Break
- Longest Prefix Suffix
- Kth smallest element
- Divisible by 8
- Longest Common Substring
- Count Palindrome Sub-Strings of a String
- Negative weight cycle
- Snake and Ladder Problem
- Shortest Source to Destination Path
- Replace O's with X's
- Knight Walk
- Word Boggle
- Distance of nearest cell having 1
- Is Sudoku Valid
- Find whether path exist
- Unit Area of largest region of 1's
- First non-repeating character in a stream
- Count subsequences of type a^i b^j c^k
- Stepping Numbers
- K
^{th}largest element in a stream - Water Overflow
- 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
- Longest Bitonic subsequence
- Maximum sum Rectangle
- Maximum Intervals Overlap
- Perfect Sum Problem
- Rotten Oranges
- Longest repeating and non-overlapping substring
- Steps by Knight
- Count of sum of consecutives
- Matrix Chain Multiplication
- 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
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- 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
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Print a Binary Tree in Vertical Order
- Merge K sorted linked lists
- Find the number of islands
- Get minimum element from stack
- Circular tour
- Wildcard Pattern Matching
- Max rectangle
- Extreme nodes in alternate order
- Clone a Binary Tree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Max length chain
- Interleaved Strings
- LRU Cache
- Box Stacking
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Rat in a Maze Problem
- Max sum subarray by removing at most one element
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- Occurences of 2 as a digit
- K-Sum Paths
- Node at distance
- Leaves to DLL
- Count Number of SubTrees having given Sum
- Unique BST's
- Unit Area of largest region of 1's
- Longest consecutive subsequence
- Count ways to N'th Stair(Order does not matter)