# natalie-o-perret/coding-challenges

<https://repo.masters-masters.com/en/repos/natalie-o-perret/coding-challenges>

[Home](https://repo.masters-masters.com/en) › [natalie-o-perret](https://repo.masters-masters.com/en/owners/natalie-o-perret) › [coding-challenges](https://repo.masters-masters.com/en/repos/natalie-o-perret/coding-challenges)

natalie-o-perret/coding-challenges has 105 stars on GitHub. Its RepoMasters card: Prototype tier. My coding challenge solution(s) =\] Language: Python.

| Field | Value |
| --- | --- |
| Owner | [natalie-o-perret](https://repo.masters-masters.com/en/owners/natalie-o-perret) |
| Stars | 105 |
| Forks | 82 |
| Language | [Python](https://repo.masters-masters.com/en/languages/python) |
| License | MIT |
| Created | 2016 |
| Topics | python, clojure, coding-challenge, csharp, fsharp, go, rust, solution, zig |
| Tier | [Prototype (100 to 249 ★)](https://repo.masters-masters.com/en/ranks/rush) |
| View on GitHub | [natalie-o-perret/coding-challenges](https://github.com/natalie-o-perret/coding-challenges) |

## Repository

My coding challenge solution(s) =\]

The tier for repos with 100 to 249 ★. Published odds per card pulled: 70%. Rarity: Common.

## Nearby in Python

- [ozguradmin/ahenk-turkish-tts · ★ 105 · Python · Prototype](https://repo.masters-masters.com/en/repos/ozguradmin/ahenk-turkish-tts)
- [h0ll0w-AkuZr0guY/MiaoTask · ★ 105 · Python · Prototype](https://repo.masters-masters.com/en/repos/h0ll0w-AkuZr0guY/MiaoTask)
- [SuperBigFatDog/mcd-nearest-deal · ★ 105 · Python · Prototype](https://repo.masters-masters.com/en/repos/SuperBigFatDog/mcd-nearest-deal)
- [infogami/infogami · ★ 105 · Python · Prototype](https://repo.masters-masters.com/en/repos/infogami/infogami)
- [lig/pystardict · ★ 105 · Python · Prototype](https://repo.masters-masters.com/en/repos/lig/pystardict)
- [mattball/doxyclean · ★ 105 · Python · Prototype](https://repo.masters-masters.com/en/repos/mattball/doxyclean)

---
Data: GitHub · Illustration drawn by RepoMasters from the repo’s ID and its language color.