Data Structures & Algorithms
Learn data structures and algorithms from fundamentals through advanced problem solving, complexity analysis, searching, sorting, trees, graphs, dynamic programming and interview preparation.
-
Even or Odd
Learn how to determine whether an integer is even or odd using the modulo operator and understand the logic behind this basic DSA problem.
· 2 min read
-
Analysis of Recursion
Learn how to analyze recursive algorithms by counting recursive calls, determining time complexity, and calculating recursion stack space.
· 3 min read
-
Recursion
Learn how recursion solves DSA problems by allowing a function to call itself using smaller instances of the same problem.
· 3 min read
-
Sum of Natural Numbers
Learn how to calculate the sum of the first N natural numbers using iteration and the mathematical formula.
· 2 min read
-
Closest Number
Learn how to find the number closest to a given target by comparing absolute differences, an important pattern in DSA problems.
· 2 min read
-
Solid Rectangle
Learn how to print a solid rectangle pattern using nested loops and understand the row-column logic behind pattern problems.
· 2 min read
-
Floyd's Triangle
Learn how to generate Floyd's Triangle using nested loops and understand the row-by-row numbering pattern.
· 2 min read
-
Hollow Rectangle
Learn how to print a hollow rectangle pattern by printing characters only on its boundary using nested loops and conditions.
· 2 min read
-
Sum of Consecutive Numbers
Learn how to calculate the sum of consecutive numbers using a loop and a mathematical formula, with complexity and examples.
· 2 min read
-
Asymptotic Analysis
Asymptotic Analysis — part of the Data Structures and Algorithms Tutorial.
· 3 min read
-
Order of Growth
Order of Growth — part of the Data Structures and Algorithms Tutorial.
· 2 min read
-
Classes and Objects in DSA
Learn how classes and objects represent data and behavior in DSA, providing a foundation for implementing custom data structures and algorithms.
· 5 min read
-
While Loop
Learn how while loops repeatedly execute DSA operations while a condition remains true, including traversal, pointer movement, termination, and complexity.
· 6 min read
-
Functions
Learn how functions help organize DSA algorithms into reusable units using parameters, return values, and clear inputs and outputs.
· 5 min read
-
For Loop
Learn how for loops help DSA algorithms repeat operations, traverse data, control iterations, and solve problems with predictable time complexity.
· 7 min read
-
Conditional Statements in DSA
Learn how conditional statements help algorithms make decisions using comparisons, Boolean conditions, if-else logic, and multiple conditions.
· 5 min read
-
DSA Input and Output: Read, Process and Print Data
Learn how programming problems accept input, process data, and produce output. This beginner-friendly DSA tutorial covers common input/output patterns with examples in C#, Python, Java, and C++.
· 5 min read