Data Structure
Java
Python
HTML
Interview Preparation
- Tutorials
- Courses
- Tracks
A
anay07
STREAK
00/1542
days
Longest streak/Global longest streak
Language Used
C++
Coding Score
148
Problem Solved
85
Contest Rating
__
3 points
Contributor
3 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 (8)
EASY (31)
MEDIUM (42)
HARD (3)
- SPP - The Placement Tour
- SP - Playing with Stacks
- Tie the poles in pairs
- Spidey Sense
- Detect Loop in linked list
- Delete without head pointer
- Intersection in Y Shaped Lists
- Diagonal Tree Traversal
- Tree Boundary Traversal
- Two Stacks in an Array
- Implement Atoi
- Find Common Nodes in two BSTs
- Smallest Positive Missing
- Possible Words From Phone Digits
- Stock buy and sell
- Triplet Sum in Array
- Minimum number of jumps
- Largest number
- K nearest Points
- Find whether path exist
- Excel Sheet | Part - 1
- Sort 0s, 1s and 2s
- Consecutive 1's not allowed
- Form the Largest Number
- Next Smaller Element
- Count the Reversals
- Max Sum without Adjacents
- Smallest distinct window
- Permutations of a String
- Rotate String
- String Subsequence Game
- Bleak Numbers
- Modular Exponentiation
- Maximum Tip Calculator
- Max Sum Increasing Subsequence
- Sequence of Sequence
- Count distinct pairs with difference k
- Permutation with Spaces
- Fact Digit Sum
- Exit Point in a Matrix
- Buying Vegetables
- Shortest Source to Destination Path
- SPP - Palindrome Family
- SP - Beautiful Pairs
- SP - Stack Design
- SPP - BST Traversal
- SP - Second Smallest in Range
- SP - K<sup>th</sup> largest and smallest
- Sum Array
- Geeky Movement
- Gadgets of Doraland
- Balanced Tree Check
- Left View of Binary Tree
- Insert a node in a BST
- Identical Trees
- Root to leaf path sum
- Nodes without a Sibling
- Level Order Line by Line
- BST Keys in a Range
- Binary Tree to BST
- Search a node in BST
- Kth largest element in BST
- Minimum element in BST
- Array Leaders
- Single Appearance
- Next greater number set digits
- 1[0]1 Pattern Count
- String's Count
- Swap two nibbles in a byte
- Final Destination
- Sum of all prime numbers between 1 and n
- Print Pattern
- Count all possible paths from top left to bottom right