You are on page 1of 1

Learn to code interactively using only

your browser. Practice labs and projects: Data Structures & Algorithms
https://codedamn.com

Course Concept Topic Multidimensional Arrays

Local Variables Dynamic Size Arrays Pillars

Primitive Data Types Instance Variables Abstraction


Hello World
int float Static Variables Arrays Polymorphism
HashMaps

char boolean Inheritance


Sets
Variables Basic Data Structures
long double Encapsulation

Non-Primitive Data Types Data Types Basics of Programming Object Oriented Programming Structure - OOPS

Components
String Integer
Design Principles DRY Classes
Long Boolean
KISS Objects
Double BigInt Conditional Statements
Design Patterns
SOLID Static vs. Non Static Members

Getters & Setters


if; if else; else; Loops

Singleton Factory
Switch Statement

For Builder Adapter


Tenrary Operator

While Bridge Proxy

Do While Command Observer

Iterator

Constant Time & Space Complexities Building Blocks of DSA Binary Operations Left Shifts

Linear Right Shifts


Number System Bit Operators
Logarithmic Count Bits

Quadratic
Binary AND
Cubic
Decimal OR

Conversion NOT
Basics

XOR
Static Arrays

Dynamic Sized Arrays

Add,remove,update Normal Stack

Reversing Two Stack


Min Stack
Searching Arrays
Using O(n) Space

Linear Data Structures


Stacks Using O(1) Space

Intermediate Linked Lists


Important Questions
Static Arrays
Queues
Reverse String
Union of 2 Arrays
Linked Lists Types HashMaps
Reversing Reverse Stack
Rotating Arrays
Singly Linked List
Cyclic Detection Redundant Brackets
Merging Arrays Normal Queues
Doubly Linked List
Cyclic Detc. & Removal Hash Functions
Queues with Stacks
Circular Linked List
Pair Swapping Hash Tables
Priority Queues
Removing Duplicates Linear Probing
Double Ended Queues
Quadratic Probing
Circular Queues
Double Hashing

Traversals

Pre-Order Traversal

Post-Order Traversal
Directed Graphs
In-Order Traversal
Adjacency Matrix Adjacency List

Morris Traversal Cyclic Detection Topological Sorting


Advanced
Non-Linear Data Structures
Diameter of Tree ZIG ZAG Traversal Trees Kahn's Algorithm Weighted Graphs

Boundary Traversal Vertical Order Traversal Shortest Path Algorithm


Graphs

LCA of Tree Flatten Binary Tree


Tries Heaps
Undirected Graphs

Cyclinc Detection
AVL Trees
Searching Dijkstra's Algorithm
Left Rotations Min Heap
Traversals Spanning Trees
Breadth-First Search
Right Rotations String Auto-Complete Max Heap
Breadth First Search Minimum Spanning Tree
Depth-First Search Longest Common Prefix
Left Right Rotations Heapify
Depth First Search Prim's Algorithm
Right Left Rotations

Bubble Sort Selection Sort

Insertion Sort Merge Sort


Introduction

Sorting Quick Sort Counting Sort


Memory Stack
Recursion Algorithms Bucket Sort

Searching
Important Questions

Fibonacci Series Advanced Questions String Manipulations

Climb Stairs Subset / Sequence of a string Linear Search

Phone keypad problem Reverse Strings


Say Digits Binary Search

Permutation of a String Rotate Strings


Reverse String Ternary Search

Remove Strings
Check Palindrome Rat in Maze Jump Search

Insert Strings
Exponential Search

You might also like