index
int64 | repo_name
string | branch_name
string | path
string | content
string | import_graph
string |
|---|---|---|---|---|---|
9,540
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/perfect_squares.py
|
from math import floor, sqrt
class Solution:
def get_min_square_count(self, n):
if n == 0:
return 0
memo = [-1 for _ in range(n + 1)]
memo[0] = 0
return self.get_min_square_rec(memo, n)
def get_min_square_rec(self, memo, n):
if memo[n] < 0:
biggest_square = floor(sqrt(n)) ** 2
memo[n] = (n // biggest_square) + self.get_min_square_rec(memo, n % biggest_square)
return memo[n]
def get_min_squares(self, n):
memo = [0] + [float('inf') for _ in range(n)]
for i in range(1, n + 1):
min_count = float('inf')
j = 1
while i - j*j >= 0:
min_count = min(min_count, 1 + memo[i - j * j])
j += 1
memo[i] = min_count
return memo[-1]
solution = Solution()
for i in range(10):
print("n = {} : {}".format(i, solution.get_min_square_count(i)))
print("n = {} : {}".format(i, solution.get_min_squares(i)))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,541
|
aymane081/python_algo
|
refs/heads/master
|
/trees/substree_of_another_tree.py
|
# 572
from utils.treeNode import TreeNode
class Solution:
def is_substree(self, s, t):
return self.traverse(s, t)
def traverse(self, s, t):
return s and (self.equal(s, t) or self.traverse(s.left, t) or self.traverse(s.right, t))
def equal(self, s, t):
if not s and not t:
return True
if not s or not t or s.value != t.value:
return False
return self.equal(s.left, t.left) and self.equal(s.right, t.right)
# time: O(m + n)
# space: O(m + n)
class Solution2:
def is_substree(self, s, t):
def serialize(root):
if not root:
serial.append('#')
return
serial.append(str(root.value))
serialize(root.left)
serialize(root.right)
serial = []
serialize(s)
s_serialized = ','.join(serial)
serial = []
serialize(t)
t_serialized = ','.join(serial)
return t_serialized in s_serialized
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,542
|
aymane081/python_algo
|
refs/heads/master
|
/strings/segments_in_a_string.py
|
class Solution(object):
def countSegments(self, string):
count = 0
for i, char in enumerate(string):
if char != ' ' and (i == 0 or string[i - 1] == ' '):
count += 1
return count
# time: O(N)
# space: O(N) because we have to build the array of results first
def connt_segments2(self, s):
return sum([s[i] != ' ' and (i == 0 or s[i - 1] == ' ') for i in range(len(s))])
solution = Solution()
print(solution.connt_segments2('Hello, my name is Aymane'))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,543
|
aymane081/python_algo
|
refs/heads/master
|
/linkedList/split_linked_list_in_parts.py
|
# 725
from utils.listNode import ListNode
class Solution:
def split(self, head, k):
if not head:
return []
nodes_count = self.get_count(head)
part_length, odd_parts = divmod(nodes_count, k)
result = []
prev, node = None, head
for _ in range(k):
required = part_length
if odd_parts:
required += 1
odd_parts -= 1
result.append(node)
for _ in range(required):
# we'll only get here if required > 0, i.e. node is not null
prev, node = node, node.next
if prev:
prev.next = None
return result
def get_count(self, head):
count = 0
while head:
head = head.next
count += 1
return count
one = ListNode(1)
two = ListNode(2)
three = ListNode(3)
four = ListNode(4)
five = ListNode(5)
six = ListNode(6)
seven = ListNode(7)
one.next = two
two.next = three
three.next = four
four.next = five
five.next = six
six.next = seven
print(one)
solution = Solution()
print(solution.split(one, 10))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,544
|
aymane081/python_algo
|
refs/heads/master
|
/trees/lowest_common_ancestor.py
|
from utils.treeNode import TreeNode
class Solution:
#binary search tree
def get_lca_bst(self, root, node1, node2):
if not node1 or not node2 or not root:
return None
if not root or root == node1 or root == node2:
return root
if (root.value - node1.value) * (root.value - node2.value) < 0:
return root
if root.value > node1.value:
return self.get_lca(root.left, node1, node2)
return self.get_lca(root.right, node1, node2)
#O(N) time and space
def get_lca(self, root, node1, node2):
if not root or root == node1 or root == node2:
return root
left_lca = self.get_lca(root.left, node1, node2)
right_lca = self.get_lca(root.right, node1, node2)
if left_lca and right_lca:
return root
return left_lca or right_lca
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,545
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/is_bypartite.py
|
#time: O(N**2) - space: O(N)
class Solution:
def is_bypartite(self, graph):
colors = dict()
for node in range(len(graph)):
if node not in colors[node]:
colors[node] = 0
if not self.dfs(node, graph, colors):
return False
return True
def dfs(self, node, graph, colors):
for nbr in graph[node]:
if nbr in colors:
if colors[nbr] == colors[node]:
return False
else:
colors[nbr] = 1 - colors[node]
if not self.dfs(nbr, graph, colors):
return False
return True
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,546
|
aymane081/python_algo
|
refs/heads/master
|
/strings/countAndSay.py
|
def countAndSay(n):
result = '1'
for _ in range(n - 1):
count, last = 0, None
newString = ''
for digit in result:
if last is None or digit == last:
count += 1
last = digit
else:
newString += str(count) + last
last = digit
count = 1
newString += str(count) + last
result = newString
return result
# Time: O(2 ^ n) because the sequence at worst double during each iteration
# Space: O(2 ^ n)
def countAndSay2 (n):
sequence = [1]
for _ in range(n - 1):
next = []
for digit in sequence:
if not next or next[-1] != digit:
next += [1, digit]
else:
next[-2] = next[-2] + 1
sequence = next
return ''.join(map(str, sequence))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,547
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/k_diif_pairs.py
|
# 532
from collections import Counter
# time: O(N)
# space: O(N)
class Solution:
def k_diff_pairs(self, nums, k):
if k < 0:
return 0
freq = Counter(nums)
pairs = 0
for num in freq:
if k == 0:
if freq[num] > 1:
pairs += 1
else:
if k + num in freq: # this will ensure we get unique pairs
pairs += 1
return pairs
# time: O(N log N + N)
# space: O(1)
class Solution2:
def k_diff_pairs(self, nums, k):
result = []
if not nums or len(nums) < 2:
return result
nums.sort()
left, right = 0, 1
while left < len(nums) and right < len(nums):
diff = nums[right] - nums[left]
if diff == k:
result.append((nums[left], nums[right]))
# move both left and right
right = self.move(right, nums)
left = self.move(left, nums)
elif diff < k:
# move right
right = self.move(right, nums)
else:
# move left
left = self.move(left, nums)
if left == right:
# move right
right = self.move(right, nums)
return result
def move(self, index, nums):
index += 1
while index < len(nums) and nums[index] == nums[index - 1]:
index += 1
return index
nums, k = [3, 1, 4, 1, 5], 2
# nums, k = [1, 2, 3, 4, 5], 1
# nums, k = [3, 1, 4, 1, 5], 0
solution = Solution()
print(solution.k_diff_pairs(nums, k))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,548
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/number_of_islands.py
|
from utils.matrix import Matrix
class Solution:
def get_islands_count(self, grid):
if not grid or not len(grid) or not len(grid[0]):
return 0
count = 0
for row in range(len(grid)):
for col in range(len(grid[0])):
if grid[row][col] == '1':
self.dfs(row, col, grid)
count += 1
return count
def dfs(self, row, col, grid):
"""
type row: int
type col: int
type grid: Matrix
rtype: None
"""
if not grid.is_valid_cell(row, col):
return
if grid[row][col] != '1':
return
grid[row][col] = 'X'
self.dfs(row - 1, col, grid)
self.dfs(row + 1, col, grid)
self.dfs(row, col + 1, grid)
self.dfs(row, col - 1, grid)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,549
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/my_calendar_1.py
|
# 729
from bisect import bisect
class Node:
def __init__(self, start, end):
self.start = start
self.end = end
self.left = self.right = None
def insert(self, node):
if node.start >= self.end:
if not self.right:
self.right = node
return True
return self.right.insert(node)
if node.end <= self.start:
if not self.left:
self.left = node
return True
return self.left.insert(node)
return False
# time: O(N * log N) in average cases. time needed to insert N events in the tree. Worst case: O(N**2)
# space: O(N) for the tree structure
class MyCalendar:
def __init__(self):
self.root = None
def book(self, start, end):
node = Node(start, end)
if not self.root:
self.root = node
return True
return self.root.insert(node)
class MyCalendar2:
def __init__(self):
self.events = []
def book(self, start, end):
if start >= end:
raise ValueError('Start should be smaller than End')
if not self.events:
self.events.append((start, end))
return True
start_list = list(map(lambda event: event[0], self.events))
index = bisect(start_list, start)
if index == len(self.events) and self.events[-1][1] > start:
return False
if index == 0 and self.events[0][0] < end:
return False
if 0 < index < len(self.events) - 1:
prev, after = self.events[index - 1], self.events[index]
if prev[1] > start or after[0] < end:
return False
self.events.insert(index, (start, end))
return True
def print_events(self):
print(self.events)
calendar = MyCalendar()
print(calendar.book(10, 20))
print(calendar.book(15, 25))
print(calendar.book(20, 30))
print(calendar.book(30, 40))
# calendar.print_events()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,550
|
aymane081/python_algo
|
refs/heads/master
|
/strings/substring_with_at_least_k_repeating_characters.py
|
from collections import Counter
import unittest
class Solution(object):
### time: O(N**3), space: O(N)
def length_substring(self, string, k):
"""
:type string: str
:type k: int
:rtype: int
"""
if not string:
return 0
if k == 1:
return len(string) # return the length of the entire string
longest = 0
for i in range(1, len(string)): # iterate over the string
for j in range(0, i): # get all the possible susbstrings ending at i
substring = string[j: i + 1]
if self.is_valid_substring(substring, k): # check if the current substring meets the criteria
longest = max(longest, len(substring))
return longest
def is_valid_substring(self, substring, k):
"""
:type substring: str
:type k: int
:rtype : boolean
"""
frequencies = Counter(substring)
return all(frequencies[c] >= k for c in set(substring))
# time: O(N**3), space: O(N)
def length_substring2(self, string, k):
"""
:type string: str
:type k: int
:rtype: int
"""
if not string:
return 0
if k == 1:
return len(string) # return the length of the entire string
to_split = [string]
longest = 0
while to_split:
t = to_split.pop()
splitted = [t]
freq = Counter(t)
for c in freq:
if freq[c] < k:
new_splitted = []
for spl in splitted:
new_splitted += spl.split(c)
splitted = new_splitted
if len(splitted) == 1:
longest = max(longest, len(splitted[0]))
else:
to_split += [sub for sub in splitted if len(sub) > longest]
return longest
def length_substring4(self, s, k):
if not s or len(s) < k:
return 0
if k == 1:
return len(s)
longest = 0
to_split = [s]
while to_split:
t = to_split.pop()
frequencies = Counter(t)
new_splitted = []
for c in frequencies:
if frequencies[c] < k: # t is splittable
new_splitted += t.split(c)
if not new_splitted: # t is not splittable:
longest = max(longest, len(t))
else: # t was splittable, add the new splitted elements to to_split
to_split += [sp for sp in new_splitted if len(sp) > longest]
return longest
# recursive method
def length_substring3(self, string, k):
return self.helper(string, 0, len(string), k)
def helper(self, string, start, end, k):
if end - start < k:
return 0
substring = string[start : end]
freq = Counter(substring)
for i, c in enumerate(substring):
if freq[c] < k: # found an infrequent char, split by it
left = self.helper(string, start, i, k)
right = self.helper(string, i + 1, end, k)
return max(left, right)
return end - start # all chars are frequent
class Test(unittest.TestCase):
test_data = [('aaabb', 3, 3), ('ababbc', 2, 5), ('aabbccbcdeee', 3, 6)]
def test_length_substring(self):
solution = Solution()
for data in self.test_data:
actual = solution.length_substring4(data[0], data[1])
self.assertEqual(actual, data[2])
if __name__ == '__main__':
unittest.main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,551
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/count_numbers_with_unique_digits.py
|
class Solution:
def get_unique_count(self, n):
if n == 0:
return 1
res = 10
available_numbers = 9
for digit in range(2, min(n, 10) + 1):
available_numbers *= 11 - digit
res += available_numbers
return res
solution = Solution()
print(solution.get_unique_count(3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,552
|
aymane081/python_algo
|
refs/heads/master
|
/trees/most_frequent_substree_sum.py
|
# 508
from utils.treeNode import TreeNode
from collections import defaultdict
# time: O(N)
# space: O(N)
class Solution:
def most_frequent_substree_sum(self, root):
sum_mapping = defaultdict(int)
def helper(node):
if not node:
return 0
substree_sum = node.value + helper(node.left) + helper(node.right)
sum_mapping[substree_sum] += 1
return substree_sum
helper(root)
max_frequency = max(sum_mapping.values())
return [substree_sum for substree_sum in sum_mapping if sum_mapping[substree_sum] == max_frequency]
one = TreeNode(6)
two = TreeNode(2)
three = TreeNode(-5)
one.left = two
one.right = three
print(one)
print('===========')
solution = Solution()
print(solution.most_frequent_substree_sum(one))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,553
|
aymane081/python_algo
|
refs/heads/master
|
/strings/repeated_string_pattern.py
|
class Solution:
def repeated_string_pattern(self, string):
if not string:
return False
length = len(string)
for i in range(2, (length // 2) + 1):
pattern_length = length // i
if length % i == 0 and all(string[j * pattern_length : (j + 1) * pattern_length] == string[:pattern_length] for j in range(i)):
return True
return False
def repeated_string_pattern2(self, string):
if not string:
return False
return string in (string * 2)[1 : -1]
solution = Solution()
print(solution.repeated_string_pattern2('ababab'))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,554
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/shortest_unsorted_continuous_subarray.py
|
# 581
#time: O(N log N)
# space: O(N)
class Solution:
def shortest_subarray(self, nums):
if not nums:
return []
s_nums = sorted(nums)
left, right = len(nums) - 1, 0
for i in range(len(nums)):
if nums[i] != s_nums[i]:
left = min(left, i)
right = max(right, i)
return right - left + 1 if right >= left else 0
nums = [2, 6, 4, 8, 10, 9, 15]
solution = Solution()
print(solution.shortest_subarray(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,555
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/stock_market.py
|
class Solution(object):
# At most one transaction
def get_max_profit(self, prices):
max_profit = 0
if not prices:
return max_profit
buy = prices[0]
for i in range(1, len(prices)):
price = prices[i]
buy = min(price, buy)
max_profit = max(max_profit, price - buy)
return max_profit
# At most one transaction
def get_max_profit3(self, prices):
buy = float('inf')
profit = 0
for price in prices:
buy = min(price, buy)
profit = max(profit, price - buy)
return profit
# At most one transaction
def get_max_profit2(self, prices):
currMax = 0
maxSoFar = 0
for i in range(1, len(prices)):
currMax = max(0, currMax + prices[i] - prices[i - 1])
maxSoFar = max(currMax, maxSoFar)
return maxSoFar
# unlimited transactions
def get_max_profit4(self, prices):
return sum([max(prices[i] - prices[i - 1], 0) for i in range(1, len(prices))])
solution = Solution()
print(solution.get_max_profit([7, 1, 5, 3, 6, 4]))
print(solution.get_max_profit([7, 6, 5, 4, 3, 1]))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,556
|
aymane081/python_algo
|
refs/heads/master
|
/binarySearch/divide_two_integers.py
|
class Solution:
def divide(self, dividend, divisor):
if divisor == 0:
raise ValueError('divisor should not be 0')
result, right = 0, abs(divisor)
while right <= abs(dividend):
result += 1
right += abs(divisor)
is_result_negative = (
(dividend > 0 and divisor < 0) or
(dividend < 0 and divisor > 0)
)
return int('-{}'.format(str(result))) if is_result_negative else result
def divide2(self, dividend, divisor):
if divisor == 0:
raise ValueError('divisor is 0')
is_result_negative = (
(dividend > 0 and divisor < 0) or
(dividend < 0 and divisor > 0)
)
dividend, divisor = abs(dividend), abs(divisor)
result = 1
right = divisor
while right <= dividend:
result += result
right += right
while right > dividend:
result -= 1
right -= divisor
return -result if is_result_negative else result
solution = Solution()
# print(solution.divide(-10, 2))
print(solution.divide2(-10, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,557
|
aymane081/python_algo
|
refs/heads/master
|
/linkedList/rotate_list.py
|
from utils.listNode import ListNode
class Solution:
def rotate(self, head, k):
if not head:
return None
count, node = 1, head
while node.next:
node = node.next
count += 1
# link the end and the start of the list
node.next = head
to_move = count - (k % count)
while to_move > 0:
node = node.next
to_move -= 1
# next is the new last element of the list
head = node.next
node.next = None
return head
one = ListNode(1)
two = ListNode(2)
three = ListNode(3)
four = ListNode(4)
five = ListNode(5)
one.next = two
two.next = three
three.next = four
four.next = five
print(one)
solution = Solution()
print(solution.rotate(one, 6))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,558
|
aymane081/python_algo
|
refs/heads/master
|
/linkedList/reverse_linked_list2.py
|
from utils.listNode import ListNode
class Solution:
def reverse(self, head, m, n):
if not head:
return head
dummy = prev = ListNode(None)
node = head
rev, rev_tail = None, None
count = 1
while node:
if count > n:
rev_tail.next = node
break
if count >= m:
if count == m: # set the rev tail
rev_tail = node
rev, rev.next, node = node, rev, node.next
prev.next = rev
else:
prev.next = node
prev = prev.next
node = node.next
count += 1
return dummy.next
one = ListNode(1)
two = ListNode(2)
three = ListNode(3)
four = ListNode(4)
five = ListNode(5)
one.next = two
two.next = three
three.next = four
four.next = five
print(one)
solution = Solution()
print(solution.reverse(one, 2, 4))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,559
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/two_sums.py
|
class Solution(object):
def two_sum(self, arr, target):
if not arr:
return None
remainders = dict()
for i, num in enumerate(arr):
if target - num in remainders:
return (remainders[target - num], i)
remainders[num] = i
solution = Solution()
print(solution.two_sum([1, 3, 5, 9], 10))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,560
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/house_robber.py
|
# 198
class Solution:
def rob(self, homes):
if not homes:
return 0
curr, prev = 0, 0
for home in homes:
curr, prev = max(curr, prev + home), curr
return curr
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,561
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/pascal_triangle.py
|
class Solution(object):
def pascal_triangle(self, numRows):
pascal = []
for k in range(numRows):
pascal.append([1] * (k + 1))
for i in range(1, k):
pascal[k][i] = pascal[k - 1][i - 1] + pascal[k - 1][i]
return pascal
def pascal_triangle2(self, numRows):
all_rows = []
row = []
for k in range(numRows):
row.append(1)
for i in range(k - 1, 0, -1):
row[i] = row[i] + row[i - 1]
all_rows.append(list(row))
return all_rows
def pascal_triangle_row(self, k):
row = []
for j in range(k + 1):
row.append(1)
for i in range(j - 1, 0, -1):
row[i] = row[i] + row[i - 1]
return row
solution = Solution()
print(solution.pascal_triangle_row(2))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,562
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/search_insert_position.py
|
import unittest
class Solution(object):
def search_insert_position(self, arr, val):
if not arr:
return 0
for i, d in enumerate(arr):
if d >= val:
return i
return len(arr)
def search_insert_position2(self, arr, val):
if not arr:
return 0
left, right = 0, len(arr) - 1
while left <= right:
mid = (left + right) // 2
if arr[mid] == val:
return mid
elif arr[mid] < val:
left = mid + 1
else:
right = mid - 1
return left
class Test(unittest.TestCase):
arr = [1, 3, 5, 6]
test_data = [(5, 2), (2, 1), (7, 4), (0, 0)]
def test_search_insert_positiion(self):
solution = Solution()
for data in self.test_data:
self.assertEqual(solution.search_insert_position2(self.arr, data[0]), data[1])
if __name__ == '__main__':
unittest.main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,563
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/my_calendar2.py
|
# 731
# time: o(N**2)
# space: O(N)
class MyCalendar2:
def __inint__(self):
self.calendar = []
self.overlap = []
def book(self, start, end):
for s, e in self.overlap:
# conflict
if s < end and start < e:
return False
for s, e in self.calendar:
if s < end and start > e:
#conflict. The intersection becomes an overlap
self.overlap.append(max(start, s), min(end, e))
self.calendar.append((start, end))
return True
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,564
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/position_of_large_groups.py
|
# 830
class Solution:
def position_of_large_groups(self, chars):
result, start = [], 0
for i in range(len(chars)):
if i == len(chars) - 1 or chars[i] != chars[i + 1]:
if i - start + 1 >= 3:
result.append([start, i])
start = i + 1
return result
chars = "abcdddeeeeaabbbcd"
solution = Solution()
print(solution.position_of_large_groups(chars))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,565
|
aymane081/python_algo
|
refs/heads/master
|
/strings/reverse_vowels.py
|
import unittest
def reverse_vowels(str):
if not str: return str
vowels = ['a', 'e', 'i', 'o', 'u']
list_str = list(str)
head, tail = 0, len(list_str) - 1
while head < tail:
if list_str[head].lower() not in vowels:
head += 1
elif list_str[tail].lower() not in vowels:
tail -= 1
else:
list_str[head], list_str[tail] = list_str[tail], list_str[head]
head += 1
tail -= 1
return ''.join(list_str)
print(reverse_vowels('leEtcode'))
class Solution:
vowels = ['a', 'e', 'i', 'o', 'u']
def reverse_vowels(self, string):
if not string:
return string
string_list = list(string)
head, tail = 0, len(string) - 1
while head < tail:
if string_list[head] not in self.vowels:
head += 1
elif string_list[tail] not in self.vowels:
tail -= 1
else:
string_list[head], string_list[tail] = string_list[tail], string_list[head]
head += 1
tail -= 1
return ''.join(string_list)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,566
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/max_chunks_to_make_sorted.py
|
# 769
class Solution:
# a new chunk is form only if the current element is the max so far,
# and it is where it is supposed to be
def max_chunks(self, nums):
result = max_so_far = 0
for i, num in enumerate(nums):
max_so_far = max(max_so_far, num)
if max_so_far == i:
result += 1
return result
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,567
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/most_profit_assigning_work.py
|
class Solution:
# M = len(difficulties), N = len(workers)
# time = O(M log M + N log N + M + N), but can omit the M and N
# space = O(M)
def max_profit_assignment(self, difficulty, profits, workers):
jobs = list(zip(difficulty, profits))
jobs.sort() # will sort by the first tuple element
index, best_so_far, result = 0, 0, 0
for worker in sorted(workers):
while index < len(jobs) and worker >= jobs[index][0]:
best_so_far = max(best_so_far, jobs[index][1])
index += 1
result += best_so_far
return result
difficulty = [2,4,6,8,10]
profits = [10,20,30,40,50]
workers = [4,5,6,7]
solution = Solution()
print(solution.max_profit_assignment(difficulty, profits, workers))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,568
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/word_ladder.py
|
from collections import defaultdict
from string import ascii_lowercase
class Solution(object):
# Time: O(n * k * k) to build the graph. n = # of words. k = max number of character in a word
# O(b ^ (d/2)) to perform a bidrectional BFS search, where b is the branching factor ( the average number of children(neighbors) at each node),
# and d is the depth
# Space: O(n * k)
def word_ladder(self, start_word, end_word, word_list):
"""
:type start_word: str
:type end_word: str:
:type word_list: Set[str]
:rtye: int
"""
if not start_word or not end_word or not word_list:
return 0
word_list.add(end_word)
graph = self.build_graph(word_list)
visited = set()
length = 0
front, back = {start_word}, {end_word}
while front:
if front & back:
return length
new_front = set()
for word in front:
visited.add(word)
for i in range(len(word)):
wildcard = word[:i] + '-' + word[i + 1 :]
new_words = graph[wildcard]
new_words -= visited
new_front |= new_words
front = new_front
length += 1
if len(back) < len(front):
front, back = back, front
return 0
def build_graph(self, word_list):
"""
:type word_list: Set[str]
:rtype: defaultdict
"""
graph = defaultdict(set)
for word in word_list:
for i in range(len(word)):
wildcard = word[:i] + '-' + word[i + 1 :]
graph[wildcard].add(word)
return graph
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,569
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/product_of_array_except_self.py
|
# This bidirectional technique is useful when we want to get cumulutative information
# from the left and right of each index
class Solution:
def get_product_array(self, nums):
if not nums:
return None
result = [1]
for i in range(1, len(nums)):
result.append(result[-1] * nums[i - 1])
product_right = 1
for i in range(len(nums) - 1, -1, -1):
result[i] *= product_right
product_right *= nums[i]
return result
solution = Solution()
nums = [2, 3, 4, 5]
[60, 40, 30, 24]
60
print(solution.get_product_array(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,570
|
aymane081/python_algo
|
refs/heads/master
|
/binarySearch/arranging_coins.py
|
class Solution:
def get_stack_count(self, n):
stack_count = 0
if n == 0:
return stack_count
remain = n
while remain >= stack_count + 1:
stack_count += 1
remain -= stack_count
return stack_count
def get_stack_count2(self, n):
if n == 0:
return 0
left, right = 1, n
while left <= right:
mid = (left + right) // 2
s = mid * (mid + 1) // 2
if s > n:
right = mid - 1
else:
left = mid + 1
return left - 1
solution = Solution()
print("n = {} : stack_count = {}".format(5, solution.get_stack_count2(5)))
print("n = {} : stack_count = {}".format(6, solution.get_stack_count2(6)))
print("n = {} : stack_count = {}".format(8, solution.get_stack_count2(8)))
print("n = {} : stack_count = {}".format(9, solution.get_stack_count2(9)))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,571
|
aymane081/python_algo
|
refs/heads/master
|
/linkedList/partition_list.py
|
from utils.listNode import ListNode
class Solution:
# time: O(N)
# space: O(1)
def partition(self, head, pivot):
if not head:
return head
s_head = smaller = ListNode(None)
g_head = greater = ListNode(None)
node = head
while node:
if node.value < pivot:
smaller.next = node
smaller = node
else:
greater.next = node
greater = node
node = node.next
greater.next = None
smaller.next = g_head.next
return s_head.next
one = ListNode(1)
two = ListNode(4)
three = ListNode(3)
four = ListNode(2)
five = ListNode(5)
six = ListNode(2)
one.next = two
two.next = three
three.next = four
four.next = five
five.next = six
print(one)
solution = Solution()
print(solution.partition(one, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,572
|
aymane081/python_algo
|
refs/heads/master
|
/trees/same_tree.py
|
from utils.treeNode import TreeNode
class Solution:
#O(min(N1, N2)) time and space
def is_same_tree(self, node1, node2):
"""
type node1: TreeNode
type node2: TreeNode
rtype: bool
"""
if not node1 and not node2:
return True
if not node1 or not node2:
return False
if node1.value != node2.value:
return False
return self.is_same_tree(node1.left, node2.left) and self.is_same_tree(node1.right, node2.right)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,573
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/longest_common_sequence.py
|
import unittest
class Solution:
def get_longest_common_sequence(self, str1, str2):
if not str1 or not str2:
return ''
max_length = float('-inf')
num_rows, num_cols = len(str2) + 1, len(str1) + 1
T = [[0 for _ in range(num_cols)] for _ in range(num_rows)]
for i in range(1, num_rows):
for j in range(1, num_cols):
if str2[i - 1] != str1[j - 1]:
# if the sequences do not need to be contigious
T[i][j] = max(T[i - 1][j], T[i][j - 1])
# if the sequence need to be contiguous
T[i][j] = 0
else:
T[i][j] = T[i - 1][j - 1] + 1
# to get the max length of the contiguous common sequence
max_length = max(max_length, T[i][j])
result = ''
i = num_rows - 1
j = num_cols - 1
while T[i][j]:
if T[i][j] == T[i - 1][j]:
i -= 1
elif T[i][j] == T[i][j - 1]:
j -= 1
elif T[i][j] == T[i - 1][j - 1] + 1:
result += str2[i - 1]
i -= 1
j -= 1
else:
raise Exception('Error constructing table')
return result[::-1]
class Test(unittest.TestCase):
def test_longest_common_subsequence(self):
solution = Solution()
str1 = 'ABCDEFGHIJ'
str2 = 'FOOBCDBCDEG'
expected = 'BCDEG'
actual = solution.get_longest_common_sequence(str1, str2)
self.assertEqual(expected, actual)
print('Success!')
def main():
test = Test()
test.test_longest_common_subsequence()
if __name__ == '__main__':
main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,574
|
aymane081/python_algo
|
refs/heads/master
|
/trees/next_right_pointer.py
|
from utils.treeNode import TreeNode
class TreeLinkNode(TreeNode):
def __init__(self, **kwargs):
super().__init__(**kwargs)
self.next = None
class Solution:
#O(N) time and space
def set_next_right_pointers(self, node):
if not node or not node.left:
return
# node has children
node.left.next = node.right
node.right.next = None if not node.next else node.next.left
self.set_next_right_pointers(node.right)
self.set_next_right_pointers(node.left)
#O(N) time and space
def set_next_right_pointers2(self, node):
level = [node]
while level and level[0]:
prev = None
next_level = []
for node in level:
if prev:
prev.next = node
prev = node
next_level.append(node.left)
next_level.append(node.right)
level = next_level
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,575
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/ones_and_zeroes.py
|
class Solution:
def get_max_words(self, words, zeroes_count, ones_count):
memo = [[0 for _ in range(ones_count + 1)] for _ in range(zeroes_count + 1)]
for word in words:
zeroes = sum([True for c in word if c == '0'])
ones = len(word) - zeroes
for i in range(zeroes_count + 1):
for j in range(ones_count + 1):
can_build = i >= zeroes and j >= ones
if can_build:
memo[i][j] = max(memo[i][j], 1 + memo[i - zeroes][j - ones])
return memo[-1][-1]
words = ["10", "0001", "111001", "1", "0"]
solution = Solution()
print(solution.get_max_words(words, 5, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,576
|
aymane081/python_algo
|
refs/heads/master
|
/trees/path_sum3.py
|
from utils.treeNode import TreeNode
from collections import defaultdict
class Solution:
def get_paths_count(self, node, target):
if not node:
return 0
sum_mapping = defaultdict(int)
sum_mapping[0] = 1
return self.helper(node, 0, target, sum_mapping)
def helper(self, node, curr_sum, target, sum_mapping):
if not node:
return 0
curr_sum += node.value
result = sum_mapping[curr_sum - target]
sum_mapping[curr_sum] += 1
result += self.helper(node.left, curr_sum, target, sum_mapping)
result += self.helper(node.right, curr_sum, target, sum_mapping)
sum_mapping[curr_sum] -= 1
return result
node1 = TreeNode(10)
node2 = TreeNode(5)
node3 = TreeNode(-3)
node4 = TreeNode(3)
node5 = TreeNode(2)
node6 = TreeNode(6)
node7 = TreeNode(11)
node8 = TreeNode(3)
node9 = TreeNode(-2)
node10 = TreeNode(1)
node1.left = node2
node1.right = node3
node2.left = node4
node2.right = node5
node4.left = node8
node4.right = node9
node5.left = node10
node3.right = node7
# node6.left = node7
print(node1)
solution = Solution()
print(solution.get_paths_count(node1, 8))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,577
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/combimation_sum_3.py
|
class Solution:
def get_combinations(self, k, target):
result = []
self.backtrack([], 1, target, k, result)
return result
def backtrack(self, prefix, current_num, remaining, k, result):
if len(prefix) > k or remaining < 0:
return
if remaining == 0 and len(prefix) == k:
result.append(prefix)
return
for i in range(10 - current_num):
self.backtrack(
prefix + [current_num + i],
current_num + i + 1,
remaining - current_num - i,
k,
result
)
solution = Solution()
print(solution.get_combinations(3, 9))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,578
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/majority_element_2.py
|
class Solution:
def get_major(self, nums):
candidate1, candidate2 = None, None
count1, count2 = 0, 0
for num in nums:
if num == candidate1:
count1 += 1
elif num == candidate2:
count2 += 1
elif count1 == 0:
candidate1 = num
count1 = 1
elif count2 == 0:
candidate2 = num
count2 = 1
else:
count1 -= 1
count2 -= 1
return [candidate for candidate in [candidate1, candidate2] if nums.count(candidate) > len(nums) // 3]
solution = Solution()
nums = [1,2,3,2,2,1,3,1,2,1]
print(solution.get_major(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,579
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/contains_duplicates2.py
|
class Solution(object):
def contains_duplicates(self, values, k):
hash_set = set()
for i, val in enumerate(values):
if i > k:
hash_set.remove(values[i - k - 1])
if val in hash_set:
return True
hash_set.add(val)
return False
solution = Solution()
values = [1, 2, 3, 4, 1, 7, 5]
print(solution.contains_duplicates(values, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,580
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/climbing_stairs.py
|
class Solution:
# O(N) time - O(1) space
def climb_stairs(self, n):
if n < 0:
return 0
if n <= 2:
return n
curr, prev = 2, 1
for _ in range(2, n):
curr, prev = curr + prev, curr
return curr
def climbStairs3(self, n):
"""
:type n: int
:rtype: int
"""
if n < 0:
return 0
if n <= 2:
return n
curr, prev = 1, 1
for i in range(2, n + 1):
curr, prev = curr + prev, curr
return curr
# O(N) time - O(N) space
def climb_stairs2(self, n):
memo = [0] + [-1 for _ in range(n)]
return self.stairs(n, memo)
def stairs(self, n, memo):
if n < 0:
return 0
if n <= 2:
return n
if memo[n] != -1:
return memo[n]
result = self.stairs(n - 1, memo) + self.stairs(n - 2, memo)
memo[n] = result
return result
solution = Solution()
for i in range(7):
print("climb_stairs({}) = {}".format(i, solution.climb_stairs2(i)))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,581
|
aymane081/python_algo
|
refs/heads/master
|
/trees/validate_bst.py
|
class Solution:
def is_valid_bst(self, node):
return self.helper(node, float('-inf'), float('inf'))
def helper(self, node, min_value, max_value):
if not node:
return True
if node.value < min_value or node.value > max_value:
return False
return (
self.helper(node.left, min_value, node.value)
and self.helper(node.right, node.value, max_value)
)
def is_valid_bst2(self, node):
self.is_valid = True
self.prev_value = float('-inf')
self.in_order(node)
return self.is_valid
def in_order(self, node):
if not node or not self.is_valid:
return
self.in_order(node.left)
if node.value <= self.prev_value:
self.is_valid = False
return
self.prev_value = node.value
self.in_order(node.right)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,582
|
aymane081/python_algo
|
refs/heads/master
|
/trees/is_balanced.py
|
from utils.treeNode import TreeNode
class Solution:
#O(N) time and space
def is_balanced(self, root):
return self.absHeight(root) != -1
def absHeight(self, root):
if not root:
return 0
left_height = self.absHeight(root.left)
right_height = self.absHeight(root.right)
if left_height == -1 or right_height == -1 or abs(left_height - right_height) > 1:
return -1
return 1 + max(left_height, right_height)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,583
|
aymane081/python_algo
|
refs/heads/master
|
/trees/unique_bst2.py
|
from utils.treeNode import TreeNode
class Solution:
def get_unique_bst(self, n):
result = []
if n <= 0:
return result
return self.get_unique_bst_helper(1, n)
def get_unique_bst_helper(self, start, end):
result = []
if start > end:
return [None] # return [None] so that I can get in the for lefts and rights loops below
for i in range(start, end + 1):
lefts = self.get_unique_bst_helper(start, i - 1)
rights = self.get_unique_bst_helper(i + 1, end)
for left in lefts:
for right in rights:
root = TreeNode(i, left, right)
result.append(root)
return result
solution = Solution()
print(solution.get_unique_bst(3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,584
|
aymane081/python_algo
|
refs/heads/master
|
/trees/binary_tree_level_order_traversal.py
|
from utils.treeNode import TreeNode
class Solution:
def get_level_order_traversal(self, root):
"""
type root: TreeNode
rtype: List[List[Int]]
"""
result = []
if not root:
return result
level_nodes = [root]
while level_nodes:
result.append([])
new_level_nodes = []
for node in level_nodes:
result[-1].append(node.value)
if node.left:
new_level_nodes.append(node.left)
if node.right:
new_level_nodes.append(node.right)
level_nodes = new_level_nodes
return result[::-1]
def get_level_order_traversal2(self, root):
result = []
if not root:
return result
self.helper(root, 0, result)
return result[::-1]
def helper(self, root, level, result):
if not root:
return
if len(result) == level:
# create a new array for this level
result.append([])
result[level].append(root.value)
self.helper(root.left, level + 1, result)
self.helper(root.right, level + 1, result)
node5 = TreeNode(5)
node4 = TreeNode(4)
node3 = TreeNode(3, node4, node5)
node2 = TreeNode(2)
node1 = TreeNode(1, node2, node3)
print(node1)
solution = Solution()
print(solution.get_level_order_traversal(node1))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,585
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/buy_sell_stock_cooldown.py
|
# 309
class Solution:
def get_max_profit(self, prices):
buy, sell, prev_sell = float('-inf'), 0, 0
for price in prices:
sell, prev_sell = max(prev_sell, buy + price), sell
buy = max(buy, prev_sell - price)
return sell
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,586
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/integer_break.py
|
class Solution:
def get_max_break(self, n):
memo = [0, 1]
for i in range(2, n + 1):
max_product = 0
for j in range(1, (i // 2) + 1):
max_product = max(max_product, max(j, memo[j]) * max(i - j, memo[i - j]))
memo.append(max_product)
return memo[-1]
def get_max_break2(self, n):
memo = [0 for _ in range(n + 1)]
memo[1] = 1
for i in range(2, n+1):
memo[i] = max(max(j, memo[j]) * max(i - j, memo[i - j]) for j in range(1, (i//2) + 1))
return memo[-1]
solution = Solution()
for i in range(2, 10):
print('get_max_break({}) = {}'.format(i, solution.get_max_break2(i)))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,587
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/sort_colors.py
|
# iterate over the list, and keep track of where the next 0 and 1 should be placed
# because 2 will always be last, replace the current element with 2
# TAKEAWAY: when sorting in place, have a counter to keep track of where an element should placed next
class Solution:
def sort_colors(self, colors):
next_red, next_white = 0, 0
for i, c in enumerate(colors):
if c < 2:
colors[i] = 2
colors[next_white] = 1
next_white += 1
if c == 0:
colors[next_red] = 0
next_red += 1
solution = Solution()
colors = [2, 1, 2, 2, 1, 0, 0]
print(colors)
solution.sort_colors(colors)
print(colors)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,588
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/move_zeroes.py
|
class Solution(object):
def move_zeroes(self, numbers):
if not numbers:
return None
insert_pos = 0
for i, num in enumerate(numbers):
if num != 0:
numbers[insert_pos] = num
insert_pos += 1
for i in range(insert_pos, len(numbers)):
numbers[i] = 0
solution = Solution()
numbers = [0, 0, 3, 0, 12, 5, 6, 0, 0, 0]
solution.move_zeroes(numbers)
print(numbers)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,589
|
aymane081/python_algo
|
refs/heads/master
|
/binarySearch/first_bad_version.py
|
class Solution:
def get_first_bad_version(self, n):
left, right = 1, n
while left < right:
mid = (left + right) // 2
if not self.is_bad(mid):
left = mid + 1 # this will avoid an infinite loop, because left <= mid < right
else:
right = mid
return left
def get_first_bad_version2(self, n):
left, right = 1, n
while left <= right:
mid = (left + right) // 2
if self.is_bad(mid):
right = mid - 1
else:
left = mid + 1
return left
def is_bad(self, n):
return n >= 4
solution = Solution()
print(solution.get_first_bad_version2(8))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,590
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/three_sum.py
|
import unittest
class Solution(object):
def three_sum(self, numbers):
"""
:type numbers: List[int]
:rtype : List[List[int]]
"""
result = []
if not numbers:
return result
numbers.sort()
i = 0
while i < len(numbers) - 2:
left = i + 1
right = len(numbers) - 1
while left < right:
triple_sum = numbers[i] + numbers[left] + numbers[right]
if triple_sum == 0:
result.append([numbers[i], numbers[left], numbers[right]])
# move left to the next possible value
left += 1
while left < right and numbers[left] == numbers[left - 1]:
left += 1
# move right to the next possible value
right -= 1
while left < right and numbers[right] == numbers[right + 1]:
right -= 1
elif triple_sum < 0:
# move left to the next possible value
left += 1
while left < right and numbers[left] == numbers[left - 1]:
left += 1
else:
# move right to the next possible value
right -= 1
while left < right and numbers[right - 1] == numbers[right]:
right -= 1
# move i to the next possible value
i += 1
while i < len(numbers) - 2 and numbers[i] == numbers[i - 1]:
i += 1
return result
class Test(unittest.TestCase):
test_data = [([-1, 0, 1, 2, -1, 4], [[-1, -1, 2], [-1, 0, 1]])]
def test_three_way(self):
solution = Solution()
for data in self.test_data:
self.assertEqual(solution.three_sum(data[0]), data[1])
if __name__ == '__main__':
unittest.main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,591
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/find_redundant_connection.py
|
#684
from collections import defaultdict
class Solution:
def find_redundant_connection(self, edges):
graph = defaultdict(set)
for u, v in edges:
visited = set()
if u in graph and v in graph and self.dfs(u, v, graph, visited):
return [u, v]
graph[u].add(v)
graph[v].add(u)
def dfs(self, source, target, graph, visited):
if source in visited:
return False
visited.add(source)
if source == target:
return True
return any(self.dfs(nbr, target, graph, visited) for nbr in graph[source])
solution = Solution()
edges = [[1,2], [1,3], [2,3]]
# edges = [[1,2], [2,3], [3,4], [1,4], [1,5]]
print(solution.find_redundant_connection(edges))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,592
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/reconstruct_sequence.py
|
class Solution:
def can_construct(self, org, seqs):
extended = [None] + seqs
pairs = set((u, v) for u, v in zip(extended, org))
num_to_index = { num: i for i, num in enumerate(extended)}
for seq in seqs:
for u, v in zip([None]+seq, seq):
if v not in num_to_index or num_to_index[v] <= num_to_index[u]:
return False
pairs.discard((u,v))
return not pairs
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,593
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/range_sum_query_immutable.py
|
class RangeSum:
def __init__(self, nums):
self.sums = [0 for _ in range(len(nums) + 1)]
for i, num in enumerate(nums):
self.sums[i + 1] = num + self.sums[i]
def get_range_sum(self, start, end):
return self.sums[end + 1] - self.sums[start]
nums = [1, 2, 3, 4, 5, 6, 7]
range_sum = RangeSum(nums)
print(range_sum.get_range_sum(1, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,594
|
aymane081/python_algo
|
refs/heads/master
|
/binarySearch/maximum_length_repeated_subarray.py
|
class Solution:
# time: O(log(min(m, n) * (m + n) * min(m, n)))
# space: O(m ** 2)
def get_max_length(self, A, B):
def mutual_subarray(length):
# generate all subarrays of A with length length
subarrays = set(tuple(A[i: i + length]) for i in range(len(A) - length + 1))
return any(tuple(B[j: j + length]) in subarrays for j in range(len(B) - length + 1))
left, right = 0, min(len(A), len(B)) - 1
while left <= right: # search for smallest length with no mutual subarray
mid = (right + left) // 2
if mutual_subarray(mid):
left = mid + 1
else:
right = mid - 1
return left - 1
#time: O(M * N)
#space: O(M * N)
def get_max_length2(self, A, B):
# rows = A, cols = B
memo = [[0 for _ in range(len(B) + 1)] for _ in range(len(A) + 1)]
result = 0
for row in range(1, len(A) + 1):
for col in range(1, len(B) + 1):
if A[row - 1] == B[col - 1]:
memo[row][col] = memo[row - 1][col - 1] + 1
result = max(result, memo[row][col])
return result
## this is the solution for the problem if the subarrays do not need to be continuous
## in this case, dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
def get_max_length3(self, A, B):
dp = [[0 for _ in range(len(B) + 1)] for _ in range(len(A) + 1)]
for i in range(1, len(A) + 1):
for j in range(1, len(B) + 1):
if A[i - 1] == B[j - 1]:
dp[i][j] = 1 + dp[i - 1][j - 1]
else:
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1])
return dp[-1][-1]
solution = Solution()
A = [3, 2, 1, 8, 6, 9]
B = [7, 6, 3, 2, 1, 9]
print(solution.get_max_length3(A, B))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,595
|
aymane081/python_algo
|
refs/heads/master
|
/trees/minimum_depth.py
|
from utils.treeNode import TreeNode
class Solution:
# O(N) time and space
def get_minimum_depth(self, root):
if not root:
return 0
depth = 0
level_nodes = [root]
while level_nodes:
depth += 1
new_level_nodes = []
for node in level_nodes:
if not node.left and not node.right:
#leaf node. return depth
return depth
if node.left:
new_level_nodes.append(node.left)
if node.right:
new_level_nodes.append(node.right)
level_nodes = new_level_nodes
return depth
# O(N) time and space
def get_minimum_depth2(self, root):
if not root:
return 0
left_height, right_height = self.get_minimum_depth2(root.left), self.get_minimum_depth2(root.right)
if not left_height or not right_height:
return 1 + left_height + right_height
return 1 + min(left_height, right_height)
solution = Solution()
print(solution.get_minimum_depth(None))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,596
|
aymane081/python_algo
|
refs/heads/master
|
/strings/palindrome.py
|
import unittest
# Time: O(N), Space: O(1)
def is_palyndrome(str):
if not str: return True
head = 0
tail = len(str) - 1
while head < tail:
# only compare digits and alphabetical values
if not str[head].isdigit() and not str[head].isalpha():
head += 1
elif not str[tail].isdigit() and not str[tail].isalpha():
tail -= 1
else:
if str[head].lower() != str[tail].lower():
return False
head += 1
tail -= 1
return True
class Test(unittest.TestCase):
data = [('A man, A plan, a canal: Panama', True), ('abab', False)]
def test_is_palindrome(self):
for test_data in self.data:
actual = is_palyndrome(test_data[0])
self.assertIs(actual, test_data[1])
if __name__ == '__main__':
unittest.main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,597
|
aymane081/python_algo
|
refs/heads/master
|
/trees/sum_root_to_leaf_numbers.py
|
from utils.treeNode import TreeNode
from utils.treeUtils import generate_tree
class Solution:
def get_root_to_leaves_sum(self, node):
leaves = [0]
self.get_sum_helper("", node, leaves)
return sum([int(num) for num in leaves])
def get_sum_helper(self, path, node, leaves):
if not node:
return
path += str(node.value)
if not node.left and not node.right:
leaves.append(path)
self.get_sum_helper(path, node.left, leaves)
self.get_sum_helper(path, node.right, leaves)
path = path[:-1]
def get_root_to_leaves_sum2(self, node):
return self.helper(0, node)
def helper(self, partial, node):
if not node:
return 0
partial = partial * 10 + node.value
if not node.left and not node.right:
return partial
return self.helper(partial, node.left) + self.helper(partial, node.right)
root = generate_tree()
print(root)
solution = Solution()
print(solution.get_root_to_leaves_sum2(root))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,598
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/combination_sum.py
|
class Solution:
def combination_sum_unlimited(self, nums, target):
'''
In this method, each number can be used an unlimited time
type nums: List[int]
type target: int
rtype: List[List[int]
'''
nums.sort()
results = []
# for i, num in enumerate(nums):
# self.helper(nums, num, [nums[i]], i, target, results)
self.backtrack_unlimited(nums, target, [], 0, results)
return results
def helper(self, nums, sum, partial, index, target, results):
if sum > target:
return
if sum == target: # found a solution
results.append(partial)
return
self.helper(nums, sum + nums[index], partial + [nums[index]], index, target, results) ## add the number to current sum
if index < len(nums) - 1:
self.helper(nums, sum + nums[index + 1], partial + [nums[index + 1]], index + 1, target, results) # move to the next number
def backtrack_unlimited(self, nums, remainder, partial, start, results):
if remainder < 0:
return
if remainder == 0:
results.append(partial)
return
for i in range(start, len(nums)):
self.backtrack_unlimited(nums, remainder - nums[i], partial + [nums[i]], i, results)
def combination_sum_once(self, nums, target):
nums.sort()
results = []
self.backtrack_once(nums, target, [], 0, results)
return results
def backtrack_once(self, nums, remainder, partial, start, results):
if remainder < 0:
return
if remainder == 0:
results.append(partial)
return
for i in range(start, len(nums)):
self.backtrack_once(nums, remainder - nums[i], partial + [nums[i]], i + 1, results)
solution = Solution()
nums = [2, 6, 5, 3, 7]
# print(solution.combination_sum_unlimited(nums, 7))
print(solution.combination_sum_once(nums, 7))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,599
|
aymane081/python_algo
|
refs/heads/master
|
/strings/lengthOfLastWord.py
|
import unittest
# O(N) time and O(1) space
# def lengthOfLastWord(string):
# list = string.split(' ')
# return len(list[-1]) if list else 0
# def length_of_last_word(string):
# current_length, prev_length = 0, 0
# for char in string:
# if char == ' ':
# if current_length != 0:
# prev_length = current_length
# current_length = 0
# else:
# current_length += 1
# return current_length if current_length != 0 else prev_length
# def length_of_last_word(string):
# result = 0
# i = len(string) - 1
# while string[i] == ' ' and i >= 0:
# i -= 1
# if i == -1:
# # Reached the beginning of the word, and did not find any words
# return 0
# # result = 1
# while string[i] != ' ' and i >= 0:
# result += 1
# i -= 1
# return result
def length_of_last_word(string):
i = len(string) - 1
end = -1
while i >= 0:
if string[i] == ' ' and end != -1:
# already found a word, and encoutered a space
return end - i
if string[i] != ' ' and end == -1:
# found a letter for the first time
end = i
i -= 1
return end + 1 if end != -1 else 0
class Test(unittest.TestCase):
dataTrue = [('Hello World', 5), ('qwerte', 6), (' ', 0)]
dataFalse = [('Hello World', 7), ('qwerte', 2), (' ', 3)]
def test_length_of_last_word(self):
# true check
for test_data in self.dataTrue:
actual = length_of_last_word(test_data[0])
self.assertEqual(actual, test_data[1])
# false check
for test_data in self.dataFalse:
actual = length_of_last_word(test_data[0])
self.assertNotEqual(actual, test_data[1])
if __name__ == '__main__':
unittest.main()
def length_of_last_word(word):
if not word:
return None
i = len(word) - 1
end = -1
while i >= 0:
if word[i] == ' ' and end != -1:
return end - i
if word[i] != ' ' and end == -1:
end = i
i -= 1
return end + 1 if end != -1 else 0
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,600
|
aymane081/python_algo
|
refs/heads/master
|
/trees/maximum_depth_binary_tree.py
|
class Solution:
# O(N) time and space
def get_maximum_depth(self, root):
if not root:
return 0
return 1 + max(self.get_maximum_depth(root.left), self.get_maximum_depth(root.right))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,601
|
aymane081/python_algo
|
refs/heads/master
|
/strings/parenthesis_generator.py
|
class Solution(object):
def parenthesis_generator(self, n):
"""
:type n: int
:rtype: List[str]
"""
result = []
self.generator_helper([], n, n, result)
return result
def generator_helper(self, curr, left, right, result):
if left == 0 and right == 0:
result.append(''.join(curr))
return
if left != 0:
curr.append('(')
self.generator_helper(curr, left - 1, right, result)
curr.pop()
if right > left:
curr.append(')')
self.generator_helper(curr, left, right - 1, result)
curr.pop()
solution = Solution()
print(solution.parenthesis_generator(3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,602
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/rotate_image.py
|
class Solution:
def rotate_image(self, image):
if not self.isValidImage(image):
raise Exception('Invalid image')
n = len(image)
for row in range(n//2):
start = row
end = n - 1 - row
for col in range(start, end): # end should not be included, because it is already taken care of in the first iteration
x = row
y = col
prev = image[x][y]
for _ in range(4):
new_row = y
new_col = n - x - 1
new_cell = image[new_row][new_col]
image[new_row][new_col] = prev
x = new_row
y = new_col
prev = new_cell
def isValidImage(self, image):
n = len(image)
return n > 0 and len(image[0]) == n
def print_image(self, image):
for row in image:
print(row)
image = [[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]]
solution = Solution()
solution.print_image(image)
solution.rotate_image(image)
print('===============')
solution.print_image(image)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,603
|
aymane081/python_algo
|
refs/heads/master
|
/trees/binary_tree_side_view.py
|
from utils.treeNode import TreeNode
from utils.treeUtils import generate_tree
class Solution:
def get_side_view(self, node):
result = []
if not node:
return result
level_nodes = [node]
while level_nodes:
result.append(level_nodes[-1].value)
new_level_nodes = []
for node in level_nodes:
if node.left:
new_level_nodes.append(node.left)
if node.right:
new_level_nodes.append(node.right)
level_nodes = new_level_nodes
return result
def get_side_view2(self, node):
result = []
self.helper(node, 0, result)
return result
def helper(self, node, level, result):
if not node:
return
if len(result) == level:
result.append(node.value)
else:
result[level] = node.value
self.helper(node.left, level + 1, result)
self.helper(node.right, level + 1, result)
root = generate_tree()
print(root)
solution = Solution()
print(solution.get_side_view2(root))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,604
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/fil_zeroes.py
|
class Solution:
# Time: O(rows * cols) - space: O(1)
def fill_zeroes(self, matrix):
rows_count, col_count = len(matrix), len(matrix[0])
for row in range(rows_count):
for col in range(col_count):
if not matrix[row][col]:
matrix[row][col] = 'X'
self.fill_row(row, 'X', matrix)
self.fill_col(col, 'X', matrix)
for row in range(rows_count):
for col in range(col_count):
if matrix[row][col] == 'X':
matrix[row][col] = 0
def fill_row(self, row, val, matrix):
col_count = len(matrix[0])
for col in range(col_count):
matrix[row][col] = val
def fill_col(self, col, val, matrix):
row_count = len(matrix)
for row in range(row_count):
matrix[row][col] = val
def print_matrix(self, matrix):
for row in matrix:
print(row)
def fill_zeroes2(self, matrix):
should_fill_row, should_fill_col = False, False
rows_count, col_count = len(matrix), len(matrix[0])
for row in range(rows_count):
for col in range(col_count):
if not matrix[row][col]:
if row == 0:
should_fill_row = True
if col == 0:
should_fill_col = True
matrix[0][col] = 0
matrix[row][0] = 0
for row in range(1, rows_count):
for col in range(1, rows_count):
if not matrix[row][0] or not matrix[0][col]:
matrix[row][col] = 0
if should_fill_row:
self.fill_row(0, 0, matrix)
if should_fill_col:
self.fill_col(0, 0, matrix)
matrix = [[1,0,1,1,1],[1,1,1,1,1],[1,1,1,1,1], [1,1,1,0,1], [1,1,1,1,1]]
solution = Solution()
solution.print_matrix(matrix)
solution.fill_zeroes2(matrix)
print('===============')
solution.print_matrix(matrix)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,605
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/merge_intervals.py
|
from utils.interval import Interval
class Solution:
def merge_intervals(self, intervals):
"""
type: intervals: List[Interval]
rtype: List[Interval]
"""
result = []
intervals.sort(key=lambda interval:interval.start)
for interval in intervals:
if not result or interval.start > result[-1].end:
result.append(interval)
else:
result[-1].end = max(result[-1].end, interval.end)
return result
interval1 = Interval(2, 5)
interval2 = Interval(7, 10)
interval3 = Interval(4, 6)
intervals = [interval1, interval3, interval2]
print(intervals)
solution = Solution()
print(solution.merge_intervals(intervals))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,606
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/min_path_sum.py
|
from utils.matrix import Matrix
class Solution:
def min_path_sum(self, matrix):
row_count, col_count = matrix.row_count, matrix.col_count
if not row_count or not col_count:
return 0
sum_row = [float('inf') for _ in range(col_count + 1)]
sum_row[1] = 0
for row in range(1, row_count + 1):
new_sum_row = [float('inf') for _ in range(col_count + 1)]
for col in range(1, col_count + 1):
new_sum_row[col] = matrix[row - 1][col - 1] + min(new_sum_row[col - 1], sum_row[col])
sum_row = new_sum_row
return sum_row[-1]
matrix = Matrix([[5,2,8],[6,1,0],[3,3,7]])
print(matrix)
solution = Solution()
print(solution.min_path_sum(matrix))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,607
|
aymane081/python_algo
|
refs/heads/master
|
/trees/binary_tree_inorder_traversal.py
|
from utils.treeNode import TreeNode
from utils.treeUtils import generate_tree
class Solution:
def in_order_traversal(self, node):
result = []
self.in_order_rec(node, result)
return result
def in_order_rec(self, node, result):
if not node:
return
self.in_order_rec(node.left, result)
result.append(node.value)
self.in_order_rec(node.right, result)
def in_order_traversal2(self, node):
result = []
if not node:
return result
stack = []
while node or stack:
if node:
stack.append(node)
node = node.left
continue
node = stack.pop()
result.append(node.value)
node = node.right
return result
def in_order_traversal3(self, node):
stack, result = [], []
while node:
stack.append(node)
node = node.left
while stack:
node = stack.pop()
result.append(node.value)
if node.right:
node = node.right
while node:
stack.append(node)
node = node.left
return result
root = generate_tree()
print(root)
solution = Solution()
print(solution.in_order_traversal3(root))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,608
|
aymane081/python_algo
|
refs/heads/master
|
/strings/addBinary.py
|
import unittest
def add_binary(str1, str2):
"""
:type str1: str
:type str2: str
:rtype: str
"""
carry = 0
result = []
i = len(str1) - 1
j = len(str2) - 1
while carry or i >= 0 or j >= 0:
total = carry
if i >= 0:
total += int(str1[i])
i -= 1
if j >= 0:
total += int(str2[j])
j -= 1
result.append(str(total % 2))
carry = total // 2
return ''.join(result[::-1])
class Test(unittest.TestCase):
data = [('11', '1', '100')]
def test_add_binary(self):
for test_data in self.data:
actual = add_binary(test_data[0], test_data[1])
self.assertEqual(actual, test_data[2])
if __name__ == '__main__':
unittest.main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,609
|
aymane081/python_algo
|
refs/heads/master
|
/trees/preorder_traversal.py
|
from utils.treeNode import TreeNode
from utils.treeUtils import generate_tree
class Solution:
def preorder_traversal(self, node):
result, rights = [], []
while node or rights:
if not node:
node = rights.pop()
result.append(node.value)
if node.right:
rights.append(node.right)
node = node.left
return result
def preorder_traversal2(self, root):
result = []
if not root:
return result
stack = [root]
while stack:
node = stack.pop()
result.append(node.value)
if node.right:
stack.append(node.right)
if node.left:
stack.append(node.left)
return result
def preorder_traversal3(self, node):
result = []
self.preorder_traversal_rec(node, result)
return result
def preorder_traversal_rec(self, node, result):
if not node:
return
result.append(node.value)
self.preorder_traversal_rec(node.left, result)
self.preorder_traversal_rec(node.right, result)
root = generate_tree()
print(root)
solution = Solution()
print(solution.preorder_traversal2(root))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,610
|
aymane081/python_algo
|
refs/heads/master
|
/utils/treeNode.py
|
class TreeNode:
def __init__(self, value = None, left = None, right = None):
self.value = value
self.left = left
self.right = right
def __repr__(self):
return self.trace(padding="")
def trace(self, padding=""):
string_representation = ''
if self.right:
string_representation += self.right.trace(padding + " ") + "\n"
string_representation += padding + str(self.value) + "\n"
if self.left:
string_representation += self.left.trace(padding + " ")
return string_representation
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,611
|
aymane081/python_algo
|
refs/heads/master
|
/binarySearch/heaters.py
|
from bisect import bisect
class Solution:
# n = len(houses), m = len(heathers)
# O(m log m + n log m) = O(max(mlogm, nlogm)) time - O(1) space
def get_heathers_radius(self, houses, heathers):
heathers = [float('-inf')] + sorted(heathers) + [float('inf')]
result = 0
for house in houses:
i = bisect(heathers, house)
min_distance = min(house - heathers[i-1], heathers[i] - house)
result = max(result, min_distance)
return result
houses = [1, 2, 3, 4]
heathers = [2]
solution = Solution()
print(solution.get_heathers_radius(houses, heathers))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,612
|
aymane081/python_algo
|
refs/heads/master
|
/trees/find_largest_value_in_each_tree_row.py
|
# 515
from utils.treeNode import TreeNode
# time: O(N)
# space: O(N)
class Solution:
def max_rows(self, root):
result = []
if not root:
return result
self.traverse(root, 0, result)
return result
def traverse(self, root, level, result):
if not root:
return
if len(result) == level:
result.append(root.value)
else:
result[level] = max(result[level], root.value)
self.traverse(root.left, level + 1, result)
self.traverse(root.right, level + 1, result)
# time: O(N)
# space: O(N)
class Solution2:
def max_rows(self, root):
result = []
if not root:
return result
level = [root]
while level:
new_level = []
max_value = max(map(lambda node: node.value, level))
result.append(max_value)
for node in level:
if node.left:
new_level.append(node.left)
if node.right:
new_level.append(node.right)
level = new_level
return result
one = TreeNode(1)
two = TreeNode(2)
three = TreeNode(3)
four = TreeNode(4)
five = TreeNode(5)
six = TreeNode(6)
seven = TreeNode(7)
one.left = five
five.left = three
five.right = four
one.right = two
two.right = six
six.right = seven
print(one)
print('===========')
solution = Solution2()
print(solution.max_rows(one))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,613
|
aymane081/python_algo
|
refs/heads/master
|
/trees/kth_smallest_element_in_bst.py
|
class Solution:
def get_kth_smallest(self, node, k):
count = self.count(node.left)
if k <= count:
return self.get_kth_smallest(node.left, k)
elif k > count + 1:
return self.get_kth_smallest(node.right, k - count - 1)
return node.value
def count(self, node):
if not node:
return 0
return 1 + self.count(node.left) + self.count(node.right)
def get_kth_smallest2(self, node, k):
stack = []
while node:
stack.append(node.value)
node = node.left
while stack:
node = stack.pop()
k -= 1
if k == 0:
return node.value
if node.right:
node = node.right
while node:
stack.append(node)
node = node.left
def get_kth_smallest3(self, node, k):
self.k = k
self.result = None
self.helper(node)
return self.result
def helper(self, node):
if not node:
return
self.helper(node.left)
self.k -= 1
if self.k == 0:
self.result = node.value
return
self.helper(node.right)
def get_kth_smallest(root, k):
left_count = get_count(root.left)
if left_count <= k:
return get_kth_smallest(root.left, k)
if left_count == k + 1:
return root.value
return get_kth_smallest(root.right, k - left_count - 1)
def get_count(root):
if not root:
return 0
return 1 + get_count(root.left) + get_count(root.right)
def get_kth_smallest4(root, k):
stack = []
while root:
stack.append(root)
root = root.left
while stack:
node = stack.pop()
k -= 1
if k == 0:
return node.value
if node.right:
node = node.right
while node:
stack.append(node)
node = node.left
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,614
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/array_partition_1.py
|
# 561
class Solution:
def partition(self, nums):
result = 0
if not nums:
return result
nums.sort()
for i in range(0, len(nums), 2):
result += nums[i]
return result
class Solution2:
def partition(self, nums):
return sum(sorted(nums)[::2])
solution = Solution2()
nums = [1,4, 3, 2]
print(solution.partition(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,615
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/couting_bits.py
|
class Solution:
def get_ones(self, n):
if n < 0:
return 0
ones = [0 for _ in range(n + 1)]
for i in range(1, n + 1):
ones[i] = ones[i // 2] + i % 2
return ones
solution = Solution()
print(solution.get_ones(5))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,616
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/spiral_matrix.py
|
class Solution:
def spiral(self, matrix):
rows_count = len(matrix[0])
cols_count = len(matrix)
row, col = 0, -1
d_row, d_col = 0, 1
row_leg, col_leg = rows_count, cols_count - 1
leg_count = 0
spiral = []
for _ in range(rows_count * cols_count):
row += d_row
col += d_col
spiral.append(matrix[row][col])
leg_count += 1
if (d_row == 0 and leg_count == row_leg) or (d_col == 0 and leg_count == col_leg):
# change direction
# decrease the right leg (possible number of moves through the axis)
if d_row == 0:
row_leg -= 1
else:
col_leg -= 1
# get the new direction
d_row, d_col = d_col, - d_row
leg_count = 0
return spiral
def print_matrix(self, matrix):
for row in matrix:
print(row)
solution = Solution()
matrix = [[1,2,3],[5,6,7],[9,10,11],[13,14,15]]
solution.print_matrix(matrix)
print(solution.spiral(matrix))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,617
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/jump_game.py
|
class Solution:
def can_jump(self, nums):
last = len(nums) - 1
for i in range(last - 1, -1, -1):
if i + nums[i] >= last:
last = i
return last == 0
def can_jump2(self, nums):
max_reached = 0
stack = [0]
while stack:
index = stack.pop()
if index + nums[index] > max_reached:
if index + nums[index] >= len(nums) - 1:
return True
for i in range(max_reached + 1, index + nums[index] + 1):
stack.append(i)
max_reached = index + nums[index]
return False
nums = [2,3,1,0,4]
# nums = [3, 2, 1, 0, 4]
solution = Solution()
print(solution.can_jump2(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,618
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/unique_paths.py
|
class Solution:
# time: O(rows_count * cols_count). space: O(cols_count)
def get_unique_paths_count(self, rows_count, cols_count):
row_paths = [1 for _ in range(cols_count)]
for _ in range(1, rows_count):
new_row_paths = [1]
for col in range(1, cols_count):
new_row_paths.append(new_row_paths[-1] + row_paths[col])
row_paths = new_row_paths
return row_paths[-1]
def get_unique_paths_count2(self, rows_count, cols_count):
if rows_count == 0 or cols_count == 0:
return 0
if rows_count == 1 or cols_count == 1:
return 1
res = 1
for i in range(1, cols_count):
res *= (cols_count + rows_count - 1 - i) / i
return int(res)
solution = Solution()
print(solution.get_unique_paths_count2(6, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,619
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/array_nesting.py
|
# 565
class Solution:
def array_nesting(self, nums):
result = 0
if not nums:
return result
for i in range(len(nums)):
if nums[i] == float('inf'):
continue
start, count = i, 0
while nums[start] != float('inf'):
temp = start
start = nums[start]
nums[temp] = float('inf')
count += 1
result = max(result, count)
return result
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,620
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/minumum_height_trees.py
|
from collections import defaultdict
class Solution:
def get_min_height_trees(self, n, edges):
graph = defaultdict(set)
for edge in edges:
graph[edge[0]].add(edge[1])
graph[edge[1]].add(edge[0])
height_to_nodes = defaultdict(set)
for node in graph:
self.bfs(node, graph, set(), height_to_nodes)
min_height = min(height_to_nodes.keys())
return list(height_to_nodes[min_height])
def bfs(self, node, graph, visited, height_to_nodes):
height = -1
queue = [node]
visited.add(node)
while queue:
height += 1
new_queue = []
for curr in queue:
for nbr in graph[curr]:
if nbr in visited:
continue
visited.add(nbr)
new_queue.append(nbr)
queue = new_queue
height_to_nodes[height].add(node)
def get_min_height_trees2(self, n, edges):
graph = defaultdict(set)
for edge in edges:
graph[edge[0]].add(edge[1])
graph[edge[1]].add(edge[0])
leaves = [i for i in graph if len(graph[i]) == 1]
while len(graph) > 2:
new_leaves = []
for leaf in leaves:
nbr = graph[leaf].pop()
del graph[leaf]
graph[nbr].remove(leaf)
if len(graph[nbr]) == 1:
new_leaves.append(nbr)
leaves = new_leaves
return list(graph.keys())
solution = Solution()
# edges = [[1, 0], [1, 2], [1, 3]]
# print(solution.get_min_height_trees2(4, edges))
edges = [[0, 3], [1, 3], [2, 3], [4, 3], [5, 4]]
print(solution.get_min_height_trees2(6, edges))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,621
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/dfs.py
|
from utils.graph import Vertex, Graph
class Solution:
# DFS
def search(self, graph, start, end):
if not end:
return
if start == end:
return True
visited = set()
set.add(start)
for nbr in graph[start]:
if nbr not in visited:
if self.search(graph, nbr, end):
return True
return False
def search_BFS(self, graph, start, end):
if start == end:
return True
start.visited = True
queue = [start]
while queue:
new_queue = []
for node in queue:
for nbr in graph[node]:
if nbr == end:
return True
if not nbr.visited:
nbr.visited = True
new_queue.append(nbr)
queue = new_queue
return False
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,622
|
aymane081/python_algo
|
refs/heads/master
|
/dynamicProgramming/largest_divisible_subset.py
|
# 368
class Solution:
#O(N ** 2) time, O(N) space
def get_largest_divisible_subset(self, nums):
if not nums:
return []
max_to_set = dict()
nums.sort()
for num in nums:
new_set = set()
for max_in_s, s in max_to_set.items():
if num % max_in_s == 0 and len(s) > len(new_set):
new_set = s
max_to_set[num] = new_set | { num }
return list(max(max_to_set.values(), key=len))
def get_max_divisible_subset_length(self, nums):
"""
returns the length of the longest divisible subset
"""
if not nums:
return 0
max_lengths = [1]
max_length = 1
for i in range(1, len(nums)):
max_length_here = 1
for j in range(i - 1, -1, -1):
if nums[i] % nums[j] == 0:
max_length_here = max(max_length_here, 1 + max_lengths[j])
max_lengths.append(max_length_here)
max_length = max(max_length, max_length_here)
return max_length
solution = Solution()
nums = [1,2,3]
print(solution.get_largest_divisible_subset(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,623
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/maximize_distance_to_closest_person.py
|
# 849
class Solution:
def max_distance_to_closest(self, seats):
if not seats:
return 0
n = len(seats)
lefts, rights = [n] * n, [n] * n
for i in range(len(seats)):
if seats[i] == 1:
lefts[i] = 0
elif i > 0:
lefts[i] = 1 + lefts[i - 1]
for i in range(n - 1, -1, -1):
if seats[i] == 1:
rights[i] = 0
elif i < n - 1:
rights[i] = 1 + rights[i + 1]
return max(min(lefts[i], rights[i]) for i in range(n))
class Solution2:
def max_distance_to_closest(self, seats):
if not seats:
return 0
n = len(seats)
lefts, rights = [n] * n, [n] * n
for i in range(n):
if seats[i] == 1:
lefts[i] = 0
elif i > 0:
lefts[i] = lefts[i - 1] + 1
for i in range(n - 1, -1, -1):
if seats[i] == 1:
rights[i] = 0
elif i < n - 1:
rights[i] = rights[i + 1] + 1
return max(min(lefts[i], rights[i]) for i in range(n))
seats = [1,0,0,0,1,0,1]
solution = Solution()
print(solution.max_distance_to_closest(seats))
[0, 1, 2, 1, 0, 1, 0]
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,624
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/shuffle_array.py
|
import random
class Solution:
def __init__(self, nums):
self.original = nums
# def shuffle(self):
# shuffled = []
# copy = list(self.original)
# for i in range(len(copy) - 1, -1, -1):
# index = random.randint(0, i)
# shuffled.append(copy[index])
# copy[index] = copy[-1]
# copy.pop()
# return shuffled
def shuffle(self):
shuffled = list(self.original)
for i in range(len(shuffled)):
swap = random.randint(i, len(shuffled) - 1)
shuffled[i], shuffled[swap] = shuffled[swap], shuffled[i]
return shuffled
def restore(self):
return self.original
nums = [1,2,3,4]
solution = Solution(nums)
print(solution.shuffle())
print(solution.shuffle())
print(solution.restore())
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,625
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/add_1.py
|
class Solution(object):
def add_one(self, arr):
"""
:type arr: list[int]
:rtype: list[int]
"""
sum = 0
carry = 1
arr.reverse()
for i, c in enumerate(arr):
sum = c + carry
arr[i] = sum % 10
carry = sum // 10
if carry == 1:
arr.append(1)
arr.reverse()
return arr
def add_one2(self, digits):
"""
:type digits: list[int]
:rtype: list[int]
"""
i = len(digits) - 1
while i >= 0 and digits[i] == 9:
digits[i] = 0
i -= 1
if i == -1:
return [1] + digits
return digits[:i] + [digits[i] + 1] + digits[i + 1 :]
solution = Solution()
print(solution.add_one2([9, 8, 9]))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,626
|
aymane081/python_algo
|
refs/heads/master
|
/binarySearch/pow.py
|
class Solution:
def pow(self, x, n):
if n == 0:
return 1
if n < 0:
n *= -1
x = 1/x
# return x * pow(x, n - 1)
return pow(x*x, n // 2) if n % 2 == 0 else x * pow(x * x, n // 2)
solution = Solution()
print(solution.pow(2, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,627
|
aymane081/python_algo
|
refs/heads/master
|
/strings/decode_ways.py
|
#Gotcha: because int are immutable in python, changing it in a function does not update its value outside of this method
# therefore, we have to return its value from the function that changes it
class Solution(object):
def decode_ways(self, nums):
"""
:type nums: str
:rtype: int
"""
if not nums:
return 0
result = 0
result = self.decode_ways_count(nums, 0, result)
return result
def decode_ways_count(self, nums, index, result):
# went through all the digits in the string, increment the result count
if index == len(nums):
result += 1
elif nums[index] != '0':
# The digit at index is not 0, I can use it to get a character
result = self.decode_ways_count(nums, index + 1, result)
# Check if we can build a character using 2 digits
if index < len(nums) - 1 and 10 <= int(nums[index: index + 2]) <= 26:
result = self.decode_ways_count(nums, index + 2, result)
return result
def get_decode_ways(self, code):
"""
type code: str
rtype: int
"""
if not code:
return 0
ways = [0 for _ in range(len(code) + 1)]
ways[0] = 1
if code[0] != '0':
ways[1] = 1
for i in range(1, len(code)):
if code[i] != '0':
ways[i + 1] += ways[i]
if 10 <= int(code[i-1: i+1]) <= 26:
ways[i + 1] += ways[i - 1]
return ways[-1]
solution = Solution()
print(solution.decode_ways('12123'))
print(solution.get_decode_ways('12123'))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,628
|
aymane081/python_algo
|
refs/heads/master
|
/trees/trim_binary_search_tree.py
|
#669
from utils.treeNode import TreeNode
class Solution:
def trim(self, root, l, r):
if not root:
return root
if root.value < l:
return self.trim(root.right, l, r)
if root.value > r:
return self.trim(root.left, l, r)
root.left, root.right = self.trim(root.left, l, r), self.trim(root.right, l, r)
return root
class Solution2:
def trim(self, root, l, r):
if not root:
return root
root.left, root.right = self.trim(root.left, l, r), self.trim(root.right, l, r)
if root.value < l:
return root.right
if root.value > r:
return root.left
return root
# one = TreeNode(1)
# zero = TreeNode(0)
# two = TreeNode(2)
# one.left = zero
# one.right = two
one = TreeNode(1)
zero = TreeNode(0)
two = TreeNode(2)
three = TreeNode(3)
four = TreeNode(4)
three.left = zero
zero.right = two
two.left = one
three.right = four
print(three)
print('=============')
solution = Solution()
print(solution.trim(three, 1, 3))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,629
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/find_peak_element.py
|
#162
class Solution:
def get_peak(self, nums):
left, right = 0, len(nums) - 1
while left < right:
mid = (left + right) // 2
mid2 = mid + 1 # will not exceed len(nums) - 1 because left < right
if nums[mid] < nums[mid2]: #mid2 is potential peak
left = mid2 #notice how it is mid2 and not mid2+1
else: #mid is potential peak
right = mid #notice how it is mid and not mid - 1
return nums[left]
nums = [1, 2, 3, 1]
solution = Solution()
print(solution.get_peak(nums))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,630
|
aymane081/python_algo
|
refs/heads/master
|
/linkedList/remove_duplicates2.py
|
#82
from utils.listNode import ListNode
class Solution:
def remove_duplicates(self, head):
if not head:
return head
curr, runner = head, head.next
while runner:
if curr.value != runner.value:
curr.next = runner
curr = curr.next
runner = runner.next
curr.next = None
return head
one = ListNode(1)
two = ListNode(1)
three = ListNode(3)
four = ListNode(3)
five = ListNode(4)
six = ListNode(4)
seven = ListNode(5)
one.next = two
two.next = three
three.next = four
four.next = five
five.next = six
six.next = seven
print(one)
solution = Solution()
print(solution.remove_duplicates(one))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,631
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/merge_sorted_arrays.py
|
class Solution(object):
def merge_sorted_arrays(self, nums1, nums2):
m = len(nums1)
n = len(nums2)
nums1 += [0] * n
i = m - 1
j = n - 1
k = i + j + 1
while i >= 0 and j >= 0:
nums1[k] = max(nums1[i], nums2[j])
k -= 1
if nums1[i] < nums2[j]:
j -= 1
else:
i -= 1
# nothing to move if only nums1 digits are left, move the rest of digits2 if any
if j >= 0:
nums1[:k+ 1] = nums2[:j + 1]
return nums1
arr1 = [5, 7, 12, 20]
arr2 = [2, 6, 9, 40, 80]
solution = Solution()
print(solution.merge_sorted_arrays(arr1, arr2))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,632
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/diagonal_traverse.py
|
from utils.matrix import Matrix
class Solution:
def traverse(self, matrix):
"""
:type matrix: Matrix
:rtype: List[int]
"""
if not matrix.row_count or not matrix.col_count:
return
row, col = 0, 0
d_row, d_col = -1, 1
result = []
for _ in range(matrix.row_count * matrix.col_count):
result.append(matrix[row][col])
row += d_row
col += d_col
if not self.is_valid_cell(row, col, matrix):
if col == matrix.col_count:
col -= 1
row += 2
elif row < 0:
row = 0
elif row == matrix.row_count:
row -= 1
col += 2
elif col < 0:
col = 0
d_row, d_col = d_col, d_row
return result
def is_valid_cell(self, row, col, matrix):
return (
row >= 0 and row < matrix.row_count and
col >= 0 and col < matrix.col_count
)
# matrix = Matrix([[1,2,3],[4,5,6]])
matrix = Matrix([[1,2,3],[4,5,6], [7,8,9]])
print(matrix)
solution = Solution()
print(solution.traverse(matrix))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,633
|
aymane081/python_algo
|
refs/heads/master
|
/strings/super_reduced_string.py
|
import unittest
# Time: O(N) - Space: O(N)
class Solution(object):
def super_reduced_string(self, str):
res = []
for c in str:
if res and res[-1] == c:
res.pop()
else:
res.append(c)
return ''.join(res)
class Test(unittest.TestCase):
test_data = [('aaabccbddd', 'ad')]
def test_super_reduced_string(self):
solution = Solution()
for data in self.test_data:
actual = solution.super_reduced_string(data[0])
self.assertEqual(actual, data[1])
if __name__ == '__main__':
unittest.main()
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,634
|
aymane081/python_algo
|
refs/heads/master
|
/trees/symetric_tree.py
|
from utils.treeNode import TreeNode
class Solution:
# O(N) time and space
def is_symetric(self, root):
"""
type root: TreeNode
rtype: bool
"""
if not root:
return True
return self.is_mirror(root.left, root.right)
def is_mirror(self, node1, node2):
if not node1 and not node2:
return True
if not node1 or not node2:
return False
if node1.value != node2.value:
return False
return self.is_mirror(node1.left, node2.right) and self.is_mirror(node1.right, node2.left)
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,635
|
aymane081/python_algo
|
refs/heads/master
|
/graphs/eventually_safe.py
|
from collections import defaultdict
class Solution:
WHITE, GRAY, BLACK = 0, 1, 2
def eventually_safe_nodes(self, graph):
"""
:type graph: List[List[int]]
:rtype: List[int]
"""
colors = defaultdict(int)
result_set = set()
for node in range(len(graph)):
self.dfs(node, graph, colors, result_set)
return sorted(list(result_set))
def dfs(self, node, graph, colors, result_set):
if colors[node] != self.WHITE:
return colors[node] == self.BLACK
colors[node] = self.GRAY
for nbr in graph[node]:
if colors[nbr] == self.BLACK:
continue
if colors[nbr] == self.GRAY or not self.dfs(nbr, graph, colors, result_set):
return False
colors[node] = self.BLACK
result_set.add(node)
return True
def eventually_safe_nodes2(self, graph):
n = len(graph)
out_degree = [0] * n
in_nodes = defaultdict(list)
terminales = []
for i in range(n):
out_degree[i] = len(graph[i])
if out_degree[i] == 0:
terminales.append(i)
for j in graph[i]:
in_nodes[j].append(i)
for term in terminales:
for in_node in in_nodes[term]:
out_degree[in_node] -= 1
if out_degree[in_node] == 0:
terminales.append(in_node)
return sorted(terminales)
solution = Solution()
graph = [[1,2],[2,3],[5],[0],[5],[],[]]
print(solution.eventually_safe_nodes2(graph))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,636
|
aymane081/python_algo
|
refs/heads/master
|
/utils/treeUtils.py
|
from utils.treeNode import TreeNode
def generate_tree():
node1 = TreeNode(1)
node2 = TreeNode(2)
node3 = TreeNode(3)
node4 = TreeNode(4)
node5 = TreeNode(5)
node6 = TreeNode(6)
node7 = TreeNode(7)
node1.left = node2
node1.right = node3
node2.left = node4
node2.right = node5
node3.left = node6
node6.left = node7
return node1
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,637
|
aymane081/python_algo
|
refs/heads/master
|
/linkedList/remove_linked_list_elements.py
|
# 203
from utils.listNode import ListNode
class Solution:
def remove_element(self, head, target):
if not head:
return
dummy, prev = ListNode(None), ListNode(None)
dummy.next = head
prev = dummy
while head:
if head.value == target:
prev.next = head.next
else:
prev = head
head = head.next
return dummy.next
one = ListNode(6)
two = ListNode(2)
three = ListNode(6)
four = ListNode(3)
five = ListNode(4)
six = ListNode(5)
seven = ListNode(6)
one.next = two
two.next = three
three.next = four
four.next = five
five.next = six
six.next = seven
print(one)
# solution = Solution()
# print(solution.remove_element(one, 6))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,638
|
aymane081/python_algo
|
refs/heads/master
|
/trees/longest_univalue_path.py
|
#687
class Solution:
def longest_univalue_path(self, root):
if not root:
return 0
return max(self.longest_univalue_path(root.left),
self.longest_univalue_path(root.right),
self.straight_univalue_path(root.left, root.value) + self.straight_univalue_path(root.right, root.value))
def straight_univalue_path(self, root, value):
if not root or root.value != value:
return 0
return max(self.straight_univalue_path(root.left, value), self.straight_univalue_path(root.right, value)) + 1
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
9,639
|
aymane081/python_algo
|
refs/heads/master
|
/arrays/third_max.py
|
class Solution(object):
def get_third_max(self, numbers):
if not numbers:
return None
max1, max2, max3 = None, None, None
for num in numbers:
if num in (max1, max2, max3):
continue
elif not max1 or max1 < num:
max3 = max2
max2 = max1
max1 = num
elif not max2 or max2 < num:
max3 = max2
max2 = num
elif not max3 or max3 < num:
max3 = num
return max3 if max3 else max1
solution = Solution()
numbers = [3, 5, 8, 5, 5, 2, 5]
print(solution.get_third_max(numbers))
|
{"/linkedList/linked_list_cycle.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/range_sum_query2.py": ["/utils/matrix.py"], "/linkedList/remove_duplicates.py": ["/utils/listNode.py"], "/linkedList/delete_nth_node_from_end.py": ["/utils/listNode.py"], "/linkedList/odd_even_linked_list.py": ["/utils/listNode.py"], "/trees/binary_tree_pruning.py": ["/utils/treeNode.py"], "/linkedList/linked_list_components.py": ["/utils/listNode.py"], "/trees/path_sum.py": ["/utils/treeNode.py"], "/binarySearch/find_right_interval.py": ["/utils/interval.py"], "/trees/maximum_binary_tree.py": ["/utils/treeNode.py"], "/trees/diameter_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/reorder_list.py": ["/utils/listNode.py"], "/trees/binary_tree_from_sorted_array.py": ["/utils/treeNode.py"], "/trees/invert_binary_tree.py": ["/utils/treeNode.py"], "/trees/print_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/delete_node_linked_list.py": ["/utils/listNode.py"], "/dynamicProgramming/maximum_square.py": ["/utils/matrix.py"], "/trees/binary_tree_paths.py": ["/utils/treeNode.py"], "/arrays/word_search.py": ["/utils/matrix.py"], "/linkedList/merge_two_sorted_lists.py": ["/utils/listNode.py"], "/arrays/search_matrix.py": ["/utils/matrix.py"], "/trees/maximum_width_binary_tree.py": ["/utils/treeNode.py"], "/linkedList/intersection_of_two_linked_list.py": ["/utils/listNode.py"], "/trees/substree_of_another_tree.py": ["/utils/treeNode.py"], "/linkedList/split_linked_list_in_parts.py": ["/utils/listNode.py"], "/trees/lowest_common_ancestor.py": ["/utils/treeNode.py"], "/graphs/number_of_islands.py": ["/utils/matrix.py"], "/trees/most_frequent_substree_sum.py": ["/utils/treeNode.py"], "/linkedList/rotate_list.py": ["/utils/listNode.py"], "/linkedList/reverse_linked_list2.py": ["/utils/listNode.py"], "/linkedList/partition_list.py": ["/utils/listNode.py"], "/trees/same_tree.py": ["/utils/treeNode.py"], "/trees/next_right_pointer.py": ["/utils/treeNode.py"], "/trees/path_sum3.py": ["/utils/treeNode.py"], "/trees/is_balanced.py": ["/utils/treeNode.py"], "/trees/unique_bst2.py": ["/utils/treeNode.py"], "/trees/binary_tree_level_order_traversal.py": ["/utils/treeNode.py"], "/trees/minimum_depth.py": ["/utils/treeNode.py"], "/trees/sum_root_to_leaf_numbers.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/binary_tree_side_view.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/arrays/merge_intervals.py": ["/utils/interval.py"], "/arrays/min_path_sum.py": ["/utils/matrix.py"], "/trees/binary_tree_inorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/preorder_traversal.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_largest_value_in_each_tree_row.py": ["/utils/treeNode.py"], "/graphs/dfs.py": ["/utils/graph.py"], "/trees/trim_binary_search_tree.py": ["/utils/treeNode.py"], "/linkedList/remove_duplicates2.py": ["/utils/listNode.py"], "/arrays/diagonal_traverse.py": ["/utils/matrix.py"], "/trees/symetric_tree.py": ["/utils/treeNode.py"], "/utils/treeUtils.py": ["/utils/treeNode.py"], "/linkedList/remove_linked_list_elements.py": ["/utils/listNode.py"], "/trees/second_minimum_binary_tree.py": ["/utils/treeNode.py"], "/graphs/pacific_atlantic.py": ["/utils/matrix.py"], "/trees/binary_tree_zigzag_level_order.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/linkedList/swap_nodes_in_pair.py": ["/utils/listNode.py"], "/trees/add_one_row_to_tree.py": ["/utils/treeNode.py"], "/trees/tree_from_preorder_inorder.py": ["/utils/treeUtils.py"], "/linkedList/add_two_numbers.py": ["/utils/listNode.py"], "/trees/bst_iterator.py": ["/utils/treeNode.py"], "/trees/path_sum2.py": ["/utils/treeNode.py"], "/linkedList/insertion_sort_list.py": ["/utils/listNode.py"], "/trees/flatten_binary_tree.py": ["/utils/treeNode.py", "/utils/treeUtils.py"], "/trees/find_bottom_left_value.py": ["/utils/treeNode.py"], "/trees/tree_from_postorder_inorder.py": ["/utils/treeNode.py"], "/linkedList/palindrome_linked_list.py": ["/utils/listNode.py"], "/trees/left_leaves_sum.py": ["/utils/treeNode.py"]}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.