saurabhshadow
STREAK
00/1457
days
Longest streak/Global longest streak
Language Used
C++, C, Java
Coding Score
587
Problem Solved
198
Contest Rating
__
218 points
Contributor
218 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
0 submissions in current year
SCHOOL (1)
BASIC (6)
EASY (70)
MEDIUM (107)
HARD (14)
- Minimum Cost of Gas
- Tower Construction
- Continuous Series
- Reverse a linked list
- Frequency in a Linked List
- Node at a given index in linked list
- Check for BST
- Right View of Binary Tree
- K distance from root
- Mirror Tree
- Two Mirror Trees
- Delete without head pointer
- Balanced Tree Check
- Middle of a Linked List
- Transform to Sum Tree
- Find Transition Point
- Lowest Common Ancestor in a BST
- Odd even level difference
- Binary Tree to BST
- Equilibrium index of an array
- Expression Tree
- Max distance between same elements
- Longest Consecutive Subsequence
- Kth largest element in BST
- Max Level Sum in Binary Tree
- Three way partitioning
- Inorder Successor in BST
- Index of an Extra Element
- Reverse Using Stack
- Full Binary Tree
- Triplet with 0 sum in BST
- Delete Alternate Nodes
- Construct BST from Postorder
- Count Pairs whose sum is equal to X
- Remove Half Nodes
- Brothers From Different Roots
- Matrix Interchange - Java
- Frequencies in a Limited Array
- Equilibrium Point
- Array Leaders
- Floor in a Sorted Array
- Minimum Cost of ropes
- N meetings in one room
- Missing in Array
- Product array puzzle
- Missing And Repeating
- Buildings receiving sunlight
- Find Kth Rotation
- Minimum Energy
- Common in 3 Sorted Arrays
- Move All Zeroes to End
- Min Subsets with Consecutive Numbers
- Count the triplets
- Bitonic Point
- Smallest subarray with sum greater than x
- Single Number
- Count increasing Subarrays
- Facing the sun
- Check if array contains contiguous integers
- Rearrange to Make arr[i] = i
- Convert an array to reduced form
- Largest Fibonacci Subsequence
- Two sum -Pairs with 0 Sum
- Segregate 0s and 1s
- Count the Zeros
- Length of longest subarray
- Sum of Lengths of Non-Overlapping SubArrays
- Left out candies
- Shortest path from 1 to n
- Print Diagonally
- Add Number Linked Lists
- Detect Loop in linked list
- Count BST nodes that lie in a given range
- Bottom View of Binary Tree
- Diameter of a Binary Tree
- Add all greater values to every node in a BST
- Sum Tree
- Connect Nodes of Levels
- Flattening a Linked List
- Tree Boundary Traversal
- Reverse alternate levels of a perfect binary tree
- Delete a node from BST
- Directed Graph Cycle
- Undirected Graph Cycle
- Max sum path in two arrays
- Largest subarray with 0 sum
- Topological sort
- Merge K sorted linked lists
- Check if subtree
- Clone a Binary Tree
- Dijkstra Algorithm
- Largest BST
- Sorted subsequence of size 3
- Sum of subset differences
- Minimum Swaps to Sort
- Maximum Difference
- Strongly Connected
- Rat in a Maze Problem - I
- Bipartite Graph
- Closest in BST
- Delete keys in a Linked list
- Merge two BST 's
- Duplicate Subtree
- k-th Smallest in BST
- Find Common Nodes in two BSTs
- Peak element
- Polynomial Addition
- Binary Tree to CDLL
- Pair Sum in BST
- Counting elements in two arrays
- Foldable Binary Tree
- Leftmost and rightmost nodes of binary tree
- Construct Tree from Inorder & Preorder
- Vertical sum
- Predecessor and Successor
- Leaves to DLL
- Diagonal sum in binary tree
- Kth Ancestor in a Tree
- Count Number of SubTrees having given Sum
- Maximum sum of Non-adjacent nodes
- Smallest Positive Missing
- Wave Array
- Rearrange an array with O(1) extra space
- Kadane's Algorithm
- Count Inversions
- Unique BST's
- Indexes of Subarray Sum
- Merge Without Extra Space
- Boolean Matrix
- Unit Area of largest region of 1's
- Subarrays with equal 1s and 0s
- Longest Consecutive Subsequence
- Stock span problem
- Next Greater Element
- K Sized Subarray Maximum
- Kth smallest element
- Job Sequencing Problem
- Minimum Platforms
- M-Coloring Problem
- Stickler Thief
- 0 - 1 Knapsack Problem
- Allocate Minimum Pages
- X Total Shapes
- Zero Sum Subarrays
- Kth Smallest
- Rotten Oranges
- Steps by Knight
- Overlapping Intervals
- Stock Buy and Sell – Multiple Transaction Allowed
- Sort 0s, 1s and 2s
- Complement
- Maximum Index
- Top k numbers in a stream
- Maximize Number of 1's
- Sum of Middle elements of two sorted arrays
- Sum of bit differences
- Form the Largest Number
- Row with max 1s
- Design a tiny URL or URL shortener
- Rotate a Matrix
- Longest Subarray with Sum K
- Sum of XOR of all pairs
- Smallest distinct window
- Tic Tac Toe
- Possible groups
- Rod Cutting
- Number of pairs
- First negative in every window of size k
- Subarrays Product Less than K
- Subset Sums
- Longest alternating subsequence
- Stream First Non-repeating
- Snake and Ladder Problem
- Check Mirror in N-ary tree
- Count the paths
- Negative weight cycle
- Flood fill Algorithm
- Binary Tree to DLL
- Min distance between two given nodes of a Binary Tree
- Alien Dictionary
- Smallest range in K lists
- Nodes at given distance in binary tree
- Fixing Two nodes of a BST
- Max Path Sum 2 Special Nodes
- Trapping Rain Water
- Max Circular Subarray Sum
- Find median in a stream
- Minimum Cost Path
- Next Smallest Palindrome
- Count Pairs in an Array
- Ugly Numbers
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy