You need sorting on deque in every insertion/deletion? Check for heaps

goal cell is just a perception

good old hashmap

Smaller problems to greater problems ; always

Classic sliding window

Fundamental prob of DP

Fundamental DP on strings question

Fundamental Question ; Practice this

How many ways If I ask , If everything else stays the same?

Sliding window + deque

Hello DP

See beyond what the question is trying to show you

Sliding Window ; Hashmap ; Count

Primary instinctual math

DP sum

Fundamental qtn ; Covers everything

Logical DP conditions

Backtracking + Memoization

Those who forget their pasts are bound to repeat it

Faadu question, Fundamental prob ; Sliding window , hashmap , maxUnique

Max split ; left subarray left subtree ; right subarray right subtree

Subset Without Duplicates using recursion with a for loop

Circular Deque

Use sliding window on hashmaps when dealing with frequencies

queue + recursion

sliding window template

This is not DP , This has an essence of DP

Hashmaps with Sliding

len(stack) = depth

Always keep an opening stacked