Sanam Palsuledynamic-programming101.hashnode.dev·Oct 15, 2024Pattern 1 : Fibbonacci like DPThis pattern is used where each decision depends on 1 or 2 previous states, just like Fibonacci sequence! Climbing Stairs: Leetcode Link You can either climb 1 step or 2 steps at a time. Find how many distinct ways you can reach the top of a staircas...10 likes·27 readsDynamic ProgrammingAdd a thoughtful commentNo comments yetBe the first to start the conversation.
