- Count nodes of linked list
- Node at a given index in linked list
- Count Leaves in Binary Tree
- Height of Binary Tree
- Finding middle element in a linked list
- Postorder Traversal
- Square root
- Doubly linked list Insertion
- Third largest element
- Minimum distance between two numbers
- Find triplets with zero sum
- Linked List Insertion
- Minimum element in BST
- Identical Linked Lists
- Maximum in Struct Array
- Triplet Family
- Start Coding - Python
- Space Seperated - Python
- Concatenating Strings - Python
- Who has the majority?
- Strongest Neighbour
- Array insert at end
- If conditional statement - C
- Self referential structures in C
- Start coding - C
- string input and iteration
- getchar and putchar - C
- Reversing an Array
- Check whether K-th bit is set or not
- Number is sparse or not
- Adding two matrices
- Search an Element in an array
- Maximum Occuring Character
- Binary String
- LCM And GCD
- GCD of Array
- Searching a number
- Sort The Array
- Pythagorean Triplet
- Majority Element
- Count possible triangles
- Rotate Array
- Permutations of a given string
- Missing number in array
- Array of alternate +ve and -ve no.s
- Maximum product of two numbers
- Segregate Even and Odd numbers
- Reverse sub array
- Immediate Smaller Element
- Sum of distinct elements
- Intersection of two arrays
- Convert array into Zig-Zag fashion
- Number of occurrence
- k largest elements
- Remove recurring digits
- Count the numbers
- Find the Odd Occurence
- Missing ranges of numbers
- Total count
- How many pizzas ?
- Reverse array in groups
- Mega Sale
- Professor and Parties
- Elements before which no element is bigger
- Minimize the sum of product
- Make a Distinct Digit Array
- Permutations in array
- King's War
- Stuffs Division
- Sort in specific order
- Check if two arrays are equal or not
- Form largest number from digits
- Check if string is rotated by two places
- Learning Output
- Rahul lucky-unlucky
- Minimize sum of alternate product
- Find first repeated character
- Geek and Coffee Shop
- Index of first 1 in a sorted array of 0’s and 1’s
- Does array represent Heap
- Find the element that appears once in sorted array
- Last index of One
- Arranging the array
- First element to occur k times
- Fighting the darkness
- Sorting Employees
- Count triplets with sum smaller than X
- First and last occurrences of X
- Positive and negative elements
- Find the fine
- Maximize ∑arr[i]*i of an Array
- Product of maximum in first array and minimum in second
- Most frequent word in an array of strings

Name

Dhiman Mayank

Institution

Rank in Institute

#2

Courses Attended

Other Profile Link

Overall Coding Score: 989

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
- Merge 2 sorted linked list in reverse order
- Detect Loop in linked list
- Remove duplicates from an unsorted linked list
- Insertion Sort
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Diameter of Binary Tree
- Nth node from end of linked list
- Left View of Binary Tree
- Merge two sorted linked lists
- Sum Tree
- Transform to Sum Tree
- Remove duplicate element from sorted Linked List
- Level order traversal in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Lowest Common Ancestor in a Binary Tree
- Determine if Two Trees are Identical
- Print all nodes that don't have sibling
- Lowest Common Ancestor in a BST
- 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
- Leaf at same level
- Sorted subsequence of size 3
- Expression Tree
- Check if Linked List is Palindrome
- Count distinct elements in every window
- Root to leaf paths sum
- Three way partitioning
- Print Common Nodes in BST
- Level order traversal
- Ancestors in Binary Tree
- Root to Leaf Paths
- Maximum path sum
- Reverse a string using Stack
- Construct Tree from Inorder & Preorder
- Vertical sum
- Check if Tree is Isomorphic
- Children Sum Parent
- Find length of Loop
- Height of Spiral Tree
- Sum of Leaf Nodes
- Check if two Nodes are Cousins
- Tilt of Binary Tree
- Delete middle element of a stack
- Vertical Width of a Binary Tree
- The New Line
- For Loop- primeCheck
- Start Coding - Java
- Count Odd Even
- Two Dimensional World
- Delete Array
- Get min at pop
- Repetitive Printing - Python
- If conditional statement- Python
- Intro to Lists - Python
- Set in Python - I
- Max and Second Max
- Searching in arranged array
- Sorting
- Sort Using MergeSort
- Mother Vertex
- Rightmost different bit
- GP Term
- Mean And Median of Array
- Minimum adjacent difference in a circular array
- Leaders in an array
- Count 1's in binary array
- Union of Two Sorted Arrays
- Subarray with given sum
- Print adjacency list
- Search in a matrix
- Linear Probing in Hashing
- Union-Find
- Sum of all substrings of a number
- Frequencies of Limited Range Array Elements
- Anagram
- Adding One
- Wave Array
- Maximum Gap
- Rotation
- Search in a Rotated Array
- Large Factorial
- Maximize Number of 1's
- Non Repeating Character
- Minimum number of Coins
- Sum of Middle Elements of two sorted arrays
- First Repeating Element
- Count Occurences of Anagrams
- Reverse words in a given string
- Move all zeroes to end of array
- Remove all duplicates from a given string
- Spirally traversing a matrix
- Sort an array of 0s, 1s and 2s
- Pairs with difference k
- Two numbers with sum closest to zero
- Finding Number
- Maximum value in a bitonic array
- Amount of Water
- Single Number
- Count increasing Subarrays
- Element that appears once where every element occurs twice
- Maximum Product Subarray
- Remove minimum elements
- Kth distance
- Addition of submatrix
- Maximum sum increasing subsequence
- Sum of two numbers represented as arrays
- Facing the sun
- Max Sum without Adjacents
- Key Pair
- Maximum Difference
- Product array puzzle
- Length Unsorted Subarray
- Count Smaller elements
- Subarray with given sum
- Leaders in an array
- Equal to product
- Segregate 0s and 1s
- Three Great Candidates
- Minimum element in a sorted and rotated array
- Search in a matrix
- 0 - 1 Knapsack Problem
- Maximize The Cut Segments
- Smallest number subset
- Equilibrium point
- Floor in a Sorted Array
- Maximize sum after K negations
- Equal Point in Sorted Array
- Sum of elements between k1'th and k2'th smallest elements
- Chocolate Distribution Problem
- Drive the car
- Next Greater Even Number
- Equal point in a string of brackets
- Find all pairs with a given sum
- Largest Fibonacci Subsequence
- Longest Palindromic Subsequence
- K-th element of two sorted Arrays
- Common elements
- Rod Cutting
- Fill array with 1's
- Element with left side smaller and right side greater
- Two numbers with odd occurrences
- Array Subset of another array
- Sort the pile of cards
- Four Elements
- Subarray with 0 sum
- Subarrays with given sum
- Sum equals to Sum
- Count the elements
- Minimum Number in a sorted rotated array
- Find distinct elements
- Maximum occured integer
- Ticket sellers
- Toppers Of Class
- Maximum number of zeroes
- Count the triplets
- Incomplete Array
- Winner of an election
- Non-Repeating Element
- Nearest multiple of 10
- Winner of an election
- Print Binary Tree levels in sorted order
- Smallest greater elements in whole array
- Are you "Perfect"
- Print adjacency list
- Pair with given sum in a sorted array
- Positive Negative Pair
- Exchange matrix columns
- Reversing the columns of a Matrix
- Interchanging the rows of a Matrix
- Count 1's in binary array
- Naive Pattern Search
- Search Query for Strings

- Reverse a Linked List in groups of given size.
- 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
- Add all greater values to every node in a BST
- Construct Binary Tree from Parent Array
- Connect Nodes at Same Level
- Clone a linked list with next and random pointer
- Flattening a Linked List
- Diagonal Traversal of Binary Tree
- Boundary Traversal of binary tree
- Detect cycle in a directed graph
- Detect cycle in an undirected graph
- Min distance between two given nodes of a Binary Tree
- Maximum difference between node and its ancestor
- The Celebrity Problem
- Topological sort
- Vertical Traversal of Binary Tree
- Merge K sorted linked lists
- Find the number of islands
- Serialize and Deserialize a Binary Tree
- Circular tour
- Make Binary Tree From Linked List
- Check if subtree
- Extreme nodes in alternate order
- Remove loop in Linked List
- Implementing Dijkstra | Set 1 (Adjacency Matrix)
- Minimum Spanning Tree
- Multiply two strings
- Strongly Connected Components (Kosaraju's Algo)
- Bipartite Graph
- Find the Closest Element in BST
- Merge two BST 's
- Merge k Sorted Arrays
- Print Nodes having K leaves
- Top View of Binary Tree
- Binary Tree to CDLL
- Count More than n/k Occurences
- Populate Inorder Successor for all nodes
- K-Sum Paths
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Node at distance
- Maximum path sum from any node
- Leaves to DLL
- Construct Tree from Preorder Traversal
- Convert Level Order Traversal to BST
- Count Number of SubTrees having given Sum
- Swap Kth nodes from ends
- Add two numbers represented by Linked List
- Smallest Positive missing number
- Stock buy and sell
- Check if array is sorted and rotated
- Possible paths between 2 vertices
- Parenthesis Checker
- Maximum Rectangular Area in a Histogram
- Largest number in K swaps
- M-Coloring Problem
- Count ways to reach the n'th stair
- Longest Common Subsequence
- Coin Change
- Kadane's Algorithm
- Find Missing And Repeating
- Maximum Index
- Longest Increasing Subsequence
- Parenthesis Checker
- Longest Common Subsequence
- Minimum number of jumps
- Edit Distance
- nCr
- Maximum Rectangular Area in a Histogram
- Min Coin
- Trapping Rain Water
- Subset Sum Problem
- Number of Coins
- Minimum Platforms
- Stock buy and sell
- Largest Number formed from an Array
- Number of paths in a matrix with k coins
- Possible words from Phone digits
- Jumping Numbers
- Longest Palindrome in a String
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Relative Sorting
- Maximum of all subarrays of size k
- Row with max 1s
- Boolean Matrix Problem
- Minimum Cost of ropes
- Inversion of array
- Preorder to Postorder
- Longest consecutive subsequence
- Stock span problem
- M-Coloring Problem
- Possible groups
- Preorder Traversal and BST
- Minimum sum
- Digit multiplier
- Next larger element
- X Total Shapes
- Word Break
- Kth smallest element
- 3 Divisors
- Longest Common Substring
- Knight Walk
- Distance of nearest cell having 1
- Find whether path exist
- Unit Area of largest region of 1's
- K
^{th}largest element in a stream - Zero Sum Subarrays
- Smallest distinct window
- Infix to Postfix
- Find minimum s-t cut in a flow network
- Smallest Positive missing number
- Maximum sum Rectangle
- Job Sequencing Problem
- Rotten Oranges
- Longest Common Prefix in an Array
- In First But Second
- Subarrays with equal 1s and 0s
- Make Matrix Beautiful
- Smaller on Left
- Closer to sort
- Count only Repeated
- Height Using Parent Array
- Level of Nodes
- K Most occurring elements
- Check if array is sorted and rotated clockwise
- Kth largest element
- Range Min Max Queries
- Renaming Cities

- Binary Tree to DLL
- Longest Palindromic Substring in Linear Time
- Fixing Two nodes of a BST
- Number of Turns in Binary Tree
- Merge Without Extra Space
- Maximum of minimum for every window size
- Merge Without Extra Space
- Allocate minimum number of pages
- Ugly Numbers
- Longest valid Parentheses
- Find median in a stream
- Max Circular Subarray Sum
- Longest Zig-Zag Sub Sequence
- The Newtonian Tree

Published Count(27)

- Begin Search
- Positive Negative Pair
- Left Index
- Customized Sort
- The rotating axle
- Smaller on Left
- Closer to sort
- The Newtonian Tree
- Count only Repeated
- Median of Two sorted arrays
- Merge three sorted arrays
- Height Using Parent Array
- Level of Nodes
- K Most occurring elements
- Union of Two Sorted Arrays
- Intersection of two sorted arrays
- Naive Pattern Search
- Distinct Pattern Search
- Smaller on Right
- Kth largest element
- Kth smallest element
- Contiguous Elements XOR
- Search Query for Strings
- Renaming Cities
- Camel Case
- Largest Sum Contiguous Subarray in Range
- test

Published Count(120)

- Start Coding
- The New Line
- Data Types
- The Size of
- Taking input
- Learn to Comment
- GetLine and Ignore
- Bitwise Operators
- Even Odd
- Step by Step Condition
- Start Coding - Java
- The New Line - Java
- Data Types - Java
- Taking input - Java
- Learn to Comment - Java
- nextLine and next
- Precise Fomat - Java
- logical Operators - Java
- Bitwise Operators - Java
- Even Odd - Java
- For Loop- primeCheck - Java
- While loop- printTable - Java
- Step by Step Condition - Java
- Count Odd Even
- Need Some Change
- Count the Specials
- Predict the Column
- Even Subsets
- Almost Equal
- Count Odd Even - Java
- Need Some Change - Java
- Count the Specials - Java
- Matrix Interchange - Java
- Predict the Column - Java
- Magic in CPP
- Two Dimensional World
- Delete Array
- Pair in Java
- Maximum Area Rectangle
- Sum of Big Integers
- BigInteger Multiply
- BigInteger mod
- Find the Frequency
- Back to Front
- Student of the Year
- ArrayList Operation
- Operations on ArrayList
- Stack Operations
- Queue Operations
- Operations on PriorityQueue
- Deque Implementations
- Min Heap implementation
- Frequency Game
- Greater and Smaller Ones
- Start Coding - Python
- Space Seperated - Python
- Repetitive Printing - Python
- Concatenating Strings - Python
- Operators in Python
- Comment in Python
- Increment and Decrement - Python
- If conditional statement- Python
- Check the status - Python
- Mark Even and Odd - Python
- While loop in Python
- Jumping through While - Python
- Welcome aboard - Python
- Slicing in String - Python
- Repeat the Strings - Python
- String Functions - II - Python
- Intro to Lists - Python
- Iterating through Lists - Python
- Count Even Odd - Python
- Functions in Lists - Python
- Average_Min_Max - Python
- Sorting in Lists - Python
- Intro to Dictionary - Python
- Dictionary in Python - II
- Dictionary in Python - III
- Set in Python - I
- Set in Python - II
- Search Begins
- Max and Second Max
- Strongest Neighbour
- Searching in arranged array
- Sorting
- Sort Using MergeSort
- Pattern Search KMP
- Rabin Karp - Pattern Searching
- Implementing Floor in BST
- Implementing Ceil in BST
- Pair Sum in BST
- Queue using circular array
- Find first set bit
- Rightmost different bit
- Check whether K-th bit is set or not
- Count total set bits
- Bit Difference
- Number is sparse or not
- Longest Consecutive 1's
- Gray Code
- Gray to Binary equivalent
- Power of 2
- Swap all odd and even bits
- Maximum AND Value
- Left Index
- Smaller on Right
- Union of Two Sorted Arrays
- Intersection of two sorted arrays
- Merge three sorted arrays
- Closer to sort
- Level of Nodes
- K closest numbers
- Level of Nodes
- Naive Pattern Search
- Distinct Pattern Search
- Kth largest element
- Kth smallest element
- K Most occurring elements
- Detect Cycle using DSU