- 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
- Implement Stack using Linked List
- Implement stack using array
- Implement Queue using Linked List
- Implement Queue using array
- Binary Search
- Convert to Roman No
- Implement strstr
- Search a node in BST
- Implement Atoi
- Linked List Insertion
- Minimum element in BST
- Circular Linked List Traversal
- Linked List Length Even or Odd?
- Delete Alternate Nodes
- Queue Reversal
- Search an Element in an array
- Binary String
- Power of 2
- Majority Element
- Sieve of Eratosthenes
- Rotate Array
- Missing number in array
- Immediate Smaller Element
- Sum of distinct elements
- Number of occurrence
- Check if a number is power of another number
- Sum of all prime numbers between 1 and N.
- Angle between hour and minute hand
- Rotating an Array
- Reverse array in groups
- Minimize the sum of product
- Squares in a Matrix
- Find first and last occurrence of x
- Sort in specific order
- Sherlock a Detective
- Check if string is rotated by two places
- Find first repeated character
- Find the element that appears once in sorted array
- Print an array in Pendulum Arrangement
- First element to occur k times
- Find the smallest and second smallest element in an array
- Check if a string is Isogram or not
- Check set bits
- Elements in the Range
- Print first n Fibonacci Numbers
- Remove repeated digits in a given number
- Find the fine
- Find the closest number
- Remove consonants from a string
- Ishaan Loves Chocolates
- Height of Heap

Name

aj

Rank in Institute

#52

Courses Attended

Overall Coding Score: 616

Monthly Coding Score: 487

Weekly Coding Score: 98

- 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.
- Compare two linked lists
- Linked List in Zig-Zag fashion
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Split a Circular Linked List into two halves
- Merge Sort
- Quick Sort
- Right View of Binary Tree
- K distance from root
- Two Mirror Trees
- Maximum Width of Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Heap Sort
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Transform to Sum Tree
- Find Transition Point
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- Reverse Level Order Traversal
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Print all nodes that don't have sibling
- Postorder traversal from given Inorder and Preorder traversals
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Run Length Encoding
- Largest subarray of 0's and 1's
- Level order traversal Line by Line
- Print BST elements in given range
- Largest subarray with 0 sum
- Odd even level difference
- Binary Tree to BST
- Equilibrium index of an array
- Is Binary Tree Heap
- Match specific pattern
- Josephus problem
- Expression Tree
- Check if Linked List is Palindrome
- Check whether BST contains Dead End
- Delete a Node in Single Linked List
- Kth largest element in BST
- Count distinct elements in every window
- Special Stack
- Sort a stack
- Print Common Nodes in BST
- Level order traversal
- Peak element
- Delete nodes greater than k
- Index Of an Extra Element
- Level of a Node in Binary Tree
- Maximum path sum
- Full binary tree
- Construct BST from Postorder
- Huffman Decoding-1
- Count Pairs whose sum is equal to X
- Maximum Node Level
- Children Sum Parent
- Diagonal Sum In Binary Tree
- Find length of Loop
- Change of Key in BST
- Leaf under budget
- Linked List Matrix
- Remove Half Nodes
- Height of Spiral Tree
- Sum of Right Leaf Nodes
- Sum of Left Leaf Nodes
- Nodes at Odd Levels
- Exchange the Leaf Nodes
- Sum of Leaf Nodes at Min Level
- Tilt of Binary Tree
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Matrix Interchange
- Predict the Column
- Magic in CPP
- Swap the objects
- Structs and Objects
- Learning Structs
- Delete Array
- Sum of Big Integers
- Pairwise swap of nodes in LinkeList
- Anagram
- Wave Array
- Print Pattern
- Search in a Rotated Array
- Maximize Toys
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- Reverse words in a given string
- Move all zeroes to end of array
- Activity Selection
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Two numbers with sum closest to zero
- Finding Position
- Single Number
- Element that appears once where every element occurs twice
- Longest Distinct characters in string
- Column name from a given column number
- Remove Duplicates
- Addition of submatrix
- Array to BST
- Facing the sun
- Triangular Number
- Key Pair
- Reach the Nth point
- Subarray with given sum
- Leaders in an array
- Count number of hops
- Inorder Traversal and BST
- Three Great Candidates
- Reach a given score
- Chinky and diamonds
- Shop in Candy Store
- Largest number possible
- 0 - 1 Knapsack Problem
- Equilibrium point
- Floor in a Sorted Array
- Buildings receiving sunlight
- Collecting Trees
- Min sum formed by digits
- Chocolate Distribution Problem
- Binary Tree K level sum
- Find Nth root of M
- Find all pairs with a given sum
- Check if frequencies can be equal
- Excel Sheet | Part - 2
- K-th element of two sorted Arrays
- Evaluation of Postfix Expression
- Common elements
- Array Subset of another array
- First negative integer in every window of size k
- Game with String
- Shortest Common Supersequence
- Swapping pairs make sum equal
- String Ignorance
- Minimum indexed character
- Remaining String
- Pairs with Positive Negative values
- Numbers containing 1, 2 and 3
- Non-Repeating Element
- Longest common prefix
- Find winner of the Game of Nim
- Mystic Falls School
- Check if array contains contiguous integers with duplicates allowed
- Winner of an election
- Find the closest pair from two arrays
- Print Bracket Number
- Save Ironman

- 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
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Delete a node from BST
- Merge K sorted linked lists
- Get minimum element from stack
- Serialize and Deserialize a Binary Tree
- Circular tour
- Clone a Binary Tree
- Remove loop in Linked List
- Max length chain
- Merge two BST 's
- Polynomial Addition
- Construct tree from Inorder and LevelOrder
- Trapping Rain Water
- Kadane's Algorithm
- Find Missing And Repeating
- Excel Sheet | Part - 1
- Print Diagonally
- Parenthesis Checker
- Longest Common Subsequence
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Minimum Platforms
- Stock buy and sell
- Rearrange Array Alternately
- Relative Sorting
- Maximum of all subarrays of size k
- Sorting Elements of an Array by Frequency
- Minimum Cost of ropes
- Sum of Query II
- Stock span problem
- Handshakes
- Bleak Numbers
- Super Primes
- Coin Piles
- Next larger element
- Unique BST's
- Kth smallest element
- Largest prime factor
- Rearrange characters
- First non-repeating character in a stream
- Zero Sum Subarrays
- Huffman Encoding
- Nearly Sorted Algorithm
- Infix to Postfix
- Smallest Positive missing number
- Longest Common Prefix in an Array
- In First But Second
- Row with minimum number of 1's
- Maximum Tip Calculator
- Last two digits of Fibonacci