A
code181
STREAK
00/1467
days
Longest streak/Global longest streak
60 points
Contributor
60 points
Contributor
1 Point
Proficient
Proficient
100 Point
Scholar
Scholar
1k Point
Master
Master
10k Point
Ace
Ace
50k Point
11 submissions in current year
SCHOOL (0)
BASIC (3)
EASY (18)
MEDIUM (48)
HARD (4)
- Nearly Sorted Algorithm
- Bottom View of Binary Tree
- Delete without head pointer
- Merge two sorted linked lists
- Add all greater values to every node in a BST
- Directed Graph Cycle
- Undirected Graph Cycle
- Two Stacks in an Array
- Vertical Tree Traversal
- Minimum Spanning Tree
- Strongly Connected
- Rat in a Maze Problem - I
- Top View of Binary Tree
- Children Sum in a Binary Tree
- Stock buy and sell
- Binary Array Sorting
- Count Inversions
- Indexes of Subarray Sum
- Merge Without Extra Space
- Stock span problem
- Next Greater Element
- K Sized Subarray Maximum
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Ways to Reach the n'th Stair
- Longest Common Subsequence
- 0 - 1 Knapsack Problem
- Steps by Knight
- Excel Sheet | Part - 1
- Sort 0s, 1s and 2s
- Consecutive 1's not allowed
- Pythagorean Triplet
- Reverse each word in a given string
- K-th element of two Arrays
- Rod Cutting
- Friends Pairing Problem
- Largest prime factor
- Coin Change (Count Ways)
- Sieve of Eratosthenes
- Subset Sums
- Count Numbers in Range
- Find the Safe Position
- Product of Primes
- Shortest Path in Undirected Graph
- Shortest path in Directed Acyclic Graph
- Aggressive Cows
- Generate all binary strings
- Sahil loves gfg
- Sahil love good scorer
- Reverse a linked list
- K distance from root
- Left View of Binary Tree
- Level Order in spiral form
- DFS of Graph
- BFS of graph
- Inorder Successor in BST
- Equilibrium Point
- Array Leaders
- Count 1's in binary array
- N meetings in one room
- Remove Duplicates
- Max Sum Subarray of size K
- Nth Fibonacci Number
- Least Prime Factor
- Count Primes In Range
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