We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Requirement
  5. Discussions

Requirement

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • henry_scher_job
    1 year ago+ 0 comments

    For all but 3 of the test cases, it is possible (in C) to pass essentially by counting one-by-one the valuations that satisfy the requirements without timing out; you just have to do a tiny amount of work to minimize the amount of time spent on failed valuations.

    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature