GitHub - CollComm/prep: for interview

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 11 Commits
Java		Java
3sum_closest.cpp		3sum_closest.cpp
4_sum.cpp		4_sum.cpp
Linked_List_Cycle_II.cpp		Linked_List_Cycle_II.cpp
Linked_List_Cycle_II.cpp~		Linked_List_Cycle_II.cpp~
README		README
add_binary.cpp		add_binary.cpp
add_two_numbers.cpp		add_two_numbers.cpp
anagram.cpp		anagram.cpp
balanced_height_tree.cpp		balanced_height_tree.cpp
best_time_to_buy_and_sell_stock_iii.cpp		best_time_to_buy_and_sell_stock_iii.cpp
best_time_to_buy_stock.cpp		best_time_to_buy_stock.cpp
best_time_to_buy_stock_II.cpp		best_time_to_buy_stock_II.cpp
binary_tree_inorder_traversal.cpp		binary_tree_inorder_traversal.cpp
binary_tree_inorder_traversal.cpp~		binary_tree_inorder_traversal.cpp~
binary_tree_level_order_traversal_II.cpp		binary_tree_level_order_traversal_II.cpp
binary_tree_maximum_path_sum.cpp		binary_tree_maximum_path_sum.cpp
binary_tree_postorder_traversal.cpp		binary_tree_postorder_traversal.cpp
binary_tree_preorder_traversal.cpp		binary_tree_preorder_traversal.cpp
binary_tree_zigzag_level_order_traversal.cpp		binary_tree_zigzag_level_order_traversal.cpp
climbing_stairs.cpp		climbing_stairs.cpp
clone_graph.cpp		clone_graph.cpp
combination_sum.cpp		combination_sum.cpp
combination_sum_ii.cpp		combination_sum_ii.cpp
combinations.cpp		combinations.cpp
combinations.cpp~		combinations.cpp~
construct_binary_tree_from_inorder_and_postorder_traversal.cpp		construct_binary_tree_from_inorder_and_postorder_traversal.cpp
construct_binary_tree_from_preorder_and_inorder_traversal.cpp		construct_binary_tree_from_preorder_and_inorder_traversal.cpp
container_with_most_water.cpp		container_with_most_water.cpp
convert_sorted_array_to_binary_search_tree.cpp		convert_sorted_array_to_binary_search_tree.cpp
convert_sorted_list_to_binary_search_tree.cpp		convert_sorted_list_to_binary_search_tree.cpp
copy_list_with_random_pointer.cpp		copy_list_with_random_pointer.cpp
count_and_say.cpp		count_and_say.cpp
distinct_subsequences.cpp		distinct_subsequences.cpp
divide_two_integers.cpp		divide_two_integers.cpp
edit_distance.cpp		edit_distance.cpp
evaluate_reverse_polish_notation.cpp		evaluate_reverse_polish_notation.cpp
first_missing_positive.cpp		first_missing_positive.cpp
flatten_binary_tree_to_linked_list.cpp		flatten_binary_tree_to_linked_list.cpp
gas_station.cpp		gas_station.cpp
generate_parentheses.cpp		generate_parentheses.cpp
gray_code.cpp		gray_code.cpp
implement_strStr.cpp		implement_strStr.cpp
insert_interval.cpp		insert_interval.cpp
insertion_sort_list.cpp		insertion_sort_list.cpp
integer_to_roman.cpp		integer_to_roman.cpp
interleaving_string.cpp		interleaving_string.cpp
jump_game.cpp		jump_game.cpp
jump_game_ii.cpp		jump_game_ii.cpp
largest_rectangle_in_histogram.cpp		largest_rectangle_in_histogram.cpp
length_of_last_word.cpp		length_of_last_word.cpp
letter_combinations_of_a_phone_number.cpp		letter_combinations_of_a_phone_number.cpp
linked_list_cycle.cpp		linked_list_cycle.cpp
longest_common_prefix.cpp		longest_common_prefix.cpp
longest_consecutive_sequence.cpp		longest_consecutive_sequence.cpp
longest_palindromic_substring.cpp		longest_palindromic_substring.cpp
longest_substring_without_repeating_characters.cpp		longest_substring_without_repeating_characters.cpp
max_points_on_a_line.cpp		max_points_on_a_line.cpp
maximal_rectangle.cpp		maximal_rectangle.cpp
maximum_depth_of_tree.cpp		maximum_depth_of_tree.cpp
maximum_subarray.cpp		maximum_subarray.cpp
merge_intervals.cpp		merge_intervals.cpp
merge_k_sorted_lists.cpp		merge_k_sorted_lists.cpp
merge_sorted_array.cpp		merge_sorted_array.cpp
merge_sorted_array.cpp~		merge_sorted_array.cpp~
merge_two_sorted_lists.cpp		merge_two_sorted_lists.cpp
merge_two_sorted_lists.cpp~		merge_two_sorted_lists.cpp~
minimum_depth_of_binary_tree.cpp		minimum_depth_of_binary_tree.cpp
minimum_path_sum.cpp		minimum_path_sum.cpp
multiply_strings.cpp		multiply_strings.cpp
n_queens.cpp		n_queens.cpp
n_queens_ii.cpp		n_queens_ii.cpp
n_queens_ii.cpp~		n_queens_ii.cpp~
next_permutation.cpp		next_permutation.cpp
next_permutation.cpp~		next_permutation.cpp~
palindrome_number.cpp		palindrome_number.cpp
palindrome_partitioning.cpp		palindrome_partitioning.cpp
palindrome_partitioning_ii.cpp		palindrome_partitioning_ii.cpp
partition_list.cpp		partition_list.cpp
pascal's_triangle.cpp		pascal's_triangle.cpp
pascal_triangle_ii.cpp		pascal_triangle_ii.cpp
path_sum.cpp		path_sum.cpp
path_sum_ii.cpp		path_sum_ii.cpp
permutation_sequence.cpp		permutation_sequence.cpp
permutations.cpp		permutations.cpp
permutations_ii.cpp		permutations_ii.cpp
plus_one.cpp		plus_one.cpp
populating_next_right_pointer.cpp		populating_next_right_pointer.cpp
populating_next_right_pointers_ in_each_node.cpp		populating_next_right_pointers_ in_each_node.cpp
pow_x_int_n.cpp		pow_x_int_n.cpp
recover_binary_search_tree.cpp		recover_binary_search_tree.cpp
recover_binary_search_tree_extended.cpp		recover_binary_search_tree_extended.cpp
regular_expression_matching.cpp		regular_expression_matching.cpp
remove_duplicates_from_sorted_array.cpp		remove_duplicates_from_sorted_array.cpp
remove_duplicates_from_sorted_array_ii.cpp		remove_duplicates_from_sorted_array_ii.cpp
remove_duplicates_from_sorted_list.cpp		remove_duplicates_from_sorted_list.cpp
remove_duplicates_from_sorted_list_ii.cpp		remove_duplicates_from_sorted_list_ii.cpp
remove_element.cpp		remove_element.cpp
remove_element.cpp~		remove_element.cpp~
remove_nth_node_from_end_of_list.cpp		remove_nth_node_from_end_of_list.cpp

Repository files navigation

This is for interview preparation. I will store the codes here for reference.

About

for interview

Readme

Activity

0 stars

1 watching

0 forks

Report repository

Releases

No releases published

Packages

No packages published

CollComm/prep

Folders and files

Latest commit

History