DS Algorithms

A repository containing classic data structures, design pattern, graph algorithms, paradigms, principles, sorting algorithms, and practice problems. This repo is designed for learning, practicing, and experimenting with algorithms.

---

Project Structure

.
├── data-structures
|── design-pattern
├── graph-theory
├── paradigms
├── principles
├── sort-algorithms
├── practices
├── utils
└── main.ts

---

Folder Overview

• data-structures/ — Implementations of core data structures.

• design-pattern/ — Creational, Structural, Behavioral patterns.

• graph-theory/ — Graph representations, traversal algorithms.

• paradigms/ — examples of programming paradigms (OOP, FP, etc.).

• principles/ — software design principles (SOLID, DRY, KISS, GRASP, etc.).

• sort-algorithms/ — Classic and advanced sorting algorithm implementations, plus a playground to test them.

• practices/ — Small algorithmic exercises and problem-solving examples.

• utils/ — Utility functions used across the repository.

---

Features

• Core data structures and their TypeScript implementations.
• Some common design patterns.
• Graph algorithms including BFS, DFS, Dijkstra, and Bellman-Ford.
• Organized into paradigms/ (programming paradigms) and principles/ (software design principles).
• Classic and advanced sorting algorithms.
• Algorithmic practice problems for learning and exercises.
• Modular and TypeScript-friendly code structure.

---