# Java & DSA

Domination : Crack

#
Companies.

Only ₹5590 ₹ 4999* ( 10% off )

Start Learning

Ace your coding interviews! Master Java and DSA with our expert-led course, packed with interactive lessons and practice tests.

The modules will be made available on alternate days# Dominate.

## From Start to Victory.

# Java Setup & Basics

Installation of Java

Writing your First Program

Variables & Data Types

# Java Fundamentals

Reading User Inputs

Operators and Expressions

Math API

# Control Flow Statements

Conditional Statements

Loops & Coding Problems

Branching Statements

Pattern Programming

# Arrays

Deep Dive into Arrays

Methods & Arguments

Multidimensional Arrays

# OOPS Concepts

Class and Object

Constructor & Overloading

Polymorphism

# String Handling

Strings & StringBuilder

Wrapper Classes Overview

BufferedReader API

# Core Components

JDK, JRE, and JVM

Encapsulation

Static Keyword

# OOPs in Depth

Inheritance

Method Overriding

Access Modifiers

Abstract Class & Interface

Exception Handling

# DSA Essentials

Time & Space Complexity

Collections Framework

Bit Manipulation

Garbage Collection

Recursion Level 1

Advanced Maths

# Sorting & Searching

Dynamic Arrays

Sorting Algorithms

Binary Search

# Hashing & Matrix

Hashmaps & HashSets

Matrix Operations

More on Strings

# Linked List

Implementation & Operations

Level 1 Problems

Level 2 Problems

Level 3 Problems

# Stacks & Queues

Stack Implementation

Queue Implementation

Level 1 Problems

Level 2 Problems

Level 3 Problems

# Recursion & Backtracking

Backtracking Concepts

Level 2 Problems

Level 3 Problems

Level 4 Problems

Level 5 Problems

# Binary Trees & BSTs

Implementation of Binary Trees

Level 1 Problems

Level 2 Problems

Level 3 Problems

Level 4 Problems

Binary Search Trees

Level 1 Problems

Level 2 Problems

# Priority Queues & Heap

Implementation & Operations

Priority Queue

Comaparator Interface

Level 1 Problems

Level 2 Problems

# Graph Theory

Implementation of Graphs

DFS & BFS

Cycle Detection

Kahn's Algorithm

Topological Sort

Dijkstra's Algorithm

Bellman Ford Algorithm

Minimum Spanning Tree

Prim's Algorithm

Disjoint Set Union

Path Compression

Kruskal's Algorithm

# Sliding Window

Identifications

Level 1 Problems

Level 2 Problems

# Dynamic Programming (25 Problems)

Understanding DP

Level 1 - Fibonacci

Level 2 - 0/1 Knapsack

Level 3 - Unbounded Knapsack

Level 4 - Longest Common Subsequence

Level 5 - Palindromic Subsequence

Level 6 - Matrix Chain Multiplication

Level 7 - Longest Increasing Subsequence

# Trie

Implementation of Trie

Level 1 Problems

Level 2 Problems

# Segment Trees

Implementation

Level 1 Problems

Level 2 Problems