Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 1 addition & 5 deletions .devcontainer/Dockerfile
Original file line number Diff line number Diff line change
@@ -1,13 +1,9 @@
# See here for image contents: https://github.com/microsoft/vscode-dev-containers/tree/v0.238.0/containers/python-3/.devcontainer/base.Dockerfile

# [Choice] Python version (use -bullseye variants on local arm64/Apple Silicon): 3, 3.10, 3.9, 3.8, 3.7, 3.6, 3-bullseye, 3.10-bullseye, 3.9-bullseye, 3.8-bullseye, 3.7-bullseye, 3.6-bullseye, 3-buster, 3.10-buster, 3.9-buster, 3.8-buster, 3.7-buster, 3.6-buster
ARG VARIANT="3.10-bullseye"
ARG VARIANT="3.14-bullseye"
FROM mcr.microsoft.com/vscode/devcontainers/python:0-${VARIANT}

# [Choice] Node.js version: none, lts/*, 16, 14, 12, 10
ARG NODE_VERSION="none"
RUN if [ "${NODE_VERSION}" != "none" ]; then su vscode -c "umask 0002 && . /usr/local/share/nvm/nvm.sh && nvm install ${NODE_VERSION} 2>&1"; fi

# [Optional] If your pip requirements rarely change, uncomment this section to add them to the image.
# COPY requirements.txt /tmp/pip-tmp/
# RUN pip3 --disable-pip-version-check --no-cache-dir install -r /tmp/pip-tmp/requirements.txt \
Expand Down
2 changes: 2 additions & 0 deletions .gitattributes
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
.devcontainer/* -linguist-detectable
.github/** -linguist-detectable
4 changes: 2 additions & 2 deletions .github/workflows/Python.yml
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ jobs:
pip install -r requirements.txt
- name: Lint
run: |
flake8 --max-complexity=10 --max-line-length=120 --statistics
just lint
- name: Unit tests
run: |
pytest
just test
1 change: 0 additions & 1 deletion algorithm_theory/binary_search.py
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,6 @@ def binary_search_iterative(array: [int], target: int) -> Optional[int]:

def binary_search_recursive(array: [int], left: int, right: int, target: int) -> Optional[int]:
if right >= left:

mid = int((left + right) / 2)

# If element is present at the middle
Expand Down
1 change: 1 addition & 0 deletions algorithm_theory/jump_search.py
Original file line number Diff line number Diff line change
Expand Up @@ -5,6 +5,7 @@

import math
from typing import Optional

from algorithm_theory.linear_search import linear_search


Expand Down
1 change: 0 additions & 1 deletion algorithm_theory/linear_search.py
Original file line number Diff line number Diff line change
@@ -1,6 +1,5 @@
from typing import Optional


# The most basic search. Start from the leftmost element of the array and one by one compare the target with each
# element of the array. If the target matches with an element, return the index.

Expand Down
2 changes: 1 addition & 1 deletion arrays/arrays_intersection.py
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
from typing import List


# Leetcode 1213. Intersection of Three Sorted Arrays


def arrays_intersection(arr1: List[int], arr2: List[int], arr3: List[int]) -> List[int]:
intersection = set(arr1)
intersection = intersection.intersection(arr2)
Expand Down
1 change: 0 additions & 1 deletion arrays/find_pivot_index.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,3 @@

def find_pivot_index(nums: [int]) -> int:
total = sum(nums)
left_sum = 0
Expand Down
6 changes: 3 additions & 3 deletions arrays/first_not_repeating_character.py
Original file line number Diff line number Diff line change
Expand Up @@ -9,10 +9,10 @@ def first_not_repeating_character(string: str) -> str:
length = len(string)
index = 0
while index < length:
if string[index] not in string[:index] and string[index] not in string[index + 1:]:
if string[index] not in string[:index] and string[index] not in string[index + 1 :]:
return string[index]
index += 1
return '_'
return "_"


def first_not_repeating_character_set(string: str) -> str:
Expand All @@ -21,4 +21,4 @@ def first_not_repeating_character_set(string: str) -> str:
if char not in checked_characters and string.index(char) == string.rindex(char):
return char
checked_characters.add(char)
return '_'
return "_"
14 changes: 9 additions & 5 deletions arrays/largest_number_at_least_twice_of_others.py
Original file line number Diff line number Diff line change
@@ -1,9 +1,12 @@
from typing import List


def largest_number_at_least_twice_of_others(nums: List[int]) -> int:
"""Find largest number that is atleast twice the size of any other number

def largest_number_at_least_twice_of_others(nums: [int]) -> int:
"""
Find largest number that is atleast twice the size of any other number
:param nums: array of numbers
:return: index of number, -1 if none exists

"""
largest = None
next_largest = None
Expand All @@ -25,10 +28,11 @@ def largest_number_at_least_twice_of_others(nums: [int]) -> int:


def largest_number_at_least_twice_of_others2(nums: [int]) -> int:
"""
Find largest number that is atleast twice the size of any other number
"""Find largest number that is atleast twice the size of any other number

:param nums: array of numbers
:return: index of number, -1 if none exists

"""
if len(nums) == 1:
return 0
Expand Down
4 changes: 3 additions & 1 deletion arrays/merge_sorted_array.py
Original file line number Diff line number Diff line change
@@ -1,7 +1,9 @@
from typing import List


def merge_sorted_array(nums1: List[int], nums1_length: int, nums2: List[int], nums2_length: int) -> List[int]:
def merge_sorted_array(
nums1: List[int], nums1_length: int, nums2: List[int], nums2_length: int
) -> List[int]:
index_nums1 = nums1_length - 1
index_nums2 = nums2_length - 1
current_index = nums1_length + nums2_length - 1
Expand Down
5 changes: 2 additions & 3 deletions arrays/plus_one.py
Original file line number Diff line number Diff line change
Expand Up @@ -2,14 +2,13 @@


def plus_one(digits: List[int]) -> List[int]:
"""
Increment array of digits by one as if a number
"""Increment array of digits by one as if a number

[1, 2, 3] -> [1, 2, 4]

:param digits: list of int numbers representing a non-negative number
:return: incremented list
"""

for i in reversed(range(len(digits))):
digits[i] = (digits[i] + 1) % 10
if digits[i] != 0:
Expand Down
13 changes: 8 additions & 5 deletions arrays/tests/test_first_not_repeating_character.py
Original file line number Diff line number Diff line change
@@ -1,11 +1,14 @@
from arrays.first_not_repeating_character import first_not_repeating_character, first_not_repeating_character_set
from arrays.first_not_repeating_character import (
first_not_repeating_character,
first_not_repeating_character_set,
)


def test_first_not_repeating_character():
assert first_not_repeating_character('aaaaabc') == 'b'
assert first_not_repeating_character('aaaaaa') == '_'
assert first_not_repeating_character("aaaaabc") == "b"
assert first_not_repeating_character("aaaaaa") == "_"


def test_first_not_repeating_character_set():
assert first_not_repeating_character_set('aaaaabc') == 'b'
assert first_not_repeating_character_set('aaaaaa') == '_'
assert first_not_repeating_character_set("aaaaabc") == "b"
assert first_not_repeating_character_set("aaaaaa") == "_"
6 changes: 4 additions & 2 deletions arrays/tests/test_largest_number_twice_of_others.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,7 @@
from arrays.largest_number_at_least_twice_of_others import largest_number_at_least_twice_of_others, \
largest_number_at_least_twice_of_others2
from arrays.largest_number_at_least_twice_of_others import (
largest_number_at_least_twice_of_others,
largest_number_at_least_twice_of_others2,
)


def test_largest_number_at_least_twice_of_others():
Expand Down
2 changes: 1 addition & 1 deletion arrays/tests/test_max_consecutive_ones.py
Original file line number Diff line number Diff line change
Expand Up @@ -5,4 +5,4 @@ def test_max_consecutive_ones():
assert max_consecutive_ones([1, 1]) == 2
assert max_consecutive_ones([1, 1, 0, 1, 1, 1]) == 3
assert max_consecutive_ones([1, 1, 0, 0, 1, 1]) == 2
assert max_consecutive_ones([0, 1, 1, 1, 1, 0, 1, 1, 1, 0]) == 4
assert max_consecutive_ones([0, 1, 1, 1, 1, 0, 1, 1, 1, 0]) == 4
2 changes: 1 addition & 1 deletion arrays/tests/test_rotate_array.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
from arrays.rotate_array import rotate_array_with_array, rotate_array_in_place
from arrays.rotate_array import rotate_array_in_place, rotate_array_with_array


def test_rotate_array_with_array():
Expand Down
6 changes: 3 additions & 3 deletions arrays/third_max.py
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,6 @@ def third_max(nums: List[int]) -> int:
if len(unique_nums) < 3:
return max(unique_nums)

unique_nums.remove(max(unique_nums)) # 1st
unique_nums.remove(max(unique_nums)) # 2nd
return max(unique_nums) # 3rd
unique_nums.remove(max(unique_nums)) # 1st
unique_nums.remove(max(unique_nums)) # 2nd
return max(unique_nums) # 3rd
6 changes: 3 additions & 3 deletions binary_tree/binary_tree_path.py
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,7 @@ def binary_tree_paths(root_node: TreeNode) -> [str]:
paths = []
if not root_node:
return paths
return get_path(root_node, '', paths)
return get_path(root_node, "", paths)


def get_path(node: TreeNode, path: str, paths: [str]) -> [str]:
Expand All @@ -40,7 +40,7 @@ def get_path(node: TreeNode, path: str, paths: [str]) -> [str]:
new_paths.append(path + str(node.val))
return new_paths
if node.left:
new_paths += get_path(node.left, path + str(node.val) + '->', paths)
new_paths += get_path(node.left, path + str(node.val) + "->", paths)
if node.right:
new_paths += get_path(node.right, path + str(node.val) + '->', paths)
new_paths += get_path(node.right, path + str(node.val) + "->", paths)
return new_paths
1 change: 1 addition & 0 deletions binary_tree/even_odd_tree.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
from collections import deque
from typing import Optional

from binary_tree.tree_node import TreeNode


Expand Down
2 changes: 1 addition & 1 deletion binary_tree/find_mode.py
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
from collections import Counter
from typing import List

from collections import Counter
from binary_tree.tree_node import TreeNode


Expand Down
1 change: 1 addition & 0 deletions binary_tree/inorder_traversal.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import List

from binary_tree.tree_node import TreeNode


Expand Down
1 change: 1 addition & 0 deletions binary_tree/level_order_traversal.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,6 @@
from collections import deque
from typing import List

from binary_tree.tree_node import TreeNode


Expand Down
1 change: 1 addition & 0 deletions binary_tree/min_depth.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from collections import deque

from binary_tree.tree_node import TreeNode


Expand Down
1 change: 1 addition & 0 deletions binary_tree/postorder_traversal.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import List

from binary_tree.tree_node import TreeNode


Expand Down
1 change: 1 addition & 0 deletions binary_tree/preorder_traversal.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import List

from binary_tree.tree_node import TreeNode

# class TreeNode:
Expand Down
1 change: 1 addition & 0 deletions binary_tree/symmetric_binary_tree.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import Optional

from binary_tree.tree_node import TreeNode


Expand Down
2 changes: 1 addition & 1 deletion binary_tree/tests/test_find_mode.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
from binary_tree.find_mode import find_mode
from test_helpers.test_helpers import get_binary_tree, TreeNode
from test_helpers.test_helpers import TreeNode, get_binary_tree


def test_find_mode():
Expand Down
2 changes: 1 addition & 1 deletion binary_tree/tests/test_inorder_traversal.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
from test_helpers.test_helpers import get_binary_tree
from binary_tree.inorder_traversal import inorder_traversal, inorder_traversal_stack
from test_helpers.test_helpers import get_binary_tree


def test_inorder_traversal():
Expand Down
2 changes: 1 addition & 1 deletion binary_tree/tests/test_level_order_traversal.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
from test_helpers.test_helpers import get_binary_tree
from binary_tree.level_order_traversal import level_order_traversal
from test_helpers.test_helpers import get_binary_tree


def test_level_order_traversal():
Expand Down
2 changes: 1 addition & 1 deletion binary_tree/tests/test_next_right_pointer.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
from binary_tree.next_right_pointer import next_right_pointer, Node
from binary_tree.next_right_pointer import Node, next_right_pointer


def test_next_right_pointer():
Expand Down
5 changes: 4 additions & 1 deletion binary_tree/tests/test_postorder_traversal.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,7 @@
from binary_tree.postorder_traversal import postorder_traversal_iterative, postorder_traversal_recursive
from binary_tree.postorder_traversal import (
postorder_traversal_iterative,
postorder_traversal_recursive,
)
from test_helpers.test_helpers import get_binary_tree


Expand Down
7 changes: 5 additions & 2 deletions binary_tree/tests/test_pre_order_traversal.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,8 @@
from binary_tree.preorder_traversal import preorder_traversal_iterative, preorder_traversal_morris, \
preorder_traversal_recursive
from binary_tree.preorder_traversal import (
preorder_traversal_iterative,
preorder_traversal_morris,
preorder_traversal_recursive,
)
from test_helpers.test_helpers import get_binary_tree


Expand Down
2 changes: 1 addition & 1 deletion binary_tree/tests/test_two_sum_iv.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
from binary_tree.two_sum_iv import two_sum_iv
from test_helpers.test_helpers import get_binary_tree, TreeNode
from test_helpers.test_helpers import TreeNode, get_binary_tree


def test_two_sum_iv():
Expand Down
1 change: 1 addition & 0 deletions binary_tree/tree_from_inorder_postorder.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import List

from binary_tree.tree_node import TreeNode


Expand Down
1 change: 1 addition & 0 deletions binary_tree/tree_from_preorder_inorder.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import List

from binary_tree.tree_node import TreeNode


Expand Down
6 changes: 4 additions & 2 deletions binary_tree/tree_node.py
Original file line number Diff line number Diff line change
@@ -1,10 +1,12 @@
from typing import Generic, Optional, TypeVar

T = TypeVar('T')
T = TypeVar("T")


class TreeNode(Generic[T]):
def __init__(self, val: T, left: Optional['TreeNode'] = None, right: Optional['TreeNode'] = None):
def __init__(
self, val: T, left: Optional["TreeNode"] = None, right: Optional["TreeNode"] = None
):
self.val = val
self.left: Optional[TreeNode] = left
self.right: Optional[TreeNode] = right
2 changes: 1 addition & 1 deletion binary_tree/valid_binary_search_tree.py
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
from binary_tree.tree_node import TreeNode


def valid_bst(root: TreeNode, min_value=float('-inf'), max_value=float('inf')) -> bool:
def valid_bst(root: TreeNode, min_value=float("-inf"), max_value=float("inf")) -> bool:
if not root:
return True

Expand Down
1 change: 1 addition & 0 deletions circularly_linked_list/insert_cyclic_list.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import Optional

from data_structures.singly_linked_list_node import SinglyLinkedListNode


Expand Down
1 change: 0 additions & 1 deletion data_structures/binary_tree_node.py
Original file line number Diff line number Diff line change
@@ -1,5 +1,4 @@
class BinaryTreeNode:

def __init__(self, data, left_node=None, right_node=None):
self.__data = data
self.__left_node = left_node
Expand Down
1 change: 1 addition & 0 deletions data_structures/circularly_linked_list.py
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
from typing import Optional

from data_structures.singly_linked_list_node import SinglyLinkedListNode


Expand Down
4 changes: 2 additions & 2 deletions data_structures/doubly_linked_list.py
Original file line number Diff line number Diff line change
@@ -1,11 +1,11 @@
from typing import Generic, Optional, TypeVar

from data_structures.doubly_linked_list_node import DoublyLinkedListNode

T = TypeVar('T')
T = TypeVar("T")


class DoublyLinkedList(Generic[T]):

def __init__(self):
self.__head: DoublyLinkedListNode = DoublyLinkedListNode()
self.__tail: DoublyLinkedListNode = DoublyLinkedListNode()
Expand Down
Loading
Loading