Skip to main content
Computer Science
Intermediate
60 days

Data Structures & Algorithms

Master algorithmic problem solving and optimal data organization.

Learn Big-O notation, arrays, linked lists, stacks, queues, trees, graphs, sorting, searching, and recursion.

Data Structures & Algorithms illustrated course poster
Pacing & Duration

60 days

Experience Level

Intermediate

Delivery Mode

Live online · One-to-one available · Group batches when scheduled

Learning Format

1-on-1 & small cohorts

Course overview

Data Structures and Algorithms (DSA) form the foundation of efficient software and coding interviews. This course teaches how to analyze time and space complexity with Big-O notation, select optimal data structures, and solve problems using searching, sorting, recursion, trees, and graph algorithms.

Free, self-guided practice

Try a Data Structures & Algorithms starter exercise

A practical first task you can try independently, without registration or payment. These instructions are for self-study; they are not a free live class or a downloadable project.

Your task

Compare a linear search with a direct lookup conceptually.

  1. Write a list of ten numbers and search it item by item.
  2. Count comparisons when the target is first and last.
  3. Explain the worst-case time complexity in terms of n.

Check your result: You can explain why linear search can require n comparisons.

Ungated self-study

Free projects to practice this course

Open a hands-on starter kit with runnable example code, project milestones and a downloadable checklist. No signup or tuition is required for the guide.

Browse all free projects

What you'll achieve

Core competencies developed through practical implementation and project work.

  • Analyze time and space complexity using Big-O notation
  • Implement and manipulate fundamental data structures from scratch
  • Solve algorithmic problems using recursion, two-pointer, and sliding window techniques
  • Understand tree traversals (BST) and graph search algorithms (BFS, DFS)
30–60 Day Structured Course

Chapters, Core Topics & Guided Tasks

Every chapter closes with a guided implementation task. The complete course ends with one portfolio-ready capstone project.

60 days 3–4 classes/week

Curriculum Validation Basis

Core chapters are cross-checked against current official technology documentation and authoritative standards or academic references.

  1. Chapter 01

    Complexity & Problem-Solving Method

    Core topics

    • Big-O time and space
    • Tracing and invariants
    • Choosing a data structure

    Guided chapter task

    Analyze and compare two solutions to the same problem.

  2. Chapter 02

    Arrays, Strings & Hashing

    Core topics

    • Two-pointer and sliding-window patterns
    • Prefix calculations
    • Hash maps and sets

    Guided chapter task

    Solve a small set of lookup, frequency, and window problems.

  3. Chapter 03

    Linked Structures, Stacks & Queues

    Core topics

    • Linked lists
    • Stack applications
    • Queues and deques

    Guided chapter task

    Implement the structures and apply them to parsing or scheduling.

  4. Chapter 04

    Trees, Heaps & Priority

    Core topics

    • Binary trees and traversal
    • Binary search trees
    • Heaps and priority queues

    Guided chapter task

    Build traversal utilities and a priority-based scheduler.

  5. Chapter 05

    Sorting, Searching & Recursion

    Core topics

    • Binary search
    • Comparison sorting
    • Recursion and divide-and-conquer

    Guided chapter task

    Implement, test, and benchmark core search and sort algorithms.

  6. Chapter 06

    Graphs & Applied Algorithms

    Core topics

    • Graph representations
    • BFS and DFS
    • Shortest-path and dynamic-programming awareness

    Guided chapter task

    Model and traverse a route, dependency, or social network graph.

Complete Course Capstone

Portfolio Project

Create a documented algorithm toolkit and solve a multi-stage route or scheduling problem.

Prerequisites & Prior Knowledge

Recommended background before starting this course. Mentors adapt pacing to your current level.

Good foundation in Python
C++
Java
or JavaScript.
Target Audience

Who is this course for?

Computer science university students and developers preparing for technical coding interviews.

Delivery & Mentoring

Hands-on Learning Format

  • Live interactive screen-sharing
  • 1-on-1 personalized instruction
  • Practical, portfolio-ready code

Contact admissions for current fee and available learning formats

Enrol in Data Structures & Algorithms

Start with a 1-on-1 trial session to discuss your technical goals with an instructor.

  • Duration: 60 days
  • Level: Intermediate
  • Delivery: Live online · One-to-one available · Group batches when scheduled
  • Format: 1-on-1 & small cohorts
Apply for this course Request Free Demo Trial

* Free Demo is a 1-on-1 trial session, not the complete course.

Ready to start your learning journey?

Apply today and our admissions team will review your application and guide you through the next steps.