{"id":20749019,"url":"https://github.com/rhaeguard/algorithms-and-interview-questions-python","last_synced_at":"2026-04-17T01:02:00.973Z","repository":{"id":167534848,"uuid":"164197854","full_name":"rhaeguard/algorithms-and-interview-questions-python","owner":"rhaeguard","description":"The repository to stack up algorithms and interview questions I came across","archived":false,"fork":false,"pushed_at":"2019-01-19T15:26:12.000Z","size":31,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-10-10T17:18:36.341Z","etag":null,"topics":["algorithms","data-structures","interview-questions","project-euler","python","search-algorithm","set"],"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/rhaeguard.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,"zenodo":null}},"created_at":"2019-01-05T08:49:25.000Z","updated_at":"2020-04-02T16:44:55.000Z","dependencies_parsed_at":"2023-05-22T20:57:09.903Z","dependency_job_id":null,"html_url":"https://github.com/rhaeguard/algorithms-and-interview-questions-python","commit_stats":null,"previous_names":["rhaeguard/algorithms-and-interview-questions-python"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/rhaeguard/algorithms-and-interview-questions-python","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rhaeguard%2Falgorithms-and-interview-questions-python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rhaeguard%2Falgorithms-and-interview-questions-python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rhaeguard%2Falgorithms-and-interview-questions-python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rhaeguard%2Falgorithms-and-interview-questions-python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rhaeguard","download_url":"https://codeload.github.com/rhaeguard/algorithms-and-interview-questions-python/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rhaeguard%2Falgorithms-and-interview-questions-python/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31910585,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-16T18:22:33.417Z","status":"ssl_error","status_checked_at":"2026-04-16T18:21:47.142Z","response_time":69,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["algorithms","data-structures","interview-questions","project-euler","python","search-algorithm","set"],"created_at":"2024-11-17T08:20:19.794Z","updated_at":"2026-04-17T01:02:00.942Z","avatar_url":"https://github.com/rhaeguard.png","language":"Python","readme":"Here I compiled some questions that can be asked in an interview.\n\n## Table of contents\n\n - ### Strings\n    - [All permutations of a string](./string-questions/all_permutations.py)\n    - [If strings are permutations of each other](./string-questions/are_permutations_of_each_other.py)\n    - [Vowel and consonant count](./string-questions/count_vowel_consonant.py)\n    - [First non-repeating character 1](./string-questions/first_non_repeating_char.py)\n    - [First non-repeating character 2](./string-questions/non_repeating.py)\n    - [If string only contains digits](./string-questions/if_string_contains_only_digits.py)\n    - [If string contains unique characters](./string-questions/is_unique.py)\n    - [If strings are one edit away](./string-questions/one_away_string.py)\n    - [If the string is the permutation of palindrome](./string-questions/palindrome_permutation.py)\n    - [String duplicate characters](./string-questions/print_duplicate_characters.py)\n    - [Reverse string using recursion](./string-questions/reverse_string_recursion.py)\n    - [Reverse strings in a sentence](./string-questions/reverse_strings_in_sentence.py)\n    - [String compression](./string-questions/string_compression.py)\n    - [If strings are anagrams](./string-questions/two_anagram_strings.py)\n \n - ### Sets\n    - [If numbers add up to target](./set-questions/number_of_sets_add_up_to.py)\n    - [Power set](./set-questions/power_set.py)\n    \n - ### Search Algorithms\n    - [Linear search](search_algorithms/element_searching/linear_search.py)\n    - [Binary search](search_algorithms/element_searching/binary_search.py)\n    - [Uninformed](search_algorithms/uninformed/)\n        - [Breadth-first search](search_algorithms/uninformed/breadth_first_search.py)\n        - [Depth-first search](search_algorithms/uninformed/depth_first.py)\n        - [Depth-limited search](search_algorithms/uninformed/depth_limited.py)\n        - [Iterative-deepening search](search_algorithms/uninformed/iterative_deepening.py)\n        - [Uniform cost search](search_algorithms/uninformed/uniform_cost_search.py)\n    - [Informed](search_algorithms/informed/)\n        - [Greedy search](search_algorithms/informed/greedy.py)\n        - [A* search](search_algorithms/informed/astar.py)\n \n - ### Miscellaneous\n    - [All prime factors](problem_solving/all_prime_factors.py)\n    - [Floyd's triangle](problem_solving/floyds_triangle.py)\n    - [Narcissistic number](problem_solving/narcissistic_number.py)\n    - [Palindrome number](problem_solving/palindrome_number.py)\n    - [Pascal triangle](problem_solving/pascal_triangle.py)\n    - [Prime numbers up to n](problem_solving/prime_numbers_upto.py)\n    - [Do rectangles overlap?](problem_solving/rectangles_overlap.py)\n    - [Swap 2 numbers](problem_solving/swap_two_nums.py)\n    - [Hanoi Tower](problem_solving/hanoi_tower.py)\n    - [Length of the longest common subsequence](problem_solving/length_of_longest_common_subsequence.py)\n    - [Length of the shortest common supersequence](problem_solving/length_common_supersequence.py)\n    - [Robot in a grid](problem_solving/robot_in_a_grid.py)\n    - [Triple step](problem_solving/triple_step.py)\n \n - ### Project Euler\n    - [Problem 1](project_euler/problem_1.py) \n    - [Problem 2](project_euler/problem_2.py) \n    - [Problem 3](project_euler/problem_3.py) \n    - [Problem 4](project_euler/problem_4.py) \n    - [Problem 5](project_euler/problem_5.py) \n    - [Problem 6](project_euler/problem_6.py) \n    - [Problem 7](project_euler/problem_7.py) \n ","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frhaeguard%2Falgorithms-and-interview-questions-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frhaeguard%2Falgorithms-and-interview-questions-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frhaeguard%2Falgorithms-and-interview-questions-python/lists"}