Patterns

Fundamentals/Minimum Cost For Tickets

← Prev Next →

No problem statement available.

Compare with siblingPattern: DP — 1D →

Pattern siblings

memoization_intro
palindrome_partitioning_2
amazon_oa_num_ways_to_split_into_primes
decode_ways
divisor_game
dp_dynamic_subproblems_intro
dynamic_programming_intro
house_robber
largest_divisible_subset
longest_increasing_subsequence
longest_string_made_up_of_only_vowels
perfect_squares
triangle
ugly_number_ii
word_break
climbing_stairseasy
fibonacci_numbereasy
house_robber_iimedium
longest_valid_parentheseshard
maximum_subarraymedium
word_break_iihard
nth_tribonaccieasy
min_cost_climbing_stairseasy
minimum_cost_for_ticketscurrent
partition_array_max_summedium
longest_string_chain

Check siblings above to see their reference solutions side by side.