Skip to content

cpj2195/Leetcode-Solutions

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
.gitignore
.gitignore
 
 
AVL_trees.cpp
AVL_trees.cpp
 
 
README.md
README.md
 
 
add_1_to_ll.cpp
add_1_to_ll.cpp
 
 
add_binary_strings.cpp
add_binary_strings.cpp
 
 
add_two_numbers_as_ll.cpp
add_two_numbers_as_ll.cpp
 
 
adjacent_all_remove.cpp
adjacent_all_remove.cpp
 
 
alternating_split.cpp
alternating_split.cpp
 
 
balanced_parenthesis.cpp
balanced_parenthesis.cpp
 
 
bellman_ford.cpp
bellman_ford.cpp
 
 
bfs_graphs.cpp
bfs_graphs.cpp
 
 
binary_search.cpp
binary_search.cpp
 
 
binary_tree.cpp
binary_tree.cpp
 
 
binary_tree_essentials.cpp
binary_tree_essentials.cpp
 
 
binary_tree_to_dll.cpp
binary_tree_to_dll.cpp
 
 
binary_tree_to_string.cpp
binary_tree_to_string.cpp
 
 
boundary_traversal.cpp
boundary_traversal.cpp
 
 
bst.cpp
bst.cpp
 
 
bst_to_dll.cpp
bst_to_dll.cpp
 
 
bubble_sort.cpp
bubble_sort.cpp
 
 
buddy_strings.cpp
buddy_strings.cpp
 
 
cards_problem.cpp
cards_problem.cpp
 
 
ceiling.cpp
ceiling.cpp
 
 
check_for_anagrams.cpp
check_for_anagrams.cpp
 
 
check_for_bst.cpp
check_for_bst.cpp
 
 
check_ll_for_palindrome.cpp
check_ll_for_palindrome.cpp
 
 
check_possible_path_exists.cpp
check_possible_path_exists.cpp
 
 
check_subsequence.cpp
check_subsequence.cpp
 
 
circular_ll.cpp
circular_ll.cpp
 
 
circular_queue.cpp
circular_queue.cpp
 
 
count_nodes_in_range(AVL Tree).cpp
count_nodes_in_range(AVL Tree).cpp
 
 
count_trailing_zeros.cpp
count_trailing_zeros.cpp
 
 
degree_array.cpp
degree_array.cpp
 
 
delete_a_ll.cpp
delete_a_ll.cpp
 
 
delete_alternate_nodes.cpp
delete_alternate_nodes.cpp
 
 
delete_greater_on_right.cpp
delete_greater_on_right.cpp
 
 
delete_m_after_n.cpp
delete_m_after_n.cpp
 
 
delete_node_ll.cpp
delete_node_ll.cpp
 
 
dequeues.cpp
dequeues.cpp
 
 
djikstra.cpp
djikstra.cpp
 
 
doubly_ll.cpp
doubly_ll.cpp
 
 
equilibrium_index.cpp
equilibrium_index.cpp
 
 
essentials.cpp
essentials.cpp
 
 
factorial_large_numbers.cpp
factorial_large_numbers.cpp
 
 
find_extra_char.cpp
find_extra_char.cpp
 
 
find_if_path_exists.cpp
find_if_path_exists.cpp
 
 
find_if_paths_existsin_graph.cpp
find_if_paths_existsin_graph.cpp
 
 
find_intersection_ll.cpp
find_intersection_ll.cpp
 
 
find_itenary.cpp
find_itenary.cpp
 
 
find_number_occuring_once.cpp
find_number_occuring_once.cpp
 
 
first_non_repeating.cpp
first_non_repeating.cpp
 
 
first_non_repeating_stream.cpp
first_non_repeating_stream.cpp
 
 
flood_fill.cpp
flood_fill.cpp
 
 
floyd_warshall.cpp
floyd_warshall.cpp
 
 
get_all_less_than_max_2.cpp
get_all_less_than_max_2.cpp
 
 
get_diamter_bt.cpp
get_diamter_bt.cpp
 
 
get_half_nodes_bt.cpp
get_half_nodes_bt.cpp
 
 
goat_latin.cpp
goat_latin.cpp
 
 
graphs.cpp
graphs.cpp
 
 
graphs_dfs.cpp
graphs_dfs.cpp
 
 
happy_numbers.cpp
happy_numbers.cpp
 
 
heaps.cpp
heaps.cpp
 
 
hello_world.cpp
hello_world.cpp
 
 
implement_atoi.cpp
implement_atoi.cpp
 
 
implement_strstr.cpp
implement_strstr.cpp
 
 
infix_2_prefix.cpp
infix_2_prefix.cpp
 
 
infix_to_postfix.cpp
infix_to_postfix.cpp
 
 
insertion_sort.cpp
insertion_sort.cpp
 
 
interleave_queue.cpp
interleave_queue.cpp
 
 
intersection_2_vectors.cpp
intersection_2_vectors.cpp
 
 
intersection_of_2_sorted_ll.cpp
intersection_of_2_sorted_ll.cpp
 
 
ipaddress.cpp
ipaddress.cpp
 
 
isomorphic_strings.cpp
isomorphic_strings.cpp
 
 
jewel_and_stones.cpp
jewel_and_stones.cpp
 
 
judge-route.cpp
judge-route.cpp
 
 
k_numbers_most_occuring.cpp
k_numbers_most_occuring.cpp
 
 
k_th_non_repeating.cpp
k_th_non_repeating.cpp
 
 
kth_largest_stream.cpp
kth_largest_stream.cpp
 
 
kth_smallest_unsorted_array.cpp
kth_smallest_unsorted_array.cpp
 
 
left_view_bt.cpp
left_view_bt.cpp
 
 
length_last_word.cpp
length_last_word.cpp
 
 
length_of_loop.cpp
length_of_loop.cpp
 
 
ll_restart.cpp
ll_restart.cpp
 
 
longest_common_ancestor_bst.cpp
longest_common_ancestor_bst.cpp
 
 
longest_common_prefix.cpp
longest_common_prefix.cpp
 
 
longest_palindrome.cpp
longest_palindrome.cpp
 
 
longest_palindrome_length.cpp
longest_palindrome_length.cpp
 
 
longest_uncommon_subsequence.cpp
longest_uncommon_subsequence.cpp
 
 
longest_word_dict.cpp
longest_word_dict.cpp
 
 
majority_element.cpp
majority_element.cpp
 
 
max_diff.cpp
max_diff.cpp
 
 
max_in_bt.cpp
max_in_bt.cpp
 
 
max_subarray_of_size_k.cpp
max_subarray_of_size_k.cpp
 
 
merge_overlapping_intervals.cpp
merge_overlapping_intervals.cpp
 
 
merge_sort.cpp
merge_sort.cpp
 
 
merge_sort_ll.cpp
merge_sort_ll.cpp
 
 
merge_sorted_ll.cpp
merge_sorted_ll.cpp
 
 
merge_sorted_ll_inplace.cpp
merge_sorted_ll_inplace.cpp
 
 
merge_sorttree_range_order_stats.cpp
merge_sorttree_range_order_stats.cpp
 
 
merge_two_sorted.cpp
merge_two_sorted.cpp
 
 

Repository files navigation

Leetcode-Solutions

Solutions to some popular questions

To run any Question make sure you have the essentials.cpp int he same directory as the questions is.

For Linux: First install g++ compiler on your system

Command: sudo apt-get install g++

g++ -std=c++11 "sample_problem.cpp" ./a.out

You can also provide the output file name along with g++ command above Replace sample problem with the the file name you want to run.

About

Solutions to some popular questions

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors

Languages