- Power of 2
- Nth Fibonacci Number
- Majority Element
- Count possible triangles
- Permutations of a given string
- Swap two nibbles in a byte
- Count total set bits
- Bit Difference
- Remove character
- Number of occurrence
- Maximum repeating number
- k largest elements
- Sum of Digits Divisibility
- Generate Binary Numbers
- Find the Odd Occurence
- Find the remainder
- Help the Old Man!!!
- Total count
- Surpasser Count
- Sum of primes
- Minimize string value
- Find first and last occurrence of x
- Type of array
- Unique Numbers
- Long Long Decimal
- Check for subsequence
- Geek and Coffee Shop
- Does array represent Heap
- Extract Maximum
- URLify a given string
- Difficulty of sentence
- Print Linked List elements
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Preorder Traversal
- Search a node in BST
- Anagram of String
- Circular Linked List Traversal

Name

Institute

Mnnit

Overall Coding Score: 483

Monthly Coding Score: 0

Weekly Coding Score: 0

- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Pairs with difference k
- Next greater number set digits
- Maximum Product Subarray
- Maximum sum increasing subsequence
- Array to BST
- Facing the sun
- Max Sum without Adjacents
- Key Pair
- Maximum Difference
- Reach the Nth point
- Leaders in an array
- Inorder Traversal and BST
- Triplet Sum in Array
- Three Great Candidates
- Minimum element in a sorted and rotated array
- 0 - 1 Knapsack Problem
- Subtraction and two numbers
- Sachin's love for runs
- Maximum value
- Largest number with given sum
- Number of matches
- GCD and Fibonacci Numbers
- Nth digit in sequence
- Collection of pens
- Permutation with Spaces
- Equilibrium point
- Binary Tree K level sum
- Exit Point in a Matrix
- 1[0]1 Pattern Count
- Longest K unique characters substring
- Seeds of a number
- Game of XOR
- Find largest word in dictionary
- Love For The Twins
- Longest Palindromic Subsequence
- Common elements
- Rod Cutting
- Game with String
- Sort the pile of cards
- Reverse a linked list
- Occurence of an integer in a Linked List
- Add two numbers represented by linked lists
- Compare two linked lists
- Detect Loop in linked list
- Sorted insert for circular linked list
- Split a Circular Linked List into two halves
- Insertion Sort
- K distance from root
- Mirror Tree
- Maximum Width of Tree
- Check for Balanced Tree
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- Intersection of two sorted Linked lists
- Level order traversal in spiral form
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- Root to leaf path sum
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Binary Tree to BST
- Is Binary Tree Heap
- Print matrix in diagonal pattern
- Check whether BST contains Dead End
- Kth largest element in BST
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Longest consecutive sequence in Binary tree
- Print Common Nodes in BST
- Level order traversal
- Delete nodes greater than k
- Index Of an Extra Element
- Level of a Node in Binary Tree
- Root to Leaf Paths
- Linked List that is Sorted Alternatingly
- Construct Tree from Inorder & Preorder

- Kadane's Algorithm
- Maximum Index
- Longest Increasing Subsequence
- Minimum number of jumps
- Count ways to reach the n'th stair
- Egg Dropping Puzzle
- Edit Distance
- Maximum Rectangular Area in a Histogram
- Min Coin
- Longest Even Length Substring
- Trapping Rain Water
- Subset Sum Problem
- Longest Palindrome in a String
- Relative Sorting
- Maximum of all subarrays of size k
- Number of ways
- Minimum Cost of ropes
- Inversion of array
- Stock span problem
- Number to words
- Possible groups
- Next larger element
- X Total Shapes
- Unique BST's
- Combination Sum
- Longest Prefix Suffix
- Count Palindrome Sub-Strings of a String
- Trie | (Insert and Search)
- Print leaf nodes from preorder traversal of BST
- First non-repeating character in a stream
- Smallest distinct window
- Huffman Encoding
- Nearly Sorted Algorithm
- Smallest Positive missing number
- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Tree from Postorder and Inorder
- Add all greater values to every node in a BST
- Connect Nodes at Same Level
- Delete a node from BST
- Print a Binary Tree in Vertical Order
- Clone a Binary Tree
- LRU Cache
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Smallest range in K lists
- Find a pair with given target in BST
- Count More than n/k Occurences
- K-Sum Paths
- Construct tree from Inorder and LevelOrder