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. Constructive Algorithms
  4. Gaming Array
  5. Discussions

Gaming Array

Problem
Submissions
Leaderboard
Discussions
Editorial

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

  • mohdt786
    2 years ago+ 3 comments

    Guys here's my code: Just keep traversing from left to right and keep track of the number larger than your previous maximum.

    def gamingArray(arr):
        count=0 //Keeps track of number of turns played
        m=0 //Maximum Number
        for i in arr:
            if i>m:
                m=i
                count+=1
        if count%2==0:
            return 'ANDY'
        return 'BOB'
    
    13|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature