Learn anything, one tutorial at a time.
Clear, structured notes and hands-on walkthroughs for the skills that move your career forward.
Explore by focus area
Core Java
Build strong fundamentals in OOP, JVM concepts, collections, and exceptions.
Open learning path → MODERN JAVAJava 8+
Master streams, lambdas, functional interfaces, and modern coding patterns.
Open learning path → FOUNDATIONSPython Basics
Learn variables, objects, control flow, and the building blocks of Python.
Open learning path → PROBLEM SOLVINGData Structures & Algorithms
Develop the algorithmic thinking needed for technical interviews.
Open learning path →Recent posts
How to check whether a binary tree is height balanced or not?
A height balanced binary tree is a binary tree in which the height of the left subtree and right subtree of any node does no…
Read more
Data Structure
What is Height Balanced Binary Tree
A height-balanced binary tree is defined as a binary tree in which the height of the left and the right subtree of any node …
Read more
Convert Binary Tree to Linked Lists by Depth
Given a binary tree, design an algorithm which creates a linked list of all the nodes at each depth (e.g., if you have a tre…
Read more
Minimal Height BST
Objective: Given a sorted array with unique elements, Create a binary search tree with minimal height.
Minimum height means w…
BFS and DFS Of A Directed Graph
Lets assume we have a directed graph like the below image. Now we need to traverse the graph from a starting index.
We can d…
Routes Between Two Nodes Of A Graph Using BFS And DFS
We can have a directed graph like the below image and our task will be to find if their's a path or route between two gi…
Read more
Social Plugin