- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
shreyansh_agrawal
STREAK
01/1426
days
Longest streak/Global longest streak
Language Used
C++, C
Coding Score
181
Problem Solved
74
Contest Rating
__
188 points
Contributor
188 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 (11)
EASY (30)
MEDIUM (30)
HARD (2)
- Reverse a linked list
- Remove duplicates from an unsorted linked list
- Split a Linked List into two halves
- Reverse a Doubly Linked List
- Right View of Binary Tree
- Mirror 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
- Intersection Sorted Linked Lists
- Remove Duplicates from a Sorted Linked List
- Reverse Level Order Traversal
- DFS of Graph
- BFS of graph
- Leaves at Same Level or Not
- Level order traversal
- Reverse Using Stack
- Rotate doubly Linked List
- N meetings in one room
- Count number of hops
- Union of Arrays with Duplicates
- Missing And Repeating
- Move all negative elements to end
- Alternate Positive Negative
- Search array with adjacent diff at most k
- Reach the Nth point
- Assign Tasks
- Sort a linked list of 0s, 1s and 2s
- Add 1 to a Linked List Number
- Detect Loop in linked list
- Bottom View of Binary Tree
- Intersection in Y Shaped Lists
- Diameter of a Binary Tree
- Sum Tree
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Remove loop in Linked List
- Palindrome Linked List
- Top View of Binary Tree
- Deletion and Reverse in Circular Linked List
- Sum of nodes on the longest path
- Kadane's Algorithm
- Majority Element
- Spirally traversing a matrix
- Job Sequencing Problem
- Minimum Platforms
- Minimum Jumps
- Stickler Thief
- Kth Smallest
- Sort 0s, 1s and 2s
- Row with max 1s
- Max Sum without Adjacents
- First and Last Occurrences
- Gold Mine Problem
- nCr
- Subset Sums
- Stream First Non-repeating
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