Skip to content

umairdotdev/Data-Structures-and-Algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Data Structures and Algorithms

This repository showcases projects and solutions involving data structures, algorithms, and computational problem-solving. It is a central hub for various coding challenges and structured projects.

Contents

1. BST-and-AVL

  • Description: Implementation of Binary Search Tree (BST) and AVL Tree.
  • Key Features:
    • BST with add, remove, find, and traversal operations.
    • AVL Tree with self-balancing mechanisms.
  • Folder: BST-and-AVL

2. Mars Colonies Analysis

  • Description: Analysis of geographic and demographic factors for Martian colonies.
  • Key Features:
    • Distance calculations between Martian landmarks.
    • Risk analysis for volcanic activity.
    • Evacuation planning with optimization strategies.
  • Folder: Mars-Colonies-Analysis

3. Existential LightBulb Problem

  • Description: Solves the problem of determining if a set of switches can be configured so that all connected lightbulbs remain on.
  • Key Features:
    • Uses graph traversal and SAT solving techniques.
    • Identifies conflicting variables when no solution exists.
    • Provides switch configurations for solutions.
  • Folder: ExistentialLightBulbProblem

Usage

  1. Clone the repository:
    git clone https://github.com/your-username/Data-Structures-and-Algorithms.git
    cd Data-Structures-and-Algorithms

About

A repository for Data Structures and Algorithms projects

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published