Skip to content

Commit d0a0ce6

Browse files
keonkeon
committed
update bunch2
1 parent b3583c1 commit d0a0ce6

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

53 files changed

+2720
-33
lines changed

‎README.md

+125-29
Original file line numberDiff line numberDiff line change
@@ -7,45 +7,109 @@ List of Implementations:
77
```
88
.
99
├── array
10+
│   ├── circular_counter.py
11+
│   ├── flatten.py
1012
│   ├── garage.py
11-
│   ├── house_robber.py
12-
│   ├── longest_increasing_subsequence.py
1313
│   ├── longest_non_repeat.py
14+
│   ├── merge_intervals.py
15+
│   ├── missing_ranges.py
1416
│   ├── plus_one.py
15-
│   └── wiggle_sort.py
17+
│   ├── rotate_array.py
18+
│   ├── summary_ranges.py
19+
│   ├── three_sum.py
20+
│   └── two_sum.py
1621
├── backtrack
1722
│   ├── anagram.py
23+
│   ├── array_sum_combinations.py
1824
│   ├── combination_sum.py
25+
│   ├── expression_add_operators.py
26+
│   ├── factor_combinations.py
27+
│   ├── general_solution.md
28+
│   ├── generate_abbreviations.py
29+
│   ├── generate_parenthesis.py
30+
│   ├── letter_combination.py
1931
│   ├── palindrome_partitioning.py
32+
│   ├── pattern_match.py
2033
│   ├── permute.py
2134
│   ├── permute_unique.py
2235
│   ├── subsets.py
2336
│   └── subsets_unique.py
2437
├── bfs
25-
│   └── shortest_distance_from_all_buildings.py
26-
├── divide-and-conquer
27-
│   ├── expression-add-operators.py
28-
│   └── the-skyline-problem.py
38+
│   ├── shortest_distance_from_all_buildings.py
39+
│   └── word_ladder.py
40+
├── bit
41+
│   ├── count_ones.py
42+
│   ├── power_of_two.py
43+
│   ├── reverse_bits.py
44+
│   ├── single_number2.py
45+
│   ├── single_number.py
46+
│   └── subsets.py
47+
├── design
48+
│   ├── alarm_system.md
49+
│   ├── all_o_one_ds.md
50+
│   ├── calculator.md
51+
│   ├── excel_table.md
52+
│   ├── LRUcache.md
53+
│   ├── nearby_drivers.md
54+
│   ├── ride_sharing.md
55+
│   ├── task_runner.md
56+
│   └── twitter_feeds.md
57+
├── dfs
58+
│   ├── all_factors.py
59+
│   ├── count_islands.py
60+
│   ├── pacific_atlantic.py
61+
│   ├── sudoku_solver.py
62+
│   └── walls_and_gates.py
2963
├── dp
64+
│   ├── buy_sell_stock.py
65+
│   ├── climbing_stairs.py
66+
│   ├── combination_sum.py
67+
│   ├── house_robber.py
68+
│   ├── longest_increasing.py
69+
│   ├── max_product_subarray.py
3070
│   ├── max_subarray.py
71+
│   ├── num_decodings.py
72+
│   ├── regex_matching.py
3173
│   └── word_break.py
3274
├── graph
75+
│   ├── clone_graph.py
3376
│   ├── find_path.py
3477
│   ├── graph.py
3578
│   └── traversal.py
36-
├── hashtable
37-
│   └── hashtable.py
79+
├── heap
80+
│   ├── merge_sorted_k_lists.py
81+
│   ├── skyline.py
82+
│   └── sliding_window_max.py
3883
├── linkedlist
84+
│   ├── add_two_numbers.py
85+
│   ├── copy_random_pointer.py
86+
│   ├── delete_node.py
3987
│   ├── first_cyclic_node.py
88+
│   ├── is_cyclic.py
4089
│   ├── is_palindrome.py
4190
│   ├── kth_to_last.py
4291
│   ├── linkedlist.py
43-
│   └── remove_duplicates.py
92+
│   ├── remove_duplicates.py
93+
│   ├── reverse.py
94+
│   ├── rotate_list.py
95+
│   └── swap_in_pairs.py
96+
├── map
97+
│   ├── hashtable.py
98+
│   ├── longest_common_subsequence.py
99+
│   ├── randomized_set.py
100+
│   └── valid_sudoku.py
101+
├── math
102+
│   ├── generate_strobogrammtic.py
103+
│   ├── is_strobogrammatic.py
104+
│   ├── nth_digit.py
105+
│   └── sqrt_precision_factor.py
44106
├── matrix
45107
│   ├── bomb_enemy.py
46108
│   ├── matrix_rotation.txt
47-
│   └── pacific_atlantic.py
48-
├── out.txt
109+
│   ├── rotate_image.py
110+
│   ├── sparse_dot_vector.py
111+
│   ├── sparse_mul.py
112+
│   └── spiral_traversal.py
49113
├── queue
50114
│   ├── __init__.py
51115
│   ├── max_sliding_window.py
@@ -59,56 +123,88 @@ List of Implementations:
59123
│   ├── count_elem.py
60124
│   ├── first_occurance.py
61125
│   └── last_occurance.py
62-
├── sorting
126+
├── set
127+
│   └── randomized_set.py
128+
├── sort
63129
│   ├── insertion_sort.py
130+
│   ├── meeting_rooms.py
64131
│   ├── merge_sort.py
65132
│   ├── quick_sort.py
66133
│   ├── selection_sort.py
67-
│   └── sort_colors.py
134+
│   ├── sort_colors.py
135+
│   ├── topsort.py
136+
│   └── wiggle_sort.py
68137
├── stack
69138
│   ├── __init__.py
70139
│   ├── __init__.pyc
71140
│   ├── longest_abs_path.py
72141
│   ├── __pycache__
73142
│   │   ├── __init__.cpython-35.pyc
74143
│   │   └── stack.cpython-35.pyc
144+
│   ├── simplify_path.py
75145
│   ├── stack.py
76-
│   └── stack.pyc
146+
│   ├── stack.pyc
147+
│   └── valid_parenthesis.py
77148
├── string
149+
│   ├── add_binary.py
150+
│   ├── breaking_bad.py
78151
│   ├── decode_string.py
79152
│   ├── encode_decode.py
153+
│   ├── group_anagrams.py
154+
│   ├── int_to_roman.py
155+
│   ├── is_palindrome.py
80156
│   ├── license_number.py
81-
│   ├── missing_ranges.py
157+
│   ├── make_sentence.py
158+
│   ├── multiply_strings.py
159+
│   ├── one_edit_distance.py
82160
│   ├── rabin_karp.py
83161
│   ├── reverse_string.py
84162
│   ├── reverse_vowel.py
85163
│   ├── reverse_words.py
164+
│   ├── roman_to_int.py
86165
│   └── word_squares.py
87-
├── tests
88-
│   └── test_stack.py
166+
├── tmp
167+
│   └── temporary.md
89168
├── tree
90-
│   ├── array2bst.py
169+
│   ├── binary_tree_paths.py
91170
│   ├── bintree2list.py
92-
│   ├── bst_closest_value.py
93-
│   ├── BSTIterator.py
171+
│   ├── bst
172+
│   │   ├── array2bst.py
173+
│   │   ├── bst_closest_value.py
174+
│   │   ├── BSTIterator.py
175+
│   │   ├── delete_node.py
176+
│   │   ├── is_bst.py
177+
│   │   ├── kth_smallest.py
178+
│   │   ├── lowest_common_ancestor.py
179+
│   │   ├── predecessor.py
180+
│   │   ├── serialize_deserialize.py
181+
│   │   ├── successor.py
182+
│   │   └── unique_bst.py
94183
│   ├── deepest_left.py
95184
│   ├── invert_tree.py
96185
│   ├── is_balanced.py
97186
│   ├── is_subtree.py
98187
│   ├── is_symmetric.py
99188
│   ├── longest_consecutive.py
189+
│   ├── lowest_common_ancestor.py
100190
│   ├── max_height.py
101191
│   ├── max_path_sum.py
102192
│   ├── min_height.py
103-
│   ├── predecessor.py
193+
│   ├── path_sum2.py
194+
│   ├── path_sum.py
195+
│   ├── pretty_print.py
104196
│   ├── same_tree.py
105-
│   ├── successor.py
106-
│   └── tree.py
107-
└── trie
108-
├── add_and_search.py
109-
└── trie.py
110-
111-
197+
│   ├── traversal
198+
│   │   ├── inorder.py
199+
│   │   ├── level_order.py
200+
│   │   └── zigzag.py
201+
│   ├── tree.py
202+
│   └── trie
203+
│   ├── add_and_search.py
204+
│   └── trie.py
205+
├── tree.md
206+
└── union-find
207+
└── count_islands.py
112208
113209
```
114210

‎array/circular_counter.py

+46
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
"""
2+
There are people sitting in a circular fashion,
3+
print every third member while removing them,
4+
the next counter starts immediately after the member is removed.
5+
Print till all the members are exhausted.
6+
7+
For example:
8+
Input: consider 123456789 members sitting in a circular fashion,
9+
Output: 369485271
10+
"""
11+
12+
a = ['1','2','3','4','5','6','7','8','9']
13+
14+
def josepheus(int_list, skip):
15+
skip = skip - 1 #list starts with 0 index
16+
idx = 0
17+
while len(int_list)>0:
18+
idx = (skip+idx)%len(int_list) #hashing to keep changing the index to every 3rd
19+
print int_list.pop(idx)
20+
21+
22+
josepheus(a,3)
23+
24+
"""
25+
the reason for hashing is that we have to find the index of the item which needs to be removed.
26+
So for e.g. if you iterate with the initial list of folks with every 3rd item eliminated:
27+
28+
INPUT
29+
int_list = 123456789
30+
skip = 3
31+
32+
While Iteration:
33+
34+
int_list = 123456789
35+
len(int_list) = 9
36+
skip = 2 # as int_list starts from 0
37+
idx = (0 + 2) % 9 #here previous index was 0
38+
so 3rd element which is 3 in this case eliminated
39+
int_list = 12456789
40+
len(int_list) = 8
41+
idx = (2 + 2) % 8 #here previous index was 2
42+
so 3rd element starting from 4th person which is 6 would be deleted.
43+
and so on
44+
The reason why we have to do this way is I am not putting the people who escape at the back of list so ideally in 2 while iteration the list should have been
45+
45678912 and then no hashing needed to be done, which means you can directly remove the third element
46+
"""

‎array/flatten.py

+60
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,60 @@
1+
"""
2+
Implement Flatten Arrays.
3+
Given an array that may contain nested arrays,
4+
give a single resultant array.
5+
6+
function flatten(input){
7+
}
8+
9+
Example:
10+
11+
Input: var input = [2, 1, [3, [4, 5], 6], 7, [8]];
12+
flatten(input);
13+
Output: [2, 1, 3, 4, 5, 6, 7, 8]
14+
"""
15+
16+
17+
def list_flatten(l, a=None):
18+
# check a
19+
if a is None:
20+
# initialize with empty list
21+
a = []
22+
23+
for i in l:
24+
if isinstance(i, list):
25+
list_flatten(i, a)
26+
else:
27+
a.append(i)
28+
return a
29+
30+
31+
# stack version
32+
# public static List<Integer> flatten(List<NestedList> l) {
33+
# List<Integer> main = new ArrayList<Integer>();
34+
# Stack<List<NestedList>> stack = new Stack<List<NestedList>>();
35+
# Stack<Integer> indexes = new Stack<Integer>();
36+
# stack.add(l);
37+
# indexes.add(0);
38+
# while (true) {
39+
# if (stack.isEmpty())
40+
# break;
41+
# int index1 = indexes.pop();
42+
# l = stack.pop();
43+
# for (int i = index1; i < l.size(); i++) {
44+
# NestedList n = l.get(i);
45+
# if (n.isInteger()) {
46+
# main.add(n.value);
47+
# } else {
48+
# stack.add(l);
49+
# indexes.add(i+1);
50+
# l = n.list;
51+
# stack.add(l);
52+
# indexes.add(0);
53+
# break;
54+
55+
# }
56+
# }
57+
# }
58+
59+
# return main;
60+
# }

‎array/summary_ranges.py

+27
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
"""
2+
Given a sorted integer array without duplicates,
3+
return the summary of its ranges.
4+
5+
For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"].
6+
"""
7+
8+
9+
def summary_ranges(nums):
10+
"""
11+
:type nums: List[int]
12+
:rtype: List[str]
13+
"""
14+
res = []
15+
if len(nums) == 1:
16+
return [str(nums[0])]
17+
i = 0
18+
while i < len(nums):
19+
num = nums[i]
20+
while i+1 < len(nums) and nums[i+1] - nums[i] == 1:
21+
i += 1
22+
if nums[i] != num:
23+
res.append(str(num) + "->" + str(nums[i]))
24+
else:
25+
res.append(str(num))
26+
i += 1
27+
return res

0 commit comments

Comments
 (0)