Gahiz_

Dynamic Programming

Challenges: 7Easy: 1Medium: 2Hard: 4

This Dynamic Programming set gathers 7 coding problems, with a mix of 1 easy, 2 medium, 4 hard. They show up in interviews at companies like Amazon, Careem, Google, Microsoft, Valeo Egypt, so you can master the pattern once and recognize it everywhere.

Dynamic Programming coding problems

  • Cache Invalidation Planner

    Difficulty: HardAsked by: Amazon, Careem, Google

  • Longest Increasing Subsequence

    Difficulty: HardAsked by: Amazon, Google, Microsoft

  • Maximum Subarray

    Difficulty: MediumAsked by: Amazon, Google, Microsoft

  • Fibonacci Number

    Difficulty: EasyAsked by: Valeo Egypt, Vodafone Egypt

  • Max Sum with Increasing Constraint

    Difficulty: HardAsked by: Orange Egypt

  • Maximum Subarray

    Difficulty: MediumAsked by: Careem, Noon

  • Word Break

    Difficulty: HardAsked by: Amazon, Apple, Meta

Asked by

Ready to practice for real?

Work through Dynamic Programming problems in the editor, run your code, and check your solution against real test cases.

Practice coding challenges, start free