- Print Linked List elements
- Count nodes of linked list
- Node at a given index in linked list
- Power of Four
- Size of Binary Tree
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Selection Sort
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using array
- Square root
- Preorder Traversal
- Search a node in BST
- Find triplets with zero sum
- Minimum element in BST
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Identical Linked Lists
- Find the Sum of Last N nodes of the Linked List
- Sum of Binary Tree
- Pairwise Consecutive Elements
- Stack designer
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Operations on Stack
- Operations on Queue
- Absolute Value
- Convert Celsius To Fahrenheit
- Rotate Array
- Search an Element in an array
- Searching an element in a sorted array
- Majority Element
- Left Index
- Binary Array Sorting
- Count possible triangles
- Adding two matrices
- Sum of upper and lower triangles
- Multiply the matrices
- Print Matrix in snake Pattern
- Transpose of Matrix
- Rotate by 90 degree
- Addition Under Modulo
- Multiplication Under Modulo
- Doctors Clinic
- Multiply left and right array sum.
- Sieve of Eratosthenes
- Rotate Array
- Sort The Array
- Check set bits
- Immediate Smaller Element
- Power of 2
- Minimum difference pair

Name

Rank in Institute

#88

Courses Attended

Campus Ambassador

Overall Coding Score: 670

Monthly Coding Score: 202

Weekly Coding Score: 113

- Reverse a linked list
- Occurence of an integer in 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
- Linked List in Zig-Zag fashion
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Reverse a Doubly Linked List
- Insertion Sort
- Merge Sort
- 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
- Nth node from end of linked list
- Left View of Binary Tree
- Delete Middle of Linked List
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- Find Transition Point
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- Insert a node in a BST
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Root to leaf path sum
- Absolute List Sorting
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Level order traversal Line by Line
- Print BST elements in given range
- Minimum Depth of a Binary Tree
- Multiply two linked lists
- Check if Linked List is Palindrome
- Max distance between same elements
- Count distinct elements in every window
- Max Level Sum in Binary Tree
- Special Stack
- Root to leaf paths sum
- Sort a stack
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Level of a Node in Binary Tree
- Reverse a string using Stack
- Full binary tree
- Count Pairs whose sum is equal to X
- Check if Tree is Isomorphic
- Maximum Node Level
- Children Sum Parent
- Find length of Loop
- Sum of Leaf Nodes
- Sum of Left Leaf Nodes
- ZigZag Tree Traversal
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Rotate doubly Linked List
- Need Some Change
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Get min at pop
- Max and Second Max
- Pairwise swap of nodes in LinkeList
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Exactly 3 Divisors
- Mean And Median
- Modular Multiplicative Inverse
- Minimum adjacent difference in a circular array
- Maximum occured integer
- Wave Array
- Frequencies of Limited Range Array Elements
- Equilibrium point
- Leaders in an array
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Inversion of array
- Two Repeated Elements
- Roof Top
- Union of Two Sorted Arrays
- Subarray with given sum
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- Triplet Sum in Array
- Spirally traversing a matrix
- Search in a matrix
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Boundary traversal of matrix
- Exchange matrix columns
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Evaluation of Postfix Expression
- Digital Root
- Count Pairs in an Array
- Deficient Number
- Triangular Number
- Reverse Coding
- Addition of submatrix
- Drive the car
- Recursive sequence
- Circle and Lattice Points
- Count Smaller elements
- Single Number
- Adding Ones
- Game of cells
- Count pairs with given sum
- Minimum element in a sorted and rotated array
- Search in a matrix
- Find the number of sub-arrays having even sum
- Smallest number subset
- Spirally traversing a matrix
- Maximum Gap
- Counts Zeros Xor Pairs
- Find out the Team
- Maximize Toys
- First Repeating Element
- Arya and The Great War
- Pairs which are Divisible by 4
- Sort an array of 0s, 1s and 2s
- Roof Top
- Minimum indexed character
- Maximum value in a bitonic array
- Amount of Water
- Print Bracket Number
- First negative integer in every window of size k

- 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
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Delete a node from BST
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Check if subtree
- Find the Closest Element in BST
- Count More than n/k Occurences
- Foldable Binary Tree
- Maximum path sum from any node
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Maximum sum of Non-adjacent nodes
- Implementing Floor in BST
- Implementing Ceil in BST
- Pair Sum in BST
- Smallest Positive missing number
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Trapping Rain Water
- Stock buy and sell
- Check if array is sorted and rotated
- Kadane's Algorithm
- Make Matrix Beautiful
- Boolean Matrix Problem
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Stock span problem
- Next larger element
- Infix to Postfix
- Count only Repeated
- Save Gotham!
- Nearly Sorted Algorithm
- Kth smallest element
- Find Missing And Repeating
- Smallest Positive missing number
- Modular Exponentiation for large numbers
- Sum Of Prime
- Print Diagonally
- Overlapping Intervals
- Maximum Index
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Count of Subarrays
- Trapping Rain Water
- Sum of bit differences
- Find Prime numbers in a range
- Stock buy and sell
- Kadane's Algorithm
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Next larger element
- Boolean Matrix Problem
- Rotate a 2D array without using extra space
- Preorder to Postorder
- Smallest number on left
- Stock span problem
- Convert an array to reduced form
- Minimum steps to get desired array
- Palindromic Array