- Power of 2
- Swap two nibbles in a byte
- Number of paths
- Bit Difference
- Greater on right side
- Smallest number
- Set Bits
- First element to occur k times
- Extract Maximum
- Uncommon characters
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Ishaan Loves Chocolates
- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Inorder Traversal
- Height of Binary Tree
- Finding middle element in a linked list
- Remove duplicate elements from sorted Array
- Replace all 0's with 5
- Preorder Traversal
- Search a node in BST
- Find triplets with zero sum
- Minimum element in BST
- Linked List Length Even or Odd?
- Identical Linked Lists
- Maximum in Struct Array
- Sum of Binary Tree

Name

Institution

Rank in Institute

#2

Overall Coding Score: 216

Monthly Coding Score: 216

Weekly Coding Score: 8

- Count Substrings
- Move all zeroes to end of array
- Remove “b” and “ac” from a given string
- Finding Position
- Amount of Water
- Count Smaller elements
- Count number of hops
- Triplet Sum in Array
- Three Great Candidates
- Possible paths
- Count Pairs in an Array
- Min sum formed by digits
- Knapsack with Duplicate Items
- Flood fill Algorithm
- Find largest word in dictionary
- Meta Strings
- First negative integer in every window of size k
- Game with String
- Paths to reach origin
- Count of strings that can be formed using a, b and c under given constraints
- Save Ironman
- Reverse a linked list
- Occurence of an integer in a Linked List
- Rotate a Linked List
- Detect Loop in linked list
- Find Transition Point
- Determine if Two Trees are Identical
- Largest subarray of 0's and 1's
- Root to leaf paths sum
- Sum of leaf nodes in BST
- Count Pairs whose sum is equal to X
- Sum of Leaf Nodes
- Rotate doubly Linked List by P nodes
- Matrix Interchange
- Matrix Interchange - Java
- ArrayList Operation

- Kadane's Algorithm
- Sum Of Prime
- Print Diagonally
- Overlapping Intervals
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Sum of bit differences
- Modular Exponentiation for large numbers
- Rotate a 2D array without using extra space
- Form a palindrome
- X Total Shapes
- Distinct Transformations
- Word Break
- Replace O's with X's
- Nearly Sorted Algorithm
- The Painter's Partition Problem
- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Count BST nodes that lie in a given range
- Delete without head pointer
- Connect Nodes at Same Level
- The Celebrity Problem
- Remove loop in Linked List
- k-th smallest element in BST
- Merge Sort on Doubly Linked List