Skip to content
40+ Common code and interview problems solved in Python (it's growing...) Please go through the README.md before starting.
Python
Branch: master
Clone or download
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitignore Create .gitignore Jun 5, 2019
BST_nodes_in_range.py Create BST_nodes_in_range.py Feb 18, 2018
CODE_Of_CONDUCT.md Create CODE_Of_CONDUCT.md Jun 5, 2019
CONTRIBUTING.md Create CONTRIBUTING.md Jun 5, 2019
LICENSE Create LICENSE Jun 5, 2019
README.md Update README.md Jun 5, 2019
binary_search_recursive.py Update binary_search_recursive.py Jun 4, 2019
check_anagrams.py Added abs() to cover special cases Feb 17, 2018
check_semiprime.py
dfs_bfs.py Corrected dfs function call, needs dfs_2 Jun 12, 2019
find_m_to_last_llist.py Imported LinkedList data structure Jun 12, 2019
find_pairs_sum_k.py Update find_pairs_sum_k.py Jun 4, 2019
find_products_pair_k.py Create find_products_pair_k.py Jul 27, 2019
find_second_largest_in_binary_tree.py
first_non_repeating.py Update first_non_repeating.py Jun 4, 2019
first_recurring_character.py Update first_recurring_character.py Jun 4, 2019
first_unique_letter.py Create first_unique_letter.py Feb 18, 2018
general_tree_structure.py
get_dup_chars.py Create get_dup_chars.py Apr 11, 2019
has_only_digits.py
heap_structure.py Added `self` to function def Jun 12, 2019
intersection_arrays.py Create intersection_arrays.py Feb 16, 2018
is_anagram.py Update is_anagram.py Jun 4, 2019
is_numeric.py
josephus.py Update josephus.py Jun 4, 2019
josephus_improved.py Update josephus_improved.py Jun 5, 2019
josephus_improved_v3.py Add files via upload Jun 5, 2019
karatsuba.py Create karatsuba.py Jun 4, 2019
level_order_tree.py Update level_order_tree.py Jun 4, 2019
linked_list_data_structure.py Update linked_list_data_structure.py Apr 11, 2019
loop_in_linkedlist.py Added imports for LinkedList and findMToLast Jun 12, 2019
lowest_common_ancestor.py Create lowest_common_ancestor.py Feb 24, 2018
majority_element.py Create majority_element.py Feb 18, 2018
merge_sort.py Update merge_sort.py Sep 18, 2018
no_sibling_tree.py Create no_sibling_tree.py Feb 18, 2018
pascal_triangle.py Update pascal_triangle.py Feb 20, 2018
pascals_triangle_improved.py Create pascals_triangle_improved.py Feb 20, 2018
permutations.py Create permutations.py Feb 25, 2018
preorder_iterative_bst.py Adjusted to 2 space indent Jun 12, 2019
product_puzzle.py Create product_puzzle.py Jan 27, 2018
queue_data_structure.py Create queue_data_structure.py Feb 18, 2018
quick_sort.py Update quick_sort.py Apr 10, 2019
remove_chars.py Create remove_chars.py Feb 25, 2018
remove_dup_chars.py Create remove_dup_chars.py Apr 11, 2019
remove_duplicates.py Update remove_duplicates.py Apr 10, 2019
remove_duplicates_v2.py Corrected remove duplicates function call Jun 12, 2019
reverse_in_place.py Create reverse_in_place.py Apr 10, 2019
reverse_str_recursive.py Create reverse_str_recursive.py Apr 11, 2019
reverse_words.py Create reverse_words.py Feb 25, 2018
rotate_matrix.py Create rotate_matrix.py Jan 28, 2018
search_unique.py Create search_unique.py Jan 28, 2018
stack_data_structure.py Create stack_data_structure.py Feb 18, 2018
stock_span.py Update stock_span.py Jan 26, 2018

README.md

Python-Interview-Problems-for-Practice star this repo fork this repo

alt text 40+ Common code and interview problems solved in Python (it's growing...)

The core idea is not to utilize built-in functions or library and giving it a more logic-based approach, so that it can be language-friendly and not end up being another repository of "Python Tips and Tricks" .

How good is the code ?

  • It is well tested
  • It passes style checks (PEP8 compliant) [TODO]
  • It can compile in its current state (and there are relatively no issues)

How much support is available?

  • FAQs (coming soon)
  • Documentation (coming soon)

Issues

Feel free to submit issues and enhancement requests.

Contributing

Please refer to each project's style guidelines and guidelines for submitting patches and additions. In general, we follow the "fork-and-pull" Git workflow.

  1. Fork the repo on GitHub
  2. Clone the project to your own machine
  3. Commit changes to your own branch
  4. Push your work back up to your fork
  5. Submit a Pull request so that we can review your changes

NOTE: Be sure to merge the latest from "upstream" before making a pull request!

LICENSE

MIT License

You can’t perform that action at this time.