Skip to content
PracticeWithMe
Your workspace
Sign in
Profile
Loading Profile…
@ydlives · PracticeWithMe
AM
Amit Yadav
@ydlives · joined Sep 2026
Total solved
1
Streak
0
days
Easy
1
Medium
0
By difficulty
1
solved
Easy
1
Medium
0
Hard
0
Recent solves
Reverse Array
EASY
2 months ago
Pattern coverage
Array
1 / 97
Two Pointer
1/22
Sliding Window
0/16
Prefix Based
0/17
Kadane / Subarray
0/16
Binary Search
0/16
Matrix
0/6
Build your own —
create account
Intervals
0/3
Native practice
0/1
String
0 / 42
Sliding Window
0/14
Two Pointers
0/14
Pattern Matching
0/14
Hashmap
0 / 27
Frequency Based
0/6
Lookup Based
0/6
Set Based
0/5
Index Mapping
0/5
Grouping Pattern
0/5
Linked List
0 / 24
Fast & Slow Pointer
0/7
Reversal
0/6
Merge Patterns
0/6
Dummy Node Tricks
0/5
Stack & Queue
0 / 26
Monotonic Stack
0/6
Next Greater / Smaller Element
0/5
Min Stack / Queue
0/5
Sliding Window Maximum (Deque)
0/5
Parsing & Bracket Stack
0/4
Native practice
0/1
Tree
0 / 46
Traversals
0/11
Recursion on Trees
0/12
BST Properties
0/6
Tree DP / Re-rooting
0/5
Serialize / Deserialize
0/6
Tree Views & Special Traversals
0/6
Heap / Priority Queue
0 / 21
Top K Elements
0/6
K-way Merge
0/5
Scheduling Problems
0/5
Median of Stream (Two Heaps)
0/5
Graph
0 / 65
BFS / DFS Traversal
0/15
Topological Sort
0/7
Shortest Path
0/13
Union-Find / DSU
0/8
MST (Kruskal / Prim)
0/5
Cycle Detection
0/6
Bridges & Articulation Points
0/5
Border DFS
0/2
Multi-Source BFS
0/2
Bipartite Graphs
0/2
Recursion & Backtracking
0 / 23
Subsets / Permutations / Combinations
0/8
N-Queens / Constraint
0/5
Grid Backtracking
0/5
Word / Path Search
0/5
Dynamic Programming
0 / 57
1D DP
0/7
2D DP / Grids
0/7
Knapsack
0/10
DP on Subsequences
0/7
DP on Strings
0/6
DP on Trees
0/5
DP with Bitmask
0/5
Interval / Partition DP
0/5
Digit DP
0/5
Greedy
0 / 19
Interval Scheduling
0/5
Activity Selection
0/5
Huffman / Encoding
0/4
Exchange Argument
0/5
Bit Manipulation
0 / 20
Basic Ops & Tricks
0/5
XOR Properties
0/6
Bitmask DP
0/4
Counting Set Bits
0/5
Math & Number Theory
0 / 21
GCD / LCM
0/6
Sieve of Eratosthenes
0/5
Modular Arithmetic
0/5
Combinatorics
0/5
Trie
0 / 14
Word Insert / Search
0/5
Prefix Problems
0/5
XOR Trie
0/4
Advanced
0 / 15
Segment Tree
0/5
Fenwick Tree (BIT)
0/4
Sparse Table
0/2
Mo's Algorithm
0/2
Heavy-Light Decomposition
0/2