- Count nodes of linked list
- Bubble Sort
- Square root
- Implement strstr
- Find triplets with zero sum
- Who has the majority?
- Strongest Neighbour
- Array insert at index
- Array insert at end
- Reversing an Array
- Absolute Value
- Convert Celsius To Fahrenheit
- Check whether K-th bit is set or not
- Quadratic Equation Roots
- Count total set bits
- Bit Difference
- Number is sparse or not
- Gray Code
- Gray to Binary equivalent
- Power of 2
- Tower Of Hanoi
- Reverse array in groups
- 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
- Determinant of a Matrix
- Check if a string is Isogram or not
- Binary String
- Check if string is rotated by two places
- Check if strings are rotations of each other or not
- Maximum Occuring Character
- Remove common characters and concatenate
- Sum of numbers in string
- Repeating Character - First Appearance Leftmost
- Sum of Digits of a Number
- Power Using Recursion
- Fibonacci Using Recursion
- Addition Under Modulo
- Multiplication Under Modulo
- Check if two arrays are equal or not
- Intersection of two arrays
- Union of two arrays
- Keypad typing
- Reverse array in groups

Name

Arjun Sharma

Organization

Courses Attended

Overall Coding Score: 802

Monthly Coding Score: 0

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
- Remove duplicates from an unsorted linked list
- Insertion Sort
- Quick Sort
- 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
- 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
- Implement two stacks in an array
- Binary Heap Operations
- Level order traversal Line by Line
- Josephus problem
- Check if Linked List is Palindrome
- Three way partitioning
- Level order traversal
- Peak element
- Merge Sort for Linked List
- Counting Sort
- Children Sum Parent
- Find length of Loop
- Reverse First K elements of Queue
- 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
- Pairwise swap of nodes in LinkeList
- Mother Vertex
- Find first set bit
- Rightmost different bit
- Factorial Of Number
- Digits In Factorial
- GP Term
- Primality Test
- Longest Consecutive 1's
- Exactly 3 Divisors
- Mean And Median
- Modular Multiplicative Inverse
- Swap all odd and even bits
- Maximum AND Value
- 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
- 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
- Sort by Absolute Difference
- Triplet Sum in Array
- Print adjacency list
- 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
- 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
- Anagram
- Subarray with 0 sum
- Winner of an election
- Subarray range with given sum
- Isomorphic Strings
- The Modified String
- Reverse words in a given string
- Smallest window in a string containing all the characters of another string
- Minimum indexed character
- Pangram Checking
- Non Repeating Character
- Count Total Digits in a Number
- Digital Root
- Power Set Using Recursion
- Count number of hops
- Nth number made of prime digits
- First Repeating Element
- Positive Negative Pair
- Numbers containing 1, 2 and 3
- Count number of hops
- Reach a given score
- Equilibrium point

- 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
- Detect cycle in an undirected graph
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Print a Binary Tree in Vertical Order
- 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
- Minimum Swaps to Sort
- 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
- 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
- Swap Kth nodes from ends
- 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
- Maximum Index
- Trapping Rain Water
- Stock buy and sell
- 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
- 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
- Stock span problem
- Next larger element
- Infix to Postfix
- Maximum of all subarrays of size k
- Kth largest element
- Kth smallest element
- K Most occurring elements
- Minimum Cost of ropes
- Nearly sorted
- Rearrange characters
- Minimum Platforms
- Largest number in K swaps
- Rat Maze With Multiple Jumps
- Black and White
- M-Coloring Problem
- Count ways to reach the n'th stair
- Count ways to N'th Stair(Order does not matter)
- nCr
- Longest Increasing Subsequence
- Job Sequencing Problem
- Count ways to reach the n'th stair
- Rotten Oranges
- CamelCase Pattern Matching
- Steps by Knight
- Next higher palindromic number using the same set of digits
- Count only Repeated
- Smaller on Right
- Range Sum Queries
- Renaming Cities
- Camel Case
- Zero Sum Subarrays
- Find whether path exist
- Trie | (Insert and Search)
- Kth smallest element
- X Total Shapes
- M-Coloring Problem
- Relative Sorting
- Subset Sum Problem
- nCr
- Count ways to N'th Stair(Order does not matter)
- Minimum number of jumps

- Binary Tree to DLL
- Fixing Two nodes of a BST
- Pattern Search KMP
- Max Circular Subarray Sum
- Merge Without Extra Space
- Maximum of minimum for every window size
- Solve the Sudoku
- Strongly connected component (Tarjans's Algo)
- Minimum Cost Path
- Allocate minimum number of pages
- Median of Two sorted arrays
- Contiguous Elements XOR
- Largest Sum Contiguous Subarray in Range