| Apply Operations on an Array (Extra Space) |
apply_operations_on_an_array_2460_extra_space.py |
Done |
2460 |
| Apply Operations on an Array (Constant Space) |
apply_operations_on_an_array_2460_optimized_constant_space.py |
Done |
2460 |
| Build Array from Permutation |
build_array_from_permutation_1920.py |
Done |
1920 |
| Capacity To Ship Packages (Bruteforce) |
capacity_to_ship_packages_within_d_days_1011_bruteforce_quadratic_time.py |
Done |
1011 |
| Categorize Box |
categorize_box_2525.py |
Done |
2525 |
| Check If Array Is Sorted and Rotated (Bruteforce) |
check_if_array_is_sorted_and_rotated_1752_bruteforce_quadratic_time.py |
Done |
1752 |
| Check If Array Is Sorted and Rotated (Optimized) |
check_if_array_is_sorted_and_rotated_1752_optimized_linear_time.py |
Done |
1752 |
| Check If N and Its Double Exist |
check_if_n_and_its_double_exist_1346.py |
Done |
1346 |
| Count Items Matching a Rule |
count_items_matching_a_rule_1773.py |
Done |
1773 |
| Count Negative Numbers in Sorted Matrix (Bruteforce) |
count_negative_no_in_a_sorted_array_1351_bruteforce.py |
Done |
1351 |
| Count Number of Bad Pairs (Bruteforce) |
count_no_of_bad_pairs_bruteforce_2364_quadratic_time.py |
Done |
2364 |
| Count Pairs That Form a Complete Day I (Bruteforce) |
count_pairs_that_form_a_complete_day_1_3184_bruteforce.py |
Done |
3184 |
| Count Pairs With Sum Less Than Target |
count_pairs_with_sum_less_than_target.py |
Done |
2824 |
| Count Subarrays of Length Three (Placeholder) |
count_subarrays_of_length_three_with_condition.py |
Done |
(Needs LC #?) |
| Decompress Run-Length Encoded List |
decompress_run_length_encoded_list_1313.py |
Done |
1313 |
| Find the Difference Between Two Arrays |
difference_between_two_arrays_2215.py |
Done |
2215 |
| Divide Array Into Equal Pairs (Using Array Counts) |
divide_array_into_equal_parts_2206_using_array.py |
Done |
2206 |
| Final Prices With Discount |
final_price_with_discount_1475.py |
Done |
1475 - Stack |
| Final Value After Performing Operations |
final_value_after_performing_operations_2011.py |
Done |
2011 |
| Find Lucky Integer in an Array |
find_lucky_integer_in_an_array_1394.py |
Done |
1394 |
| Find Minimum in Rotated Sorted Array (Linear) |
find_minimum_in_rotated_sorted_array_153_bruteforce_linear_time.py |
Done |
153 |
| Find Missing and Repeating No (Bruteforce) |
find_missing_and_repeating_no_2965_bruteforce_quadratic.py |
Done |
(GFG/Similar 645) |
| Find Peak Element (Linear) |
find_peak_element_162_bruteforce_linear_time_complexity.py |
Done |
162 |
| Find the Highest Altitude |
find_the_highest_altitude_1732.py |
Done |
1732 |
| Find Smallest Divisor Given Threshold (Bruteforce) |
find_the_smallest_divisor_given_a_threshold_1283_using_bruteforce.py |
Done |
1283 |
| Fizz Buzz |
fizz_buzz_412.py |
Done |
412 |
| Flipping an Image |
flipping_an_image_832.py |
Done |
832 |
| Intersection of Two Arrays |
intersection_of_two_arrays_349.py |
Done |
349 - Set |
| Koko Eating Bananas (Bruteforce) |
koko_eating_bananas_875_bruteforce_quadratic_time.py |
Done |
875 |
| Kth Missing Positive Number (Linear) |
kth_missing_positive_no_from_sorted_array_1539.py |
Done |
1539 |
| Longest Inc/Dec Subarray (Bruteforce) |
longest_strictly_increasing_or_decreasing_array_3015_bruteforce_quadratic_time.py |
Done |
(Typo 3105?) |
| Matrix Diagonal Sum (Bruteforce) |
matrix_diagonal_sum_bruteforce_1572.py |
Done |
1572 |
| Matrix Diagonal Sum (Optimized) |
matrix_diagonal_sum_optimized_1572.py |
Done |
1572 |
| Max Number of Words Found in Sentences |
max_no_of_words_in_sentence_114.py |
Done |
2114 |
| Maximum Ascending Subarray Sum (Bruteforce) |
maximum_ascending_subarray_sum_1800_bruteforce_quadratic_time.py |
Done |
1800 |
| Maximum Ascending Subarray Sum (Optimized) |
maximum_ascending_subarray_sum_1800_optimized_linear_time.py |
Done |
1800 |
| Max Count of Positive and Negative (Linear) |
maximum_count_of_positive_and_negative_integers_2529_bruteforce_linear.py |
Done |
2529 |
| Merge Strings Alternately |
merge_strings_alternatively_1768.py |
Done |
1768 |
| Minimum Absolute Difference |
min_absolute_difference_1200.py |
Done |
1200 - Sorting |
| Minimum Index Sum of Two Lists |
min_index_sum_of_two_lists_599.py |
Done |
599 - Hashing |
| Min No of Days to Make M Bouquets (Bruteforce) |
min_no_of_days_to_make_m_bouquets_1482_bruteforce_quadratic_time.py |
Done |
1482 |
| Minimum Operations Make Columns Increasing |
minimum_operations_to_make_columns_strictly_increasing_3402.py |
Done |
(Typo?) |
| Minimum Cuts to Divide a Circle |
mininum_cuts_to_divide_a_circle_2481.py |
Done |
2481 |
| Neither Minimum nor Maximum (Linear Space) |
neither_minimum_nor_maximum_2733_linear_space.py |
Done |
2733 |
| Neither Minimum nor Maximum (Constant Space) |
neither_minimum_nor_maximum_2733_optimized_constant_space.py |
Done |
2733 |
| Number of Employees Who Met the Target |
no_of_employees_who_meet_the_target_2798.py |
Done |
2798 |
| Number of Pairs with Absolute Difference K |
no_of_pair_with_absolute_difference_k.py |
Done |
2006 |
| Number of Pairs with Sum K |
no_of_pair_with_sum_k.py |
Done |
(Similar 1, 167) |
| Partition Array According to Pivot |
partition_array_according_to_given_plot_2161_linear_space.py |
Done |
2161 |
| Peak Index in a Mountain Array (Linear) |
peak_index_in_a_mountain_array_852_bruteforce_linear.py |
Done |
852 |
| Product of the Last K Numbers (Bruteforce) |
product_of_last_k_numbers_1352_bruteforce.py |
Done |
1352 |
| Product of the Last K Numbers (Bruteforce 2) |
product_of_last_k_numbers_1352_bruteforce_solution_2.py |
Done |
1352 |
| Product of the Last K Numbers (Prefix Product) |
product_of_last_k_numbers_1352_optmized_prefix_product.py |
Done |
1352 |
| Replace Elements with Greatest on Right |
replace_elements_with_greatest_element_on_right_side_1299.py |
Done |
1299 |
| Richest Customer Wealth |
richest_customer_wealth_1672.py |
Done |
1672 |
| Row With Maximum Ones (Bruteforce) |
row_with_maximum_ones_2643_bruteforce.py |
Done |
2643 |
| Row With Maximum Ones (Optimized) |
row_with_maximum_ones_2643_optimized.py |
Done |
2643 |
| Running Sum of 1d Array |
running_sum_of_1d_array_or_cummulative_sum_1480.py |
Done |
1480 |
| Search a 2D Matrix (Bruteforce) |
search_a_2d_matrix_74_bruteforce_quadratic.py |
Done |
74 |
| Search in Rotated Sorted Array (Linear) |
search_in_rotated_sorted_array_33_bruteforce_linear_time.py |
Done |
33 |
| Separate the Digits in an Array |
separate_the_digits_in_an_array_2553.py |
Done |
2553 |
| Set Mismatch (Using Array/Hashing) |
set_mismatch_645_using_array.py |
Done |
645 |
| Shuffle the Array |
shuffle_the_array_1470.py |
Done |
1470 |
| Special Array I |
special_array_3151.py |
Done |
3151 |
| String Matching in an Array (Bruteforce) |
string_matching_in_array_by_1408.py |
Done |
1408 |
| String Matching in an Array (Sorting) |
string_matching_in_array_by_sorting_1408.py |
Done |
1408 |
| Subrectangle Queries |
subrectangle_queries_1476.py |
Done |
1476 |
| Sum of Squares of Special Elements |
sum_of_squares_of_special_elements_2778.py |
Done |
2778 |
| Sort Array By Parity II (In-Place - Misnamed) |
transform_array_by_parity_3467.py |
Done |
(Typo? Rel 905/922) |
| Two Sum II - Input Array Is Sorted |
two_sum_for_given_sorted_array_167.py |
Done |
167 |
| Valid Sudoku |
valid_sudoku_36.py |
Done |
36 |
| Find XOR Sum of Numbers Appearing Twice |
xor_of_no_which_exist_twice_3158.py |
Done |
3158 |