Name

Akhya Sharma

Organization

Courses Attended

Overall Coding Score: 547

Monthly Coding Score: 547

Weekly Coding Score: 0

- Count nodes of linked list
- Inorder Traversal
- Height of Binary Tree
- Postorder Traversal
- Square root
- Preorder Traversal
- Search a node in BST
- Linked List Insertion
- Minimum element in BST
- Identical Linked Lists
- Insert in Middle of Linked List
- Array insert at index
- Array insert at end
- Convert Celsius To Fahrenheit
- Check whether K-th bit is set or not
- Count total set bits
- Bit Difference
- Number is sparse or not
- Binary To Gray Code equivalent
- Tower Of Hanoi
- Searching an element in a sorted array
- Left Index
- Adding two matrices
- Multiply the matrices
- Print Matrix in snake Pattern
- Transpose of Matrix
- Rotate by 90 degree
- Determinant of a Matrix
- Sum of Digits of a Number
- Fibonacci Using Recursion
- Multiplication Under Modulo
- Intersection of two arrays
- Check if two arrays are equal or not

- 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
- Remove duplicates from an unsorted linked list
- Right View of Binary Tree
- Mirror Tree
- Diameter of Binary Tree
- Check for Balanced Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Remove duplicate element from sorted Linked List
- 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
- 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
- Peak element
- Merge Sort for Linked List
- Children Sum Parent
- Find length of Loop
- ZigZag Tree Traversal
- Vertical Width of a Binary Tree
- Hashing for pair - 1
- Hashing for pair - 2
- Pairwise swap of nodes in LinkeList
- Inorder traversal of a BST
- Levelorder traversal of a BST
- Mother Vertex
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Mean And Median of Array
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Power Of Numbers
- Equilibrium point
- Count 1's in binary array
- Floor in a Sorted Array
- Minimum Number in a sorted rotated array
- Two Repeated Elements
- Roof Top
- Subarray with given sum
- Sort by Absolute Difference
- Triplet Sum in Array
- Print adjacency list
- Spirally traversing a matrix
- Search in a row-column sorted Matrix
- Interchanging the rows of a Matrix
- Reversing the columns of a Matrix
- Boundary traversal of matrix
- Exchange matrix columns
- 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
- Count Total Digits in a Number
- Digital Root
- Stickler Thief
- 0 - 1 Knapsack Problem
- Lucky Numbers
- Maximize The Cut Segments
- First Repeating Element
- Number of Unique Paths
- Positive Negative Pair
- Numbers containing 1, 2 and 3
- Maximize The Cut Segments

- Count BST nodes that lie in a given range
- Check for BST
- 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
- Detect cycle in an undirected 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
- Serialize and Deserialize a Binary Tree
- 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
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Find the Closest Element in BST
- Merge two BST 's
- Merge Sort on Doubly Linked List
- Count More than n/k Occurences
- Foldable Binary Tree
- Node at distance
- Maximum path sum from any node
- Convert Level Order Traversal to BST
- 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
- Smallest Positive missing number
- Possible Words From Phone Digits
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Maximum Index
- Trapping Rain Water
- Check if array is sorted and rotated
- Kadane's Algorithm
- Number of pairs
- Merge three sorted arrays
- Closer to sort
- Possible paths between 2 vertices
- Level of Nodes
- Make Matrix Beautiful
- Boolean Matrix Problem
- 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
- Minimum Platforms
- Optimal Strategy For A Game
- Smaller on Right
- Count only Repeated
- Steps by Knight
- Rotten Oranges
- Zero Sum Subarrays
- Find whether path exist
- Kth smallest element
- Unique BST's
- Preorder to Postorder
- Boolean Matrix Problem
- Relative Sorting
- Subset Sum Problem