- Reverse an Array
- Maximum and Minimum Of Array Elements
- Sum Of Digits
- Sum of Array
- Armstrong Numbers
- Sum of Series
- Series AP
- Binary number to decimal number
- Sum of Digit is Pallindrome or not
- Automorphic Number
- Print 1 to n without using loops
- Remove Spaces
- Value equal to index value
- Reverse digits
- Cube root of a number

Name

Manjeet Singh

Rank in Institute

#46

Campus Ambassador

Overall Coding Score: 424

Monthly Coding Score: 0

Weekly Coding Score: 0

- Binary String
- Consecutive elements
- Factorial
- Prime Number
- LCM And GCD
- Searching a number
- Power of 2
- Sort The Array
- Sort a String
- Strong Number
- Print the Kth Digit
- Majority Element
- Sieve of Eratosthenes
- Count possible triangles
- Rotate Array
- Check if the number is Fibonacci
- Missing number in array
- Rock Paper Scissors!
- Array of alternate +ve and -ve no.s
- Maximum product of two numbers
- Number of paths
- Numbers containing 0's from 1 to N
- Segregate Even and Odd numbers
- Count total set bits
- Number is sparse or not
- Bit Difference
- Reverse sub array
- Odd Divisors
- Greater on right side
- Immediate Smaller Element
- Count zero
- Perfect Squares in a Range
- Sum of distinct elements
- Convert array into Zig-Zag fashion
- Remove character
- Perfect Cubes in a Range
- Number of occurrence
- Maximum repeating number
- k largest elements
- Pairs of prime number
- Minimum difference pair
- Find position of set bit
- Maximum money
- Generate Binary Numbers
- Find the Odd Occurence
- Keypad typing
- Sum of Products
- Even occurring elements
- Rearranging array
- The AND Gate
- The OR Gate
- Set Bits
- Longest Consecutive 1's
- Permutations in array
- Geek and Coffee Shop
- Does array represent Heap
- Check set bits
- Twice counter
- Total number of Strings
- Anshuman's Favourite Number
- How Many X's?
- Height of Heap
- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Inorder Traversal
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Circular Linked List
- Postorder Traversal
- Implement Stack using Linked List
- Implement Queue using Linked List
- Minimum element in BST
- Find the Sum of Last N nodes of the Linked List
- Modular Node
- Find n/k th node in Linked list
- Insert in Middle of Linked List

- Frequencies of Limited Range Array Elements
- Adding One
- Number of Unique Paths
- Wave Array
- Maximum Gap
- Print Pattern
- Search in a Rotated Array
- Squares in N*N Chessboard
- Magic Number
- Maximize Toys
- Large Factorial
- Non Repeating Character
- Good Pairs
- Count Substrings
- Move all zeroes to end of array
- Remove all duplicates from a given string
- Remove “b” and “ac” from a given string
- Equal Sum and Product
- Sort an array of 0s, 1s and 2s
- Maximum value in a bitonic array
- Finding Position
- Single Number
- Segregate even and odd nodes in a Linked List
- Element that appears once where every element occurs twice
- Maximum Product Subarray
- N meetings in one room
- Addition of submatrix
- Maximum sum increasing subsequence
- Array to BST
- Facing the sun
- Triangular Number
- Make Number Odd
- Key Pair
- Maximum Difference
- Product array puzzle
- Reverse Bits
- Count Smaller elements
- Subarray with given sum
- Count numbers
- Leaders in an array
- Count number of hops
- Type of input
- Count pairs with given sum
- Inorder Traversal and BST
- Comment Removal
- Two Repeated Elements
- Three Great Candidates
- Minimum element in a sorted and rotated array
- Search in a matrix
- Chinky and diamonds
- Find the number of sub-arrays having even sum
- Skip the work
- Number of ways to find two numbers
- Gifts! Gifts! Gifts!
- Element appearing once
- Floor in a Sorted Array
- Buildings receiving sunlight
- Pairs with specific difference
- Count Pairs in an Array
- Maximum Sum Bitonic Subsequence
- Sum of k smallest elements in BST
- Friends Pairing Problem
- Sum of all substrings of a number
- Recaman’s sequence
- Shortest distance in infinite tree
- Increasing Sub Sequence
- Evaluation of Postfix Expression
- Recursive sequence
- Rod Cutting
- Paths to reach origin
- Get Minimum Squares
- Shortest Common Supersequence
- Number of Groups
- Longest alternating subsequence
- Longest subsequence-1
- Maximum sum Problem
- Minimum Cost To Make Two Strings Identical
- High-effort vs. Low-effort
- Longest Repeating Subsequence
- Stickler Thief
- Sum of Lengths of Non-Overlapping SubArrays
- Save Ironman
- Reverse a linked list
- Rotate a Linked List
- Pairwise swap elements of a linked list
- Given a linked list of 0s, 1s and 2s, sort it.
- Detect Loop in linked list
- Right View of Binary Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- Determine if Two Trees are Identical
- Lowest Common Ancestor in a BST
- Check if Linked List is Palindrome
- Print Common Nodes in BST
- Inorder Successor in BST
- Sum of leaf nodes in BST
- Symmetric Tree
- Construct BST from Postorder
- Predecessor and Successor
- Median of BST
- Normal BST to Balanced BST
- Closest Neighbor in BST
- Brothers From Different Roots
- Rotate doubly Linked List

- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Index
- Longest Increasing Subsequence
- Count ways to N'th Stair(Order does not matter)
- Rearrange Array Alternately
- Rotate a 2D array without using extra space
- Inversion of array
- Stock span problem
- Convert an array to reduced form
- Palindromic Array
- Possible groups
- Preorder Traversal and BST
- Next larger element
- Unique BST's
- Print leaf nodes from preorder traversal of BST
- Count subsequences of type a^i b^j c^k
- K
^{th}largest element in a stream - LCS of three strings
- Reverse a Linked List in groups of given size.
- Check for BST
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Connect Nodes at Same Level
- Print a Binary Tree in Vertical Order
- Find a pair with given target in BST
- Convert Level Order Traversal to BST