- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
thekushalghosh
STREAK
00/1431
days
Longest streak/Global longest streak
118 points
Contributor
118 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 (7)
EASY (38)
MEDIUM (44)
HARD (2)
- Count BST nodes that lie in a given range
- Diameter of a Binary Tree
- Add all greater values to every node in a BST
- Sum Tree
- Tree Boundary Traversal
- Directed Graph Cycle
- Undirected Graph Cycle
- Topological sort
- Gas Station
- Dijkstra Algorithm
- Closest in BST
- Merge two BST 's
- Bridge edge in a graph
- k-th Smallest in BST
- Ancestors in Binary Tree
- Foldable Binary Tree
- Isomorphic Trees
- Diagonal sum in binary tree
- Kth Ancestor in a Tree
- Check if two Nodes are Cousins
- ZigZag Tree Traversal
- Mother Vertex
- Kadane's Algorithm
- Unique BST's
- Job Sequencing Problem
- Ways to Reach the n'th Stair
- Longest Increasing Subsequence
- Longest Common Subsequence
- Equal Sum Partition
- Zero Sum Subarrays
- Top K Frequent in Array
- Maximum Subarray Sum
- Longest Subarray with Sum K
- Max Sum without Adjacents
- Friends Pairing Problem
- Modular Exponentiation
- Largest prime factor
- Coin Change (Count Ways)
- Count ways to N'th Stair(Order does not matter)
- nCr
- Partition Equal Subset Sum
- Choose and Swap
- Return two prime numbers
- Count the paths
- Tower Construction
- Continuous Series
- Inorder Traversal
- Check for BST
- Mirror Tree
- Height of Binary Tree
- Transform to Sum Tree
- Level Order in spiral form
- Reverse Level Order Traversal
- DFS of Graph
- Insert a node in a BST
- BFS of graph
- Identical Trees
- Root to leaf path sum
- Lowest Common Ancestor in a BST
- Level Order Line by Line
- BST Keys in a Range
- Expression Tree
- Kth largest element in BST
- Level order traversal
- Symmetric Tree
- Sum of Leaf Nodes
- Brothers From Different Roots
- Power of 2
- Array Leaders
- Floor in a Sorted Array
- Print adjacency list
- Parenthesis Checker
- Count ways to N'th Stair
- Count number of hops
- Missing in Array
- Min sum formed by digits
- Largest Fibonacci Subsequence
- Karatsuba Algorithm
- Minimum number of Coins
- Inorder Traversal and BST
- Array to BST
- Sum of k smallest elements in BST
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