- GCD of Array
- Power of 2
- Majority Element
- Sieve of Eratosthenes
- Rotate Array
- Count total set bits
- Number is sparse or not
- Immediate Smaller Element
- k largest elements
- Pairs of prime number
- Sum of all prime numbers between 1 and N.
- Smallest number
- Set Bits
- Professor and Parties
- Longest Consecutive 1's
- Check whether K-th bit is set or not
- Find minimum and maximum element in an array
- Pair cube count
- Balanced Array
- Set kth bit
- Remove repeated digits in a given number
- Remove common characters and concatenate
- Find the fine
- Series X1
- Sum of f(a[i], a[j]) over all pairs in an array of n integers
- Confused pappu
- Difference series
- Multiply left and right array sum.
- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Delete node in Doubly 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 stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Square root
- Doubly linked list Insertion
- Binary Search
- Remove duplicate elements from sorted Array
- Add two fractions
- Replace all 0's with 5
- Count zeros in a sorted matrix
- Third largest element
- Convert to Roman No
- Preorder Traversal
- Search a node in BST
- Find Number of Numbers
- Linked List Insertion
- Minimum element in BST
- Anagram of String
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Find the Sum of Last N nodes of the Linked List
- Modular Node
- Find n/k th node in Linked list
- Maximum in Struct Array
- Sum of Binary Tree
- Insert in Middle of Linked List
- Count Non-Leaf Nodes in Tree
- Stack designer
- Queue Designer

Name

Anugrah kumar

Institution

Rank in Institute

#9

Campus Ambassador

Overall Coding Score: 695

Monthly Coding Score: 10

Weekly Coding Score: 10

- Search in a Rotated Array
- Maximize Toys
- Trailing zeroes in factorial
- First Repeating Element
- Move all zeroes to end of array
- Segregate even and odd nodes in a Linked List
- Array to BST
- Key Pair
- Count Smaller elements
- Leaders in an array
- Swap all odd and even bits
- Inorder Traversal and BST
- Shop in Candy Store
- Find the number of sub-arrays having even sum
- Perfect Numbers
- Adding Ones
- Pairs with specific difference
- Count Pairs in an Array
- Min sum formed by digits
- String Manipulation
- 1[0]1 Pattern Count
- Smallest factorial number
- Decode the pattern
- Minimum Operations
- Excel Sheet | Part - 2
- Largest Fibonacci Subsequence
- Evaluation of Postfix Expression
- Recursive sequence
- Array Subset of another array
- First negative integer in every window of size k
- Paths to reach origin
- Mr Modulo and Pairs
- Sum of two large numbers
- Find winner of the Game of Nim
- Check if a number is divisible by 8
- Print Bracket Number
- Delete array elements which are smaller than next or become smaller
- Reverse a linked list
- Occurence of an integer in a Linked List
- Delete N nodes after M nodes of 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.
- Add two numbers represented by linked lists
- Rearrange a linked list
- Add 1 to a number represented as linked list
- linked list of strings forms a palindrome
- Compare two linked lists
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Rearrange linked list in-place
- Remove duplicates from an unsorted linked list
- Sorted insert for circular linked list
- Split a Circular Linked List into two halves
- Reverse a Doubly Linked List
- Two Mirror Trees
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Decimal Equivalent of Binary Linked List
- Intersection of two sorted Linked lists
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Root to leaf path sum
- Print all nodes that don't have sibling
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Print BST elements in given range
- Binary Tree to BST
- Remove every k'th node
- Subtraction in Linked List
- Multiply two linked lists
- Check if Linked List is Palindrome
- Max distance between same elements
- Longest Consecutive Subsequence
- Delete a Node in Single Linked List
- Kth largest element in BST
- Find duplicates in an array
- Special Stack
- Sort a stack
- Level order traversal
- Peak element
- Index Of an Extra Element
- Merge Sort for Linked List
- Sum of given range
- Union of Two Linked Lists
- Intersection of Two Linked Lists
- Insert in a Sorted List
- Split Singly Linked List Alternatingly
- Ancestors in Binary Tree
- Level of a Node in Binary Tree
- Sum of leaf nodes in BST
- Max and min element in Binary Tree
- XOR Linked List
- Reverse a string using Stack
- Linked List that is Sorted Alternatingly
- XOR of a given range
- Full binary tree
- Modify Linked List-1
- Symmetric Tree
- Construct BST from Postorder
- Arrange Consonants and Vowels
- Count Pairs whose sum is equal to X
- Predecessor and Successor
- Children Sum Parent
- Find length of Loop
- Deletion and Reverse in Linked List
- Linked List Matrix
- Reverse First K elements of Queue
- Remove Half Nodes
- Sum of Leaf Nodes
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Closest Neighbor in BST
- Brothers From Different Roots
- Move all zeros to the front of the linked list
- Delete middle element of a stack
- Rotate doubly Linked List
- Learn to Comment
- Matrix Interchange
- Predict the Column
- Almost Equal -Java
- Consonants and Vowels check - Java
- Swap the objects
- Structs and Objects
- Learning Structs
- Delete Array
- BigInteger Multiply
- BigInteger mod
- Get min at pop
- Deque Implementations

- Find Missing And Repeating
- Sum Of Prime
- Excel Sheet | Part - 1
- Parenthesis Checker
- Consecutive 1's not allowed
- Count of Subarrays
- Sum of bit differences
- Maximize The Array
- Largest Number formed from an Array
- Modular Exponentiation for large numbers
- Rearrange Array Alternately
- Boolean Matrix Problem
- Nuts and Bolts Problem
- Rotate a 2D array without using extra space
- Minimum Cost of ropes
- Preorder to Postorder
- Smallest number on left
- Longest consecutive subsequence
- Convert an array to reduced form
- Is Binary Number Multiple of 3
- Card Rotation
- Super Primes
- Next larger element
- Unique BST's
- Kth smallest element
- Rotate and delete
- Sonam Bewafa asks questions
- Max absolute difference
- Print leaf nodes from preorder traversal of BST
- Rearrange characters
- First non-repeating character in a stream
- K
^{th}largest element in a stream - Nearly Sorted Algorithm
- Infix to Postfix
- Smallest Absolute Difference
- Smallest Positive missing number
- Maximize the sum of selected numbers from an array to make it empty
- Element left after performing alternate OR & XOR operation
- Given a linked list, reverse alternate nodes and append at the end
- Reverse a Linked List in groups of given size.
- Delete nodes having greater value on right
- Quick Sort on Linked List
- Count BST nodes that lie in a given range
- Check for BST
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Merge K sorted linked lists
- Get minimum element from stack
- Max rectangle
- Remove loop in Linked List
- Minimum Swaps to Sort
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- k-th smallest element in BST
- Polynomial Addition
- Merge Sort on Doubly Linked List
- Find a pair with given target in BST
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Smallest Positive missing number
- Unique BST's
- Sorting Elements of an Array by Frequency