- Count nodes of linked list
- Node at a given index in linked list
- Size of Binary Tree
- Inorder Traversal
- Bubble Sort
- Count Leaves in Binary Tree
- Height of Binary Tree
- Postorder Traversal
- Square root
- Preorder Traversal
- Find triplets with zero sum
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Absolute Value
- 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
- Gray to Binary equivalent
- Power of 2
- Tower Of Hanoi
- Rotate Array
- Search an Element in an array
- Searching an element in a sorted array
- 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
- Binary String
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Intersection of two arrays
- Print first n Fibonacci Numbers
- Check if two arrays are equal or not
- First element to occur k times
- Uncommon characters

Name

Naman Sharma

Institution

Rank in Institute

#12

Courses Attended

Overall Coding Score: 666

Monthly Coding Score: 430

Weekly Coding Score: 218

- Insertion 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
- Left View of Binary Tree
- Merge two sorted linked lists
- Level order traversal in spiral form
- DFS of Graph
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Level order traversal Line by Line
- Josephus problem
- Three way partitioning
- Level order traversal
- Peak element
- Ancestors in Binary Tree
- Maximum path sum
- Children Sum Parent
- Reverse First K elements of Queue
- ZigZag Tree Traversal
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- Get min at pop
- Max and Second Max
- Hashing for pair - 1
- Hashing for pair - 2
- Fibonacci Numbers - Top Down DP
- Fibonacci Numbers - Bottom Up DP
- Mother Vertex
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Minimum adjacent difference in a circular array
- Power Of Numbers
- 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
- Inversion of array
- Union of Two Sorted Arrays
- Intersection of two sorted arrays
- Closet 0s 1s and 2s
- 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
- Naive Pattern Search
- Distinct Pattern Search
- Linear Probing in Hashing
- Quadratic Probing in Hashing
- Count Non-Repeated Elements
- Print Non-Repeated Elements
- Evaluation of Postfix Expression
- Activity Selection
- N meetings in one room
- Largest number with given sum
- Count Total Digits in a Number
- Digital Root
- Power Set Using Recursion
- First Repeating Element
- Numbers containing 1, 2 and 3

- 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
- Connect Nodes at Same Level
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Delete a node from BST
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Merge K sorted linked lists
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Make Binary Tree From Linked List
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- Minimum Swaps to Sort
- Strongly Connected Components (Kosaraju's Algo)
- Find the Closest Element in BST
- Delete keys in a Linked list
- Merge two BST 's
- Merge k Sorted Arrays
- Length of longest palindrome in linked list
- Merge Sort on Doubly Linked List
- Binary Tree to CDLL
- Count More than n/k Occurences
- Foldable Binary Tree
- Maximum path sum from any node
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Maximum sum of Non-adjacent nodes
- Rabin Karp - Pattern Searching
- 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
- Trapping Rain Water
- Stock buy and sell
- 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
- Case-specific Sorting of Strings
- Lexicographic Rank Of A String
- 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
- Minimum Cost of ropes
- Nearly sorted
- Rearrange characters
- Minimum Platforms
- Largest number in K swaps
- Rat Maze With Multiple Jumps
- Black and White
- Combination Sum
- Subsets
- Relative Sorting
- Renaming Cities
- Smaller on Right
- Count only Repeated
- The Painter's Partition Problem
- Steps by Knight
- Rotten Oranges
- Zero Sum Subarrays
- Find whether path exist
- Kth smallest element
- X Total Shapes
- Palindromic Array
- Preorder to Postorder

- Binary Tree to DLL
- Fixing Two nodes of a BST
- Pattern Search KMP
- Merge Without Extra Space
- Find median in a stream
- Solve the Sudoku
- Minimum Cost Path
- Count the subarrays having product less than k
- Median of Two sorted arrays
- Contiguous Elements XOR
- Allocate minimum number of pages
- Largest Sum Contiguous Subarray in Range