Partial translation of french readme #459
Closed
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
kbakdev
approved these changes
Oct 20, 2020
|
Please resolve conflicts (if you are able). |
n3rdankit
suggested changes
Dec 30, 2020
| - [Coding Question Practice](#coding-question-practice) | ||
| - [Coding exercises/challenges](#coding-exerciseschallenges) | ||
| - [Once you're closer to the interview](#once-youre-closer-to-the-interview) | ||
| - [String recherche et maninpulation](#string-searching--manipulations) |
There was a problem hiding this comment.
recherche de chaînes et manipulations
| - [Coding exercises/challenges](#coding-exerciseschallenges) | ||
| - [Once you're closer to the interview](#once-youre-closer-to-the-interview) | ||
| - [String recherche et maninpulation](#string-searching--manipulations) | ||
| - [Conception, scalabilité, manipulation du système](#system-design-scalability-data-handling) (si vous avez plus de 4 ans d'expérience) |
There was a problem hiding this comment.
conception du système, évolutivité, traitement des données
| - [String recherche et maninpulation](#string-searching--manipulations) | ||
| - [Conception, scalabilité, manipulation du système](#system-design-scalability-data-handling) (si vous avez plus de 4 ans d'expérience) | ||
| - [Examen final](#final-review) | ||
| - [Question de codage](#coding-question-practice) |
| - [Examen final](#final-review) | ||
| - [Question de codage](#coding-question-practice) | ||
| - [Exercices de codage / défis](#coding-exerciseschallenges) | ||
| - [Une fois que vous êtes plus proche de l'interview](#once-youre-closer-to-the-interview) |
There was a problem hiding this comment.
une fois que vous êtes plus proche de l'entrevue
| - [Votre CV](#your-resume) | ||
| - [Be thinking of for when the interview comes](#be-thinking-of-for-when-the-interview-comes) | ||
| - [Pensez à pour quand l'interview vient](#be-thinking-of-for-when-the-interview-comes) |
| - [Fast Fourier Transform](#fast-fourier-transform) | ||
| - [Bloom Filter](#bloom-filter) | ||
| - [Networking](#networking) (si vous avez de l'expérience en réseautage ou si vous voulez être un ingénieur système, attendez des questions) | ||
| - [informatique sécurisée](#computer-security) |
| - [informatique sécurisée](#computer-security) | ||
| - [Collecte des ordures](#garbage-collection) | ||
| - [Programmation parallèle](#parallel-programming) | ||
| - [Systèmes de messagerie, de sérialisation et de queueing systèmes](#messaging-serialization-and-queueing-systems) |
There was a problem hiding this comment.
systèmes de sérialisation et de mise en file d'attente de la messagerie
| - [Programmation parallèle](#parallel-programming) | ||
| - [Systèmes de messagerie, de sérialisation et de queueing systèmes](#messaging-serialization-and-queueing-systems) | ||
| - [Transformée de Fourier Rapide](#fast-fourier-transform) | ||
| - [Filtre Bloom](#bloom-filter) |
| - [Network Flows](#network-flows) | ||
| - [Disjoint Sets & Union Find](#disjoint-sets--union-find) | ||
| - [Math for Fast Processing](#math-for-fast-processing) | ||
| - [Hashing sensible à la localité](#locality-sensitive-hashing) |
| - [Math for Fast Processing](#math-for-fast-processing) | ||
| - [Hashing sensible à la localité](#locality-sensitive-hashing) | ||
| - [van Emde Boas Arbres](#van-emde-boas-arbres) | ||
| - [Structures de data augmentées](#augmented-data-structures) |
n3rdankit
approved these changes
Dec 30, 2020
| - [Hashing sensible à la localité](#locality-sensitive-hashing) | ||
| - [van Emde Boas Arbres](#van-emde-boas-arbres) | ||
| - [Structures de data augmentées](#augmented-data-structures) | ||
| - [Essais](#tries) |
| - [Structures de data augmentées](#augmented-data-structures) | ||
| - [Essais](#tries) | ||
| - [N-ary (K-ary, M-ary) arbres](#n-ary-k-ary-m-ary-arbres) | ||
| - [Arbres de recherche équilibrés](#balanced-search-arbres) |
| - [Essais](#tries) | ||
| - [N-ary (K-ary, M-ary) arbres](#n-ary-k-ary-m-ary-arbres) | ||
| - [Arbres de recherche équilibrés](#balanced-search-arbres) | ||
| - AVL arbres |
| - [N-ary (K-ary, M-ary) arbres](#n-ary-k-ary-m-ary-arbres) | ||
| - [Arbres de recherche équilibrés](#balanced-search-arbres) | ||
| - AVL arbres | ||
| - Splay arbres |
|
In order to merge this, you would ned to resolve conflicts in the file. When that's done, let me know when you want me to pull this change. |
|
This is very old, and requires conflicts to be resolved before it can be merged. Please coordinate on an update. |
This comment has been minimized.
This comment has been minimized.
rishabh-messi
approved these changes
Sep 7, 2021
Salemesghier
approved these changes
Oct 26, 2021
|
I need work |
|
Closing due to age of this open pull request. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
No description provided.