├── 3 sum.cpp ├── Add_two_number_linked_list.cpp ├── Count_Subarray_with_given_xor.cpp ├── Four_Sum.cpp ├── Grid_Unique_paths.cpp ├── Largest_Subarray_with_zero_sum.cpp ├── Longest_substring_without_repeating_characters.cpp ├── Majority_element.cpp ├── Majority_element_v2.cpp ├── Middle_of_the_linked_list.cpp ├── N meeting in one room.cpp ├── Petr and a Combination Lock.cpp ├── README.md ├── Reverse_pairs.cpp ├── Two_sum_return_index.cpp ├── Two_sum_return_number.cpp ├── binary tree zigzag level order traversal.cpp ├── bottom view of binary tree.cpp ├── buy_sell_stock.cpp ├── check if binary tree is height balanced or not.cpp ├── check if two trees are identical.cpp ├── combination sum II.cpp ├── combination sum.cpp ├── copy list with random pointer.cpp ├── create binary tree from inorder and preorder.cpp ├── delete_a_give_node_in_a_linked_list.cpp ├── diameter of binary tree.cpp ├── duplicate_in_arr_of_n_plus_one_integers.cpp ├── find_starting_point_of_loop_of_linked_list.cpp ├── flattening_a_linked_list.cpp ├── fractional knapsack.cpp ├── greedy to find minimum number of coins.cpp ├── height of binary tree.cpp ├── inorder traversal binary tree.cpp ├── intersection_of_two_linked_lists.cpp ├── inversion_count_array.cpp ├── job sequencing problem.cpp ├── left view of binary tree.cpp ├── level order traversal.cpp ├── linked_list_cycle.cpp ├── longest_consecutive_sequence.cpp ├── lowest common ancestor of a binary tree.cpp ├── max consecutive ones.cpp ├── max_subarray.cpp ├── maximum length subarray with given XOR.cpp ├── maximum path sum binary tree.cpp ├── median of two sorted arrays.cpp ├── merge_intervals.cpp ├── merge_two_sorted_arrays.cpp ├── merge_two_sorted_lists.cpp ├── minimum platforms.cpp ├── next_permutation.cpp ├── palindrome partitioning.cpp ├── palindrome_linked_list.cpp ├── pascals_triange.cpp ├── permutation sequence.cpp ├── postorder traversal binary tree.cpp ├── pow(x,n).cpp ├── preorder traversal binary tree.cpp ├── regular expression matching.cpp ├── remove duplicates from sorted array.cpp ├── remove_nth_node_from_the_end_of_list.cpp ├── repeating_and_missing.cpp ├── reverse words in a string.cpp ├── reverse_a_linked_list.cpp ├── reverse_nodes_in_k_group.cpp ├── right view of binary tree.cpp ├── rotate_a_matrix.cpp ├── rotate_linked_list_by_k.cpp ├── search_in_2d_matrix.cpp ├── set_matrix_zeros.cpp ├── sort_array_of_0s_1s_&_2s.cpp ├── subset sums II.cpp ├── subset sums.cpp ├── top view of binary tree.cpp ├── trapping rainwater.cpp └── vertical order traversal.cpp /3 sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/3 sum.cpp -------------------------------------------------------------------------------- /Add_two_number_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Add_two_number_linked_list.cpp -------------------------------------------------------------------------------- /Count_Subarray_with_given_xor.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Count_Subarray_with_given_xor.cpp -------------------------------------------------------------------------------- /Four_Sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Four_Sum.cpp -------------------------------------------------------------------------------- /Grid_Unique_paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Grid_Unique_paths.cpp -------------------------------------------------------------------------------- /Largest_Subarray_with_zero_sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Largest_Subarray_with_zero_sum.cpp -------------------------------------------------------------------------------- /Longest_substring_without_repeating_characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Longest_substring_without_repeating_characters.cpp -------------------------------------------------------------------------------- /Majority_element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Majority_element.cpp -------------------------------------------------------------------------------- /Majority_element_v2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Majority_element_v2.cpp -------------------------------------------------------------------------------- /Middle_of_the_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Middle_of_the_linked_list.cpp -------------------------------------------------------------------------------- /N meeting in one room.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/N meeting in one room.cpp -------------------------------------------------------------------------------- /Petr and a Combination Lock.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Petr and a Combination Lock.cpp -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/README.md -------------------------------------------------------------------------------- /Reverse_pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Reverse_pairs.cpp -------------------------------------------------------------------------------- /Two_sum_return_index.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Two_sum_return_index.cpp -------------------------------------------------------------------------------- /Two_sum_return_number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/Two_sum_return_number.cpp -------------------------------------------------------------------------------- /binary tree zigzag level order traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/binary tree zigzag level order traversal.cpp -------------------------------------------------------------------------------- /bottom view of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/bottom view of binary tree.cpp -------------------------------------------------------------------------------- /buy_sell_stock.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/buy_sell_stock.cpp -------------------------------------------------------------------------------- /check if binary tree is height balanced or not.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/check if binary tree is height balanced or not.cpp -------------------------------------------------------------------------------- /check if two trees are identical.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/check if two trees are identical.cpp -------------------------------------------------------------------------------- /combination sum II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/combination sum II.cpp -------------------------------------------------------------------------------- /combination sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/combination sum.cpp -------------------------------------------------------------------------------- /copy list with random pointer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/copy list with random pointer.cpp -------------------------------------------------------------------------------- /create binary tree from inorder and preorder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/create binary tree from inorder and preorder.cpp -------------------------------------------------------------------------------- /delete_a_give_node_in_a_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/delete_a_give_node_in_a_linked_list.cpp -------------------------------------------------------------------------------- /diameter of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/diameter of binary tree.cpp -------------------------------------------------------------------------------- /duplicate_in_arr_of_n_plus_one_integers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/duplicate_in_arr_of_n_plus_one_integers.cpp -------------------------------------------------------------------------------- /find_starting_point_of_loop_of_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/find_starting_point_of_loop_of_linked_list.cpp -------------------------------------------------------------------------------- /flattening_a_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/flattening_a_linked_list.cpp -------------------------------------------------------------------------------- /fractional knapsack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/fractional knapsack.cpp -------------------------------------------------------------------------------- /greedy to find minimum number of coins.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/greedy to find minimum number of coins.cpp -------------------------------------------------------------------------------- /height of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/height of binary tree.cpp -------------------------------------------------------------------------------- /inorder traversal binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/inorder traversal binary tree.cpp -------------------------------------------------------------------------------- /intersection_of_two_linked_lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/intersection_of_two_linked_lists.cpp -------------------------------------------------------------------------------- /inversion_count_array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/inversion_count_array.cpp -------------------------------------------------------------------------------- /job sequencing problem.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/job sequencing problem.cpp -------------------------------------------------------------------------------- /left view of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/left view of binary tree.cpp -------------------------------------------------------------------------------- /level order traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/level order traversal.cpp -------------------------------------------------------------------------------- /linked_list_cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/linked_list_cycle.cpp -------------------------------------------------------------------------------- /longest_consecutive_sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/longest_consecutive_sequence.cpp -------------------------------------------------------------------------------- /lowest common ancestor of a binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/lowest common ancestor of a binary tree.cpp -------------------------------------------------------------------------------- /max consecutive ones.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/max consecutive ones.cpp -------------------------------------------------------------------------------- /max_subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/max_subarray.cpp -------------------------------------------------------------------------------- /maximum length subarray with given XOR.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/maximum length subarray with given XOR.cpp -------------------------------------------------------------------------------- /maximum path sum binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/maximum path sum binary tree.cpp -------------------------------------------------------------------------------- /median of two sorted arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/median of two sorted arrays.cpp -------------------------------------------------------------------------------- /merge_intervals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/merge_intervals.cpp -------------------------------------------------------------------------------- /merge_two_sorted_arrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/merge_two_sorted_arrays.cpp -------------------------------------------------------------------------------- /merge_two_sorted_lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/merge_two_sorted_lists.cpp -------------------------------------------------------------------------------- /minimum platforms.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/minimum platforms.cpp -------------------------------------------------------------------------------- /next_permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/next_permutation.cpp -------------------------------------------------------------------------------- /palindrome partitioning.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/palindrome partitioning.cpp -------------------------------------------------------------------------------- /palindrome_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/palindrome_linked_list.cpp -------------------------------------------------------------------------------- /pascals_triange.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/pascals_triange.cpp -------------------------------------------------------------------------------- /permutation sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/permutation sequence.cpp -------------------------------------------------------------------------------- /postorder traversal binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/postorder traversal binary tree.cpp -------------------------------------------------------------------------------- /pow(x,n).cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/pow(x,n).cpp -------------------------------------------------------------------------------- /preorder traversal binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/preorder traversal binary tree.cpp -------------------------------------------------------------------------------- /regular expression matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/regular expression matching.cpp -------------------------------------------------------------------------------- /remove duplicates from sorted array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/remove duplicates from sorted array.cpp -------------------------------------------------------------------------------- /remove_nth_node_from_the_end_of_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/remove_nth_node_from_the_end_of_list.cpp -------------------------------------------------------------------------------- /repeating_and_missing.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/repeating_and_missing.cpp -------------------------------------------------------------------------------- /reverse words in a string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/reverse words in a string.cpp -------------------------------------------------------------------------------- /reverse_a_linked_list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/reverse_a_linked_list.cpp -------------------------------------------------------------------------------- /reverse_nodes_in_k_group.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/reverse_nodes_in_k_group.cpp -------------------------------------------------------------------------------- /right view of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/right view of binary tree.cpp -------------------------------------------------------------------------------- /rotate_a_matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/rotate_a_matrix.cpp -------------------------------------------------------------------------------- /rotate_linked_list_by_k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/rotate_linked_list_by_k.cpp -------------------------------------------------------------------------------- /search_in_2d_matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/search_in_2d_matrix.cpp -------------------------------------------------------------------------------- /set_matrix_zeros.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/set_matrix_zeros.cpp -------------------------------------------------------------------------------- /sort_array_of_0s_1s_&_2s.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/sort_array_of_0s_1s_&_2s.cpp -------------------------------------------------------------------------------- /subset sums II.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/subset sums II.cpp -------------------------------------------------------------------------------- /subset sums.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/subset sums.cpp -------------------------------------------------------------------------------- /top view of binary tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/top view of binary tree.cpp -------------------------------------------------------------------------------- /trapping rainwater.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/trapping rainwater.cpp -------------------------------------------------------------------------------- /vertical order traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/csforallofficial/SDE_SHEET_180/HEAD/vertical order traversal.cpp --------------------------------------------------------------------------------