Coding Topic
Dynamic Programming OA Questions
Practice 501+ Dynamic Programming coding questions from real online assessments. Filter by company, solve in the OAHelper editor, and prepare for company-wise OAs.
QuestionCompanyDifficulty
Maximum-Sum Bitonic SubarrayarcesiumEasyBurst BalloonsmykaarmaEasyMinimum-Cost Interleaving with SeparatorsnutanixEasySum of Bitwise AND Over All SubarraysrazorpayEasyMinimum Coins for PurchasebarclaysEasyFlag Suspicious API RequestssalesforceEasyMinimum Cost to Reduce N to 1infosys_1augEasyNumber of Restricted Compositions of Ninfosys_1augEasyWorkflow Replacement CountepamMediumChris Navigates a MazethroughputEasyCan You Count the Bit Strings?snowflake-28julyEasyLaser Relay Across the TowerssprinklrMediumValid BST PermutationsoracleEasyThe Great Trunk MigrationgocommotionMediumBooking the StudiogocommotionMediumStudio Booking Revenuecommotion-daiictMediumAlice's JourneyalgouniversityMediumPower Budget Productioneternal (zomato)MediumMinimum ReversaluipathMediumPower-Constrained Productioneternal (zomato)EasyCounting Arrays by Maximum Search CostbnyMediumMinimum Processing TimebnyMediumPeak SubarraysnxtwaveMediumVova's Sleep OptimizationnxtwaveMediumColoring HousesdeshawMediumMinimum Cost Array ModificationdeshawMediumSame Parity Integers in a RangelinkedinMediumCure the VirusflipkartHardStone GameepamMediumValid Number PartitionsepamMediumMaximum Performance ScoreamazonHardAscending Path in a GridepamHardMaximum Sum Path in a Gridimc tradingMediumCost of Building a StringvaluelabsHardPalindrome Substrings CountgensparkMediumElectric Wire GridcomcastMediumCutting EdgescomcastMediumMagical Pathway PuzzlenagarroMediumMaximum Fruits to CollectnagarroHardSub-Palindromepublicis sapientMediumChallenge 37cauxiaMediumMinimum Merge Conflictsuser submittedHardMaximize Score After N OperationsubsHardKth Number Containing 101 in BinaryubsHardNumber of Prime PartitionsthoughtworksHardCount ChildrenthoughtworksHard1. String Scoring with Palindromesuser submittedMediumSerial Numbers with Digit Sum Condition S(k·n)=k·S(n)amazonHardQuestion 1: Count Strictly Increasing TripletsibmMediumMinimum Time to Complete All Modules with DependenciesgrowwMedium