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

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Apply
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Candies
  5. Discussions

Candies

Problem
Submissions
Leaderboard
Discussions
Editorial

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

  • nuowen0612
    4 months ago+ 0 comments

    My solution in python:

    def candies(n, arr):
        # Write your code here
        results = [1 for _ in range(n)]
        
        # ascending
        for i in range(1, n):
            if arr[i] > arr[i - 1]:
                results[i] = results[i - 1] + 1
        
        for i in range(n - 2, -1, -1):
            if arr[i] > arr[i + 1]:
                results[i] = max(results[i + 1] + 1, results[i])
            
        return sum(results)
    
    0|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy