shashank_sharma
STREAK
00/1466
days
Longest streak/Global longest streak
Language Used
C++, Python, C
Coding Score
225
Problem Solved
81
Contest Rating
__
396 points
Contributor
396 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 (0)
BASIC (10)
EASY (23)
MEDIUM (39)
HARD (9)
- Bottom View of Binary Tree
- Delete without head pointer
- Diameter of a Binary Tree
- Connect Nodes of Levels
- Directed Graph Cycle
- Undirected Graph Cycle
- LCA in Binary Tree
- Topological sort
- Vertical Tree Traversal
- Find the number of islands
- Dijkstra Algorithm
- Palindrome Linked List
- Count distinct elements in every window
- Delete nodes greater than k
- Reverse array in groups
- Indexes of Subarray Sum
- Unit Area of largest region of 1's
- K Sized Subarray Maximum
- Egg Dropping Puzzle
- Minimum number of jumps
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Equal Sum Partition
- Find whether path exist
- Maximize The Cut Segments
- Word Boggle
- Sort 0s, 1s and 2s
- Pythagorean Triplet
- Longest Common Substring
- Longest Palindromic Subsequence
- Longest Common Increasing Subsequence
- Coin Change (Count Ways)
- Gold Mine Problem
- Coin Change (Minimum Coins)
- Maximum path sum in matrix
- Snake and Ladder Problem
- Replace O's with X's
- Shortest Source to Destination Path
- Pairwise swap elements of a linked list
- Delete in a Doubly Linked List
- Check for BST
- Mirror Tree
- Height of Binary Tree
- Balanced Tree Check
- Check If Circular Linked List
- Left View of Binary Tree
- Level Order in spiral form
- DFS of Graph
- BFS of graph
- Identical Trees
- Lowest Common Ancestor in a BST
- Delete in a Singly Linked List
- Find length of Loop
- Equilibrium Point
- Reverse Words
- Find the closest number
- Chocolate Distribution Problem
- Sort in specific order
- Print an array in Pendulum Arrangement
- Pair with given sum in a sorted array
- Geek and his Tricky Series
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