https://github.com/rhaeguard/algorithms-and-interview-questions-python

The repository to stack up algorithms and interview questions I came across
https://github.com/rhaeguard/algorithms-and-interview-questions-python

algorithms data-structures interview-questions project-euler python search-algorithm set

Last synced: 11 days ago
JSON representation

The repository to stack up algorithms and interview questions I came across

• Host: GitHub
• URL: https://github.com/rhaeguard/algorithms-and-interview-questions-python
• Owner: rhaeguard
• Created: 2019-01-05T08:49:25.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2019-01-19T15:26:12.000Z (over 7 years ago)
• Last Synced: 2025-10-10T17:18:36.341Z (7 months ago)
• Topics: algorithms, data-structures, interview-questions, project-euler, python, search-algorithm, set
• Language: Python
• Size: 30.3 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
Here I compiled some questions that can be asked in an interview.

## Table of contents

 - ### Strings

    - [All permutations of a string](./string-questions/all_permutations.py)

    - [If strings are permutations of each other](./string-questions/are_permutations_of_each_other.py)

    - [Vowel and consonant count](./string-questions/count_vowel_consonant.py)

    - [First non-repeating character 1](./string-questions/first_non_repeating_char.py)

    - [First non-repeating character 2](./string-questions/non_repeating.py)

    - [If string only contains digits](./string-questions/if_string_contains_only_digits.py)

    - [If string contains unique characters](./string-questions/is_unique.py)

    - [If strings are one edit away](./string-questions/one_away_string.py)

    - [If the string is the permutation of palindrome](./string-questions/palindrome_permutation.py)

    - [String duplicate characters](./string-questions/print_duplicate_characters.py)

    - [Reverse string using recursion](./string-questions/reverse_string_recursion.py)

    - [Reverse strings in a sentence](./string-questions/reverse_strings_in_sentence.py)

    - [String compression](./string-questions/string_compression.py)

    - [If strings are anagrams](./string-questions/two_anagram_strings.py)

 

 - ### Sets

    - [If numbers add up to target](./set-questions/number_of_sets_add_up_to.py)

    - [Power set](./set-questions/power_set.py)

    

 - ### Search Algorithms

    - [Linear search](search_algorithms/element_searching/linear_search.py)

    - [Binary search](search_algorithms/element_searching/binary_search.py)

    - [Uninformed](search_algorithms/uninformed/)

        - [Breadth-first search](search_algorithms/uninformed/breadth_first_search.py)

        - [Depth-first search](search_algorithms/uninformed/depth_first.py)

        - [Depth-limited search](search_algorithms/uninformed/depth_limited.py)

        - [Iterative-deepening search](search_algorithms/uninformed/iterative_deepening.py)

        - [Uniform cost search](search_algorithms/uninformed/uniform_cost_search.py)

    - [Informed](search_algorithms/informed/)

        - [Greedy search](search_algorithms/informed/greedy.py)

        - [A* search](search_algorithms/informed/astar.py)

 

 - ### Miscellaneous

    - [All prime factors](problem_solving/all_prime_factors.py)

    - [Floyd's triangle](problem_solving/floyds_triangle.py)

    - [Narcissistic number](problem_solving/narcissistic_number.py)

    - [Palindrome number](problem_solving/palindrome_number.py)

    - [Pascal triangle](problem_solving/pascal_triangle.py)

    - [Prime numbers up to n](problem_solving/prime_numbers_upto.py)

    - [Do rectangles overlap?](problem_solving/rectangles_overlap.py)

    - [Swap 2 numbers](problem_solving/swap_two_nums.py)

    - [Hanoi Tower](problem_solving/hanoi_tower.py)

    - [Length of the longest common subsequence](problem_solving/length_of_longest_common_subsequence.py)

    - [Length of the shortest common supersequence](problem_solving/length_common_supersequence.py)

    - [Robot in a grid](problem_solving/robot_in_a_grid.py)

    - [Triple step](problem_solving/triple_step.py)

 

 - ### Project Euler

    - [Problem 1](project_euler/problem_1.py) 

    - [Problem 2](project_euler/problem_2.py) 

    - [Problem 3](project_euler/problem_3.py) 

    - [Problem 4](project_euler/problem_4.py) 

    - [Problem 5](project_euler/problem_5.py) 

    - [Problem 6](project_euler/problem_6.py) 

    - [Problem 7](project_euler/problem_7.py)