- Count nodes of linked list
- Inorder Traversal
- Bubble Sort
- Height of Binary Tree
- Postorder Traversal
- Implement Stack using Linked List
- Implement stack using array
- Doubly linked list Insertion at given position
- Preorder Traversal
- Search a node in BST
- Linked List Insertion
- Minimum element in BST
- Identical Linked Lists
- Queue Reversal
- Insert in Middle of Linked List
- 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
- Quadratic Equation Roots
- Search an Element in an array
- Searching an element in a sorted array
- Adding two matrices
- Generate Binary Numbers
- k largest elements
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Print first n Fibonacci Numbers
- Rotate Array
- Intersection of two arrays
- Union of two arrays
- Check if two arrays are equal or not

Name

Aditya Chandra

Rank in Institute

#160

Courses Attended

Campus Ambassador

Overall Coding Score: 663

Monthly Coding Score: 565

Weekly Coding Score: 0

- Reverse a linked list
- Rotate a Linked List
- Given a linked list of 0s, 1s and 2s, sort it.
- Add two numbers represented by linked lists
- Detect Loop in linked list
- Right View of Binary Tree
- Mirror Tree
- 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
- Queue using two Stacks
- Remove duplicate element from sorted Linked List
- Stack using two queues
- 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
- Lowest Common Ancestor in a BST
- Implement two stacks in an array
- Binary Heap Operations
- Level order traversal Line by Line
- Print BST elements in given range
- Josephus problem
- Check if Linked List is Palindrome
- Print Common Nodes in BST
- Level order traversal
- Merge Sort for Linked List
- Huffman Decoding
- Children Sum Parent
- Find length of Loop
- Reverse First K elements of Queue
- ZigZag Tree Traversal
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- The New Line
- Data Types
- Taking input
- Learn to Comment
- GetLine and Ignore
- Count Odd Even
- Need Some Change
- Matrix Interchange
- Predict the Column
- Xoring and Clearing
- Consonants and Vowels check
- Almost Equal
- Get min at pop
- Hashing for pair - 1
- Hashing for pair - 2
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Coin Change - Number of ways
- Coin Change - Minimum number of coins
- Kadane's Algorithm - I
- Kadane's Algorithm - II
- Pairwise swap of nodes in LinkeList
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Mother Vertex
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Mean And Median of Array
- Minimum adjacent difference in a circular array
- Power Of Numbers
- Print adjacency list
- Separate chaining in Hashing
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Subarray with 0 sum
- Winner of an election
- Subarray range with given sum
- Removing consecutive duplicates
- Removing consecutive duplicates - 2
- Evaluation of Postfix Expression
- Activity Selection
- Largest number with given sum
- Count Total Digits in a Number
- Digital Root
- Union-Find
- Number of Connected Components
- Detect Cycle using DSU
- Minimum Spanning Tree using Kruskal
- Ways to write n as sum
- Stickler Thief
- Count number of hops
- Sum of all substrings of a number
- 0 - 1 Knapsack Problem
- Maximize The Cut Segments
- Number of Unique Paths
- Search Query for Strings
- Positive Negative Pair
- Numbers containing 1, 2 and 3
- Shortest Common Supersequence
- Nth catalan number
- Anagram
- Reach a given score
- First Repeating Element

- Count BST nodes that lie in a given range
- Check for BST
- Tree from Postorder and Inorder
- Bottom View of Binary Tree
- Delete without head pointer
- Intersection Point in Y Shapped Linked Lists
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Delete a node from BST
- Detect cycle in a directed graph
- Maximum difference between node and its ancestor
- Topological sort
- Vertical Traversal of Binary Tree
- Merge K sorted linked lists
- Find the number of islands
- Make Binary Tree From Linked List
- Check if subtree
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- LRU Cache
- Strongly Connected Components (Kosaraju's Algo)
- Max sum subarray by removing at most one element
- Find the Closest Element in BST
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- Binary Tree to CDLL
- Foldable Binary Tree
- Node at distance
- Maximum path sum from any node
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Largest Sum Contiguous Subarray in Range
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Maximum sum of Non-adjacent nodes
- Implementing Floor in BST
- Implementing Ceil in BST
- Pair Sum in BST
- Possible paths between 2 vertices
- Distance of nearest cell having 1
- Unit Area of largest region of 1's
- Subarrays with equal 1s and 0s
- Sorting Elements of an Array by Frequency
- Longest consecutive subsequence
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Stock span problem
- Next larger element
- Infix to Postfix
- Maximum of all subarrays of size k
- Kth largest element
- Kth smallest element
- Kth largest element in a stream
- K Most occurring elements
- Minimum Cost of ropes
- Nearly sorted
- Rearrange characters
- Job Sequencing Problem
- Largest number in K swaps
- Rat Maze With Multiple Jumps
- Black and White
- Combination Sum
- Subsets
- M-Coloring Problem
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- Egg Dropping Puzzle
- Optimal Strategy For A Game
- nCr
- Longest Increasing Subsequence
- Longest Common Subsequence
- Range GCD Queries
- Camel Case
- Renaming Cities
- Range Min Max Queries
- Range Sum Queries
- Range LCM Queries
- Smaller on Right
- Count only Repeated
- Minimum number of jumps
- Range Longest Correct Bracket Subsequence Queries
- Subset Sum Problem
- Steps by Knight
- Rotten Oranges
- Relative Sorting
- Preorder to Postorder
- Zero Sum Subarrays
- X Total Shapes
- Find whether path exist
- Trie | (Insert and Search)
- Unique BST's