Skip to content

Dilan/interviewproblems

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

124 Commits
data
data
 
 
lib
lib
 
 
test
test
 
 
.gitignore
.gitignore
 
 
PriorityQueue.js
PriorityQueue.js
 
 
README.md
README.md
 
 
__init__.py
__init__.py
 
 
alphabet_decode_ways.js
alphabet_decode_ways.js
 
 
binary-tree-postordert-traversal.go
binary-tree-postordert-traversal.go
 
 
binary_search.go
binary_search.go
 
 
binary_tree_max_path_sum.py
binary_tree_max_path_sum.py
 
 
binary_tree_superbalanced_check.js
binary_tree_superbalanced_check.js
 
 
build-binary-tree-from-preorder-traversal.go
build-binary-tree-from-preorder-traversal.go
 
 
calculate-18-length-numbers.py
calculate-18-length-numbers.py
 
 
candies_for_children_in_a_queue.go
candies_for_children_in_a_queue.go
 
 
cheapest-flights-k-stops.go
cheapest-flights-k-stops.go
 
 
check_is_binary_tree_valid.js
check_is_binary_tree_valid.js
 
 
clerks-and-clients-queue.js
clerks-and-clients-queue.js
 
 
closest-BST-value.py
closest-BST-value.py
 
 
coast_length.py
coast_length.py
 
 
coin-denominations.js
coin-denominations.js
 
 
contiguous-array.go
contiguous-array.go
 
 
convert_Word1_to_Word2.go
convert_Word1_to_Word2.go
 
 
count-square-submatrices-with-all-ones.go
count-square-submatrices-with-all-ones.go
 
 
cut-off-tree.py
cut-off-tree.py
 
 
cut-the-rope.py
cut-the-rope.py
 
 
decode_string.py
decode_string.py
 
 
dfs.py
dfs.py
 
 
dijkstra.js
dijkstra.js
 
 
distance-between-bus-stops.py
distance-between-bus-stops.py
 
 
equilibrium-index.js
equilibrium-index.js
 
 
find-highest-consecutive-sum-N.js.py
find-highest-consecutive-sum-N.js.py
 
 
find-highest-product-of-N.js
find-highest-product-of-N.js
 
 
find-sub-array.py
find-sub-array.py
 
 
find_1st_and_last_position_of_element_in_sorted_array.py
find_1st_and_last_position_of_element_in_sorted_array.py
 
 
find_unique_integer_in_list.js
find_unique_integer_in_list.js
 
 
flatten-nested-list.js
flatten-nested-list.js
 
 
flood-fill.js
flood-fill.js
 
 
frog-jumps.js
frog-jumps.js
 
 
game-of-life.py
game-of-life.py
 
 
generate_brackets.js
generate_brackets.js
 
 
get_100.py
get_100.py
 
 
graph.js
graph.js
 
 
hi-calendar.js
hi-calendar.js
 
 
increasing-order-search-tree.py
increasing-order-search-tree.py
 
 
interval-list-intersections.js
interval-list-intersections.js
 
 
is-subsequence.py
is-subsequence.py
 
 
k-complementary-pairs-in-array.js
k-complementary-pairs-in-array.js
 
 
k-th-smallest-in-sorted-matrix.py
k-th-smallest-in-sorted-matrix.py
 
 
kth_largest_item_in_array.py
kth_largest_item_in_array.py
 
 
largest-triangle-area.py
largest-triangle-area.py
 
 
longest_increasing_path.go
longest_increasing_path.go
 
 
longest_palindromic_substr.py
longest_palindromic_substr.py
 
 
majority_element_in_array.py
majority_element_in_array.py
 
 
maximal_square_in_matrix.go
maximal_square_in_matrix.go
 
 
maximum-depth-of-N-tree.py
maximum-depth-of-N-tree.py
 
 
median_from_stream.js
median_from_stream.js
 
 
merge-k-sorted-lists.js
merge-k-sorted-lists.js
 
 
merge-sort.js
merge-sort.js
 
 
merge_binary_trees.py
merge_binary_trees.py
 
 
min_in_rotated_sorted_list.go
min_in_rotated_sorted_list.go
 
 
min_in_rotated_sorted_list_II.go
min_in_rotated_sorted_list_II.go
 
 
min_window.py
min_window.py
 
 
min_window_sustring.js
min_window_sustring.js
 
 
minimum-swaps-to-make-strings-equal.go
minimum-swaps-to-make-strings-equal.go
 
 
move-zeroes.py
move-zeroes.py
 
 
multiply-in-array.js
multiply-in-array.js
 
 
n-courses.py
n-courses.py
 
 
next_polindromic_number.py
next_polindromic_number.py
 
 
number_of_islands.js
number_of_islands.js
 
 
one-swap-attempt-to-sort.js
one-swap-attempt-to-sort.js
 
 
pack-consecutive-duplicates.js
pack-consecutive-duplicates.js
 
 
package.json
package.json
 
 
path-sum-tree-II.py
path-sum-tree-II.py
 
 
permutation.py
permutation.py
 
 
permutations-II.js
permutations-II.js
 
 
phone_letter_combinations.js
phone_letter_combinations.js
 
 
phonelist.js
phonelist.js
 
 
pizza.js
pizza.js
 
 
possible-bipartition.go
possible-bipartition.go
 
 
pow.js
pow.js
 
 
print.py
print.py
 
 
queue_with_2_stacks.py
queue_with_2_stacks.py
 
 
rand5_with_rand7.js
rand5_with_rand7.js
 
 
remove-duplicates-from-sorted-array.py
remove-duplicates-from-sorted-array.py
 
 
remove_invalid_parentheses.py
remove_invalid_parentheses.py
 
 
repeated_dna_sequences.js
repeated_dna_sequences.js
 
 
reverse-32bit-integer.go
reverse-32bit-integer.go
 
 
reverse-linked-list.py
reverse-linked-list.py
 
 
reverse_string_recursion.py
reverse_string_recursion.py
 
 
search-a-2d-matrix-ii.py
search-a-2d-matrix-ii.py
 
 
second_largest_item_in_bst.py
second_largest_item_in_bst.py
 
 
set-matrix-zeroes.py
set-matrix-zeroes.py
 
 
shortest-palindrome.py
shortest-palindrome.py
 
 
skyline.py
skyline.py
 
 
sliding_window_maximum.js
sliding_window_maximum.js
 
 
sort-three-colors.go
sort-three-colors.go
 
 
split.js
split.js
 
 
stack-machine.js
stack-machine.js
 
 
sum-k-largest-numbers-in-array.js
sum-k-largest-numbers-in-array.js
 
 

Repository files navigation

InterviewProblems

tests

// run all tests
$ python -m unittest discover test/

// run specific test
$ python -m unittest test.test_coast_length

About

interview problems mostly from leetcode - Python / Go / JavaScript

Resources

Readme
Activity

Stars

1 star

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages