Vintage Tastebuds - Algorithm Practice

Welcome to the Vintage Tastebuds repository! This repo is a collection of algorithms and data structures implemented in preparation for coding interviews, particularly with MANG (Meta, Apple, Netflix, Google) companies.

Table of Contents

• Project Overview
• Getting Started
• Directory Structure
• Algorithms & Data Structures
• Contributing
• License

Project Overview

This repository serves as a yearly practice platform where I regularly implement and refine various algorithms and data structures. The goal is to maintain a high level of preparedness for technical interviews with top tech companies.

Getting Started

Prerequisites

To work with this repository, you'll need:

• A modern code editor (e.g., VS Code, IntelliJ IDEA)
• A working installation of Python (or the language of your choice)
• Familiarity with basic command-line operations

Cloning the Repository

To clone the repository, use the following command:

git clone https://github.com/your-username/vintage-tastebuds.git
cd vintage-tastebuds

Running the Code

Each algorithm or data structure is organized into its own file. You can run any script using:

python3 <filename>.py

For example:

python3 sort_algorithms/quick_sort.py

Directory Structure

The repository is organized as follows:

vintage-tastebuds/
│
├── data_structures/
│   ├── linked_list.py
│   ├── binary_tree.py
│   └── ...
│
├── algorithms/
│   ├── sort_algorithms/
│   │   ├── quick_sort.py
│   │   ├── merge_sort.py
│   │   └── ...
│   ├── search_algorithms/
│   │   ├── binary_search.py
│   │   ├── linear_search.py
│   │   └── ...
│   └── ...
│
├── tests/
│   ├── test_linked_list.py
│   ├── test_quick_sort.py
│   └── ...
│
└── README.md

Algorithms & Data Structures

Data Structures

• Linked Lists: Singly, Doubly, Circular
• Trees: Binary Trees, AVL Trees, Binary Search Trees
• Graphs: Adjacency List, Adjacency Matrix
• Heaps: Max Heap, Min Heap

Algorithms

• Sorting: Quick Sort, Merge Sort, Bubble Sort, Heap Sort
• Searching: Binary Search, Linear Search
• Dynamic Programming: Fibonacci, Knapsack, Longest Common Subsequence
• Graph Algorithms: BFS, DFS, Dijkstra's Algorithm
• Other: Backtracking, Divide and Conquer, Greedy Algorithms

Contributing

This repository is primarily for personal practice. However, if you find a bug or have suggestions for improvements, feel free to fork the repo and submit a pull request. Contributions are welcome!

License

This project is licensed under the MIT License - see the LICENSE file for details.