DSA-Google repo contains answer code for the free DSA course offered by Google through Udemy. It is a compact set of Python scripts covering core data structures and algorithms, intended for quick reference and practice.
The repository includes the following:
-
Searching
- Binary search implementation and sample usage
-
Sorting
- Quick sort implementation
-
Trees
- Binary search tree practice
- Pre-order traversal examples
-
Graphs
- Graph construction
- Graph traversal patterns
-
Hashing and Dictionaries
- Dictionary-based exercises
- String key manipulation examples
-
General Exercises
- Additional DSA practice scripts
- Python 3.12.4: Core language used for all scripts
- No External Libraries: All code uses the Python standard library only
DSA-Google/
├── binary_search.py
├── bst-practice.py
├── dictionary.py
├── dsa_ex1.py
├── graph.py
├── graph_traversal.py
├── pre-order-search-trees.py
├── quick_sort.py
└── string_keys.py
To run the scripts locally, follow these steps:
-
Open the repository folder.
-
Run a script with Python:
python3 binary_search.py
-
Repeat for any other file you want to explore.
This project was developed by:
- Supun Wijesooriya - Developer
Contributions are welcome. If you would like to contribute, please follow these steps:
-
Fork the repository.
-
Create a new branch:
git checkout -b feature/your-feature-name
-
Make your changes and commit them:
git commit -m "Add your commit message" -
Push your changes to your forked repository:
git push origin feature/your-feature-name
-
Open a pull request to the main repository.
- These scripts are intended for learning and revision of DSA fundamentals.
- Examples are intentionally minimal to keep the focus on core concepts.
For any enquiries or feedback, please contact the developer:
- Supun Wijesooriya: GitHub Profile
- Project Repository: DSA-Google