https://github.com/mdh266/pythonpractice
https://github.com/mdh266/pythonpractice
Last synced: 6 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/mdh266/pythonpractice
- Owner: mdh266
- Created: 2021-11-04T00:27:19.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2025-03-09T17:59:53.000Z (7 months ago)
- Last Synced: 2025-03-09T18:25:50.383Z (7 months ago)
- Language: Python
- Size: 29.3 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Python Practice Scripts From Interview Prep Websites
------------
These are scripts that answer questions from leetcode and DataLemur, questions and my answers are below!
## Data Structures & Algorithms
-----------------------------
| Topic | Code |
|-------------------------|------------------------|
| Bineary Search | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/binarysearch.py) |
| Mergesort | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/mergesort.py) |
| Quicksort | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/quicksort.py) |
| Heapsort | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/heapsort.py) |
| Linked list (Iterative) | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/linkedlist_iterative.py) |
| Linked List (Recursive) | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/linkedlist_recursive.py) |
| Double Linked List (Recursive) | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/double_linkedlist.py) |
| Binary Search Tree (Iterative) | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/bst_iterative.py) |
| Binary Search Tree (Recursive) | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/bst_recursive.py) |
| Breath First & Dept First Traversals | [Code](https://github.com/mdh266/PythonPractice/blob/main/datastructures_algorithms/graph_traversals.py) |
## Dynamic Programing
------------------
| Question | Answer |
|----------|--------|
| [Maximum Profit](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/description/)| [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/MaxProfit.py) |
| [Longest Substring w/o repeats](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/LongestSubstringWithoutRepeats.py) |
| [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/longest_palindromic_substring.py) |
| [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/LongestCommonPrefix.py) |
| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/MaxmimumSubarray.py) |
## LeetCode
----------
### Easy
--------
| Problem | Solution |
|-----------|---------|
| [Two Sum](https://leetcode.com/problems/two-sum/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/two-sum.py) |
| [Max Profit](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/MaxProfit.py) |
| [Perfect Square](https://leetcode.com/problems/valid-perfect-square/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/PerfectSquare.py) |
| [Remove Duplicates From Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/RemoveDuplicatesSortedList.py) |
| [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/LongestCommonPrefix.py) |
| [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/palindrome-number.py) |
| [Length Of Last Word](https://leetcode.com/problems/length-of-last-word/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/length-of-last-word.py) |
| [Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/LongestPalindrome.py) |
|[Path Sum](https://leetcode.com/problems/path-sum/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/path-sum.py) |
### Medium
----------
| Problem | Solution |
|-----------|---------|
| [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/LongestSubstringWithoutRepeats.py) |
| [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/reverse_integer.py) |
| [Subsets](https://leetcode.com/problems/subsets/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/subsets.py) |
| [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/longest_palindromic_substring.py) |
| [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Solution](https://github.com/mdh266/PythonPractice/blob/main/LeetCode/MaxmimumSubarray.py) |