Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
N
nikhilkumarmishra120
STREAK
00/1547
days
Longest streak/Global longest streak
Language Used
C++, Java, Python
Coding Score
641
Problem Solved
224
Contest Rating
__
69 points
Contributor
69 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
1 submissions in current year
SCHOOL (0)
BASIC (15)
EASY (67)
MEDIUM (127)
HARD (15)
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Check for BST
- Binary Tree from Inorder and Postorder
- Bottom View of Binary Tree
- Diameter of a Binary Tree
- Heap Sort
- Sum Tree
- Construct Binary Tree from Parent Array
- Connect Nodes of Levels
- Flattening a Linked List
- Tree Boundary Traversal
- Delete a node from BST
- LCA in Binary Tree
- Maximum difference between node and its ancestor
- Lowest Common Ancestor in a BST
- Binary Heap Operations
- The Celebrity Problem
- Largest subarray with 0 sum
- Topological sort
- Vertical Tree Traversal
- Max sum in the configuration
- Wildcard Pattern Matching
- Linked List to Binary Tree
- Check if subtree
- Remove loop in Linked List
- Largest BST
- Count Palindromic Subsequences
- Minimum Swaps to Sort
- Count of distinct substrings
- Strongly Connected
- Rat in a Maze
- Closest in BST
- BST with Dead End
- Merge two BST 's
- Merge k Sorted Arrays
- Top View of Binary Tree
- k-th Smallest in BST
- Find Common Nodes in two BSTs
- Level order traversal
- Peak element
- Binary Tree to CDLL
- Populate Inorder Successor for all nodes
- Foldable Binary Tree
- Count the nodes at distance K from leaf
- Isomorphic Trees
- Maximum path sum
- Predecessor and Successor
- Children Sum in a Binary Tree
- Duplicate Subtrees
- Sum of nodes on the longest path
- Convert Level Order Traversal to BST
- ZigZag Tree Traversal
- Count Number of SubTrees
- Vertical Width of a Binary Tree
- Maximum Non-Adjacent Nodes Sum
- Floor in BST
- Ceil in BST
- Pair Sum in BST
- Count set bits
- Rearrange Array Alternately
- Rearrange an array with O(1) extra space
- Stock buy and sell
- Kadane's Algorithm
- Count Inversions
- Union of 2 Sorted Arrays
- Triplet Sum in Array
- Subarray with 0 sum
- Longest Consecutive Subsequence
- Kth largest element in a stream
- Minimum Cost of ropes
- Nearly sorted
- Find median in a stream
- Rearrange characters
- Activity Selection
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- M-Coloring Problem
- Minimum Jumps
- Stickler Thief
- Ways to Reach the n'th Stair
- Egg Dropping Puzzle
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Allocate Minimum Pages
- Preorder to BST
- Zero Sum Subarrays
- Kth Smallest
- Shortest Common Supersequence
- Steps by Knight
- Smaller on Right
- Maximize The Cut Segments
- Word Break
- Search in Rotated Sorted Array
- Max Score from Subarray Mins
- Maximum Product Subarray
- Row with max 1s
- Form a palindrome
- Max Sum without Adjacents
- Find length of longest subsequence
- Longest Common Substring
- K-th element of two Arrays
- Rod Cutting
- First and Last Occurrences
- Minimum Deletions
- Minimum number of deletions and insertions
- Max Sum Increasing Subsequence
- Coin Change (Count Ways)
- String Subsequence
- Coin Change (Minimum Coins)
- Kth Smallest Factor
- Knapsack with Duplicate Items
- nCr
- Maximum path sum in matrix
- Partition Equal Subset Sum
- Subset Sums
- Return two prime numbers
- Find nth root of m
- Longest Repeating Subsequence
- LCS
- Minimum Multiplications to reach End
- Rectangles and Squares
- Geekland Colosseum
- Maximum Sum Combination
- Replace elements by its rank in the array
- Floor in BST
- Sahil love good scorer
- Reverse a linked list
- Delete nodes having greater value on right
- Inorder Traversal
- Right View of Binary Tree
- Mirror Tree
- Maximum Width of Tree
- Height of Binary Tree
- Balanced Tree Check
- Kth from End of Linked List
- Check If Circular Linked List
- Left View of Binary Tree
- Transform to Sum Tree
- Remove Duplicates from a Sorted Linked List
- Postorder Traversal
- Level Order in spiral form
- Reverse Level Order Traversal
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Square Root
- Binary Search
- Level Order Line by Line
- BST Keys in a Range
- Binary Tree to BST
- Leaves at Same Level or Not
- Search a node in BST
- Kth largest element in BST
- Minimum element in BST
- Find Sum Pairs Across Two BSTs
- Power of 2
- Array Leaders
- Floor in a Sorted Array
- K largest elements
- N meetings in one room
- Union of Arrays with Duplicates
- Count Triplets
- Missing And Repeating
- Find Kth Rotation
- Left or Right Positioned Array
- Search in a Row-Column sorted matrix
- Missing number
- Find Pair Given Difference
- Bitonic Point
- Second Largest
- Number of occurrence
- Check if array is sorted
- Two sum -Pairs with 0 Sum
- Count the Zeros
- Comparator Sort Coordinates
- Number of 1 Bits
- Nth Fibonacci Number
- Minimum Swaps
- Same characters
- Sorted array
- String Matching
- Problem Setting at GFG
- Assign Tasks
- Maximum Number
- Complete the Staircase
- Maximum Frequency
- Even subarray sum
- Police Station
- Count the Substrings
- Kth Mex
- Array to Linked List
- Unique Positions
- Binary Tree to DLL
- Min distance between two given nodes of a Binary Tree
- Serialize and deserialize a binary tree
- Max rectangle
- Alien Dictionary
- Fixing Two nodes of a BST
- Trapping Rain Water
- Max Circular Subarray Sum
- Histogram Max Rectangular Area
- Burning Tree
- Edit Distance
- Minimum sum partition
- Median in a row-wise sorted Matrix
- Word Break - 2
- Interesting Queries