Skip to content

README.md

Latest commit

 

History

History
123 lines (112 loc) · 3.58 KB

README.md

File metadata and controls

123 lines (112 loc) · 3.58 KB
Raw

🐍 Python Programming

A repo for storing Python code and tracking learning progress.

Inventory overview

.
├── algorithms/
├── asyncio/
├── data_structures/
└── kattis_solutions/

Algorithms

.
├── search
│   ├── bfs.py
│   ├── binary_search.py
│   ├── dfs.py
│   ├── dijkstra.py
│   ├── kahns_algorithm.py
│   └── prims_algorithm.py
└── sort
    ├── bubble_sort.py
    ├── heap_sort.py
    ├── merge_sort.py
    ├── quick_sort.py
    └── selection_sort.py

Asyncio

.
├── dependency_scheduler.py
├── taskgroup_error_handling.py
└── worker_pipeline.py

Data structures

.
├── doubly_linked_list-interactive.py
├── doubly_linked_list.py
├── fenwick_tree.py
├── singly_linked_list-interactive.py
├── singly_linked_list.py
└── union_find.py

Kattis solutions

.
├── baylor-competitive-learning
│   ├── 01-weakvertices.py
│   ├── 02-detaileddifferences.py
│   ├── 03-sortofsorting.py
│   ├── 04-estimatingtheareaofacircle.py
│   ├── 05-moreorless.py
│   ├── 06-compoundwords.py
│   ├── 07-pervasiveheartmonitor.py
│   ├── 08-synchronizinglists.py
│   ├── 09-securedoors.py
│   ├── 10-halfacookie.py
│   ├── 11-hidingplaces.py                  # BFS algorithm
│   ├── 12-musicyourway.py
│   ├── 13-boundingrobots.py
│   ├── 14-sidewayssorting.py
│   ├── 15-vacuumba.py
│   ├── 16-baconeggsandspam.py
│   ├── 17-reachableroads.py                # DFS algorithm
│   ├── 18-printingcosts.py
│   ├── 19-permutedarithmeticsequence.py
│   ├── 20-metaprogramming.py
│   ├── 21-countingtriangles.py
│   ├── 22-differentdistances.py
│   ├── 23-convexpolygonarea.py
│   ├── 24-functionalfun.py
│   └── 25-islandhopping.py                 # Prim's algorithm
│   ├── 26-sumoftheothers.py
│   ├── 27-busyschedule.py
│   ├── 28-permutationencryption.py
│   ├── 29-iboard.py
│   ├── 30-musicalnotation.py
│   ├── 31-thebackslashproblem.py
│   ├── 32-savingdaylight.py
│   ├── 33-bitbybit.py
│   ├── 34-variablearithmetic.py
│   ├── 35-enlarginghashtables.py
│   └── 36-parsinghex.py
├── kth-training
│   ├── 01-carrots.py
│   ├── 02-pauleigon.py
│   ├── 03-busnumbers.py
│   ├── 04-color.py
│   ├── 05-justaminute.py
│   ├── 06-pikemaneasy.py
│   ├── 07-reactivity.py                    # Kahn's algorithm
│   ├── 08-teacherevaluation.py
│   ├── 09-santaklas.py
│   ├── 10-emergency.py
│   ├── 11-paintbuckets.py
│   ├── 12-batteries.py
│   ├── 13-tomography.py
│   └── 14-fruitbaskets.py
└── nus-challenges
    ├── 01-thelastproblem.py
    ├── 02-bracketmatching.py
    ├── 03-brillianceofwings.py
    ├── 04-knightjump.py                    # BFS algorithm
    ├── 05-nicknames.py
    ├── 06-fastestavailableroute.py
    ├── 07-continuousmedian.py
    ├── 08-universityzoning.py
    ├── 09-justforsidekicks.py              # Fenwick Tree data structure
    ├── 10-teque.py
    └── 11-goldmerchant.py                  # Union-Find data structure