{"id":21105173,"url":"https://github.com/tchaton/interviews_prep","last_synced_at":"2025-09-11T20:33:21.888Z","repository":{"id":134495489,"uuid":"132646558","full_name":"tchaton/interviews_prep","owner":"tchaton","description":"Coding Interview Preparation","archived":false,"fork":false,"pushed_at":"2018-06-10T15:27:40.000Z","size":164,"stargazers_count":1,"open_issues_count":0,"forks_count":9,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-30T07:51:25.201Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tchaton.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-05-08T18:05:28.000Z","updated_at":"2022-02-24T12:15:30.000Z","dependencies_parsed_at":"2023-06-16T11:45:23.467Z","dependency_job_id":null,"html_url":"https://github.com/tchaton/interviews_prep","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tchaton%2Finterviews_prep","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tchaton%2Finterviews_prep/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tchaton%2Finterviews_prep/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tchaton%2Finterviews_prep/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tchaton","download_url":"https://codeload.github.com/tchaton/interviews_prep/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":232666171,"owners_count":18557991,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-20T00:04:01.971Z","updated_at":"2025-01-06T02:53:29.310Z","avatar_url":"https://github.com/tchaton.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Coding interview preparation\n\nThe code on this repo has been inspired by those repositories:\n  - https://github.com/keon/algorithms \n  - https://github.com/eriklindernoren/ML-From-Scratch\n  - https://github.com/w-hat/ctci-solutions\n  \nI have added test function for each elements in order to test the code and make sure everything is correct.\n\n# Includes in code_prep\n\n  - Abstract Structures (22)\n    - Arrays (7)\n      - delete_nth\n      - flatten\n      - garage\n      - josephus_problem\n      - longest_non_repeat\n      - merge_intervals\n      - remove_duplicates\n\n    - Linked List (7)\n      - Base\n      - Is Circular\n      - Double Linked List\n      - Part Linked List\n      - Sum Linked Lists\n      - Intersections\n\n    - Heap (4)\n      - heap\n      - find N largest items seq\n      - Merge Sorted Seqs\n      - Priority Queue\n\n    - Queue and Stack (5)\n      - queue\n      - animal shelter\n      - linked Queue\n      - Stack with Min\n      - Stack of Plates\n    \n  - Short Phone Interviews Problem (34)\n    - balanced\n    - binary search\n    - breadth search first : bst\n    - check anagrams\n    - combinaison\n    - find_0_MN_replace_cols_rows\n    - find_3_numbers \n    - hast table\n    - is_tree_balanced\n    - linked list\n    - longest commong substring\n    - longest increasing subsequence\n    - palindrom\n    - permutation\n    - queue\n    - stack\n    - tree\n      - add\n      - search\n      - print tree\n      - preorder\n      - inorder\n      - postorder\n    - Binary Search Matrix\n    - Routes Between Nodes\n    - BasketBall\n    - Coins\n    - Virtual Coins\n    - Permutations without dups\n    - Tower of Hanoi\n    - PGCD\n      - pgcd\n      - pgcdn\n      - pgcde\n      - ppcm\n      - ppcmn\n    - Operations\n      - Substract\n      - Recursive Multiply\n      - Divide\n    - Living People\n      \n  - Bit Manipulation (4)\n    \n    - Inserstion\n    - Power of two\n    - Russian Peasant Multiplication\n    - Number Max\n    \n  - Sort And Searching (10)\n  \n    - Sort (7)\n      - Quick Sort\n      - Bubble Sort\n      - Merge Sort\n      - Count Sort\n      - Gnome Sort\n      - Heap Sort\n      - Sort Peaks and Valleys\n      \n    - Searching (3)\n      - rotated_search\n      - sorted_search_no_size \n      - sparse_search\n      \n  - Advanced (3)\n     - Dijkstra\n     - Newton Method\n     - Kruskal\n    \n  - Machine Learning from scratch (12)\n  \n    - Supervised (7)\n      - Decision Tree\n      - Knn\n      - SVM ( Bugs in original version )\n      - Naive Bayesn\n      - LDA\n      - One vs One:\n        - SVM\n      - Adaboost ( Simulation )\n      \n    - Unsupervised (3)\n      - Kmeans\n      - PCA\n      - Gaussian Mixture\n      \n    - Utils (2)\n      - kernels\n      - operations\n\n# Greetings\n\nThanks to \n  - eriklindernore\n  - keon\n\nfor their great code examples which I used to inspire myself\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftchaton%2Finterviews_prep","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftchaton%2Finterviews_prep","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftchaton%2Finterviews_prep/lists"}