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:
... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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)... | {"/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"], "/lin... |
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 - nod... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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:
pa... | {"/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"], "/lin... |
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':
... | {"/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"], "/lin... |
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
retur... | {"/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"], "/lin... |
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:
r... | {"/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"], "/lin... |
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()
pr... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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,... | {"/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"], "/lin... |
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 ... | {"/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"], "/lin... |
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 =... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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_... | {"/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"], "/lin... |
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(... | {"/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"], "/lin... |
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"], "/lin... |
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(... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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])
s... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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 elemen... | {"/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"], "/lin... |
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(nei... | {"/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"], "/lin... |
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[-... | {"/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"], "/lin... |
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_count... | {"/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"], "/lin... |
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 ... | {"/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"], "/lin... |
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 no... | {"/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"], "/lin... |
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)]
... | {"/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"], "/lin... |
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
# nod... | {"/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"], "/lin... |
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(zero... | {"/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"], "/lin... |
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(s... | {"/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"], "/lin... |
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 ==... | {"/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"], "/lin... |
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:
c... | {"/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"], "/lin... |
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)
retu... | {"/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"], "/lin... |
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 climbS... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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.absH... | {"/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"], "/lin... |
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:
r... | {"/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"], "/lin... |
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:
r... | {"/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"], "/lin... |
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"], "/lin... |
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... | {"/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"], "/lin... |
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_re... | {"/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"], "/lin... |
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_... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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]
... | {"/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"], "/lin... |
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_t... | {"/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"], "/lin... |
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]
ra... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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 leve... | {"/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"], "/lin... |
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[ta... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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(... | {"/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"], "/lin... |
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:
#... | {"/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"], "/lin... |
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"], "/lin... |
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... | {"/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"], "/lin... |
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 in... | {"/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"], "/lin... |
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)
... | {"/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"], "/lin... |
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'
... | {"/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"], "/lin... |
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 no... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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 -... | {"/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"], "/lin... |
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)
... | {"/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"], "/lin... |
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.righ... | {"/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"], "/lin... |
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 hous... | {"/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"], "/lin... |
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 ... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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"], "/lin... |
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):
... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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):
... | {"/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"], "/lin... |
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('in... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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 ... | {"/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"], "/lin... |
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():
... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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])
... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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"], "/lin... |
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
""... | {"/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"], "/lin... |
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)
ro... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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.n... | {"/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"], "/lin... |
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
... | {"/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"], "/lin... |
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 = []
fo... | {"/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"], "/lin... |
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.Te... | {"/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"], "/lin... |
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, ... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
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 = node... | {"/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"], "/lin... |
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:
... | {"/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"], "/lin... |
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_univalu... | {"/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"], "/lin... |
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... | {"/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"], "/lin... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.