- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
Campus Mantri
R
ra24
STREAK
00/1431
days
Longest streak/Global longest streak
21 submissions in current year
SCHOOL (0)
BASIC (0)
EASY (12)
MEDIUM (63)
HARD (7)
- Bottom View of Binary Tree
- Tree Boundary Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- Topological sort
- Dijkstra Algorithm
- Minimum Spanning Tree
- Implement Atoi
- Rat in a Maze Problem - I
- Merge k Sorted Arrays
- Sort a stack
- Top View of Binary Tree
- Children Sum in a Binary Tree
- Smallest Positive Missing
- Rotate Array
- Kadane's Algorithm
- Count Inversions
- Fractional Knapsack
- Job Sequencing Problem
- Minimum Platforms
- Longest Increasing Subsequence
- Kth Smallest
- Stock Buy and Sell – Multiple Transaction Allowed
- Sort 0s, 1s and 2s
- Add Binary Strings
- Maximum Product Subarray
- Longest Subarray with Sum K
- Longest Common Substring
- Longest Substring with K Uniques
- Rod Cutting
- Minimize the Heights II
- Perfect Sum Problem
- Knapsack with Duplicate Items
- Longest Bitonic subsequence
- Next Permutation
- Floyd Warshall
- Subset Sum Problem
- Bellman-Ford
- Number of Provinces
- Overlapping Intervals
- Number of Distinct Islands
- Minimum Multiplications to reach End
- Number Of Islands
- Shortest Path in Undirected Graph
- Shortest path in Directed Acyclic Graph
- Majority Element II
- Find length of the longest subarray containing atmost two distinct integers
- Frog Jump
- Minimal Cost
- Geek's Training
- Aggressive Cows
- Number of greater elements to the right
- Shortest Path in Weighted undirected graph
- Non-overlapping Intervals
- Replace elements by its rank in the array
- Convert Min Heap to Max Heap
- Insert Interval
- Shortest Job first
- Introduction to DP
- Print Longest Increasing Subsequence
- Partitions with Given Difference
- Find H-Index
- Minimum Spanning Tree - Kruskal's Algorithm
- Disjoint set (Union-Find)
- Reverse an Array
- Floor in a Sorted Array
- Anagram
- Strings Rotations of Each Other
- Non Repeating Character
- N meetings in one room
- Move All Zeroes to End
- Second Largest
- Generate binary string
- Stock Buy and Sell – Max one Transaction Allowed
- Implementation of Priority Queue using Binary Heap
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