You only have s  left (including this one) .
 
 
    
    
    
    
        
    
 
Given an array  of integers, find the highest product you can get from three of the integers.
 
The input arrayOfInts  will always have at least three integers.
 
Does your function  work with negative numbers? If arrayOfInts  is [-10, -10, 1, 3, 2]  we should return 300  (which we get by taking -10 * -10 * 3 ).
 
We can do this in 
 
 
	
	
		
			Start your free trial!
		 
		
			Log in or sign up with one click to get immediate access to s 
		
	
	
    
        We'll never post on your wall or message your friends.
     
    
        Where do I enter my password? 
    
        
            
                Actually, we don't support password-based login.  Never have. Just the OAuth methods above. Why?
            
            
            
                It's easy and quick. No "reset password" flow. No password to forget.
             
            
                It lets us avoid storing passwords that hackers could access and use to try to log into our users' email or bank accounts.
             
            
                It makes it harder for one person to share a paid Interview Cake account with multiple people.
             
          
     
 
	 
	
 
	
	
		
			Start your free trial!
		 
		
			Log in or sign up with one click to get immediate access to s 
		
	
	
    
        We'll never post on your wall or message your friends.
     
    
        Where do I enter my password? 
    
        
            
                Actually, we don't support password-based login.  Never have. Just the OAuth methods above. Why?
            
            
            
                It's easy and quick. No "reset password" flow. No password to forget.
             
            
                It lets us avoid storing passwords that hackers could access and use to try to log into our users' email or bank accounts.
             
            
                It makes it harder for one person to share a paid Interview Cake account with multiple people.
             
          
     
 
	 
	
 
 
What if we wanted the highest product of 4 items?
 
What if we wanted the highest product of k  items?
 
If our highest product is really big, it could overflow.  How should we protect against this?
 
 
 
	
	
		
			Start your free trial!
		 
		
			Log in or sign up with one click to get immediate access to s 
		
	
	
    
        We'll never post on your wall or message your friends.
     
    
        Where do I enter my password? 
    
        
            
                Actually, we don't support password-based login.  Never have. Just the OAuth methods above. Why?
            
            
            
                It's easy and quick. No "reset password" flow. No password to forget.
             
            
                It lets us avoid storing passwords that hackers could access and use to try to log into our users' email or bank accounts.
             
            
                It makes it harder for one person to share a paid Interview Cake account with multiple people.
             
          
     
 
	 
	
 
 
        
        
     
    
    
 
 
 
        
        
        
        
            
            
        
     
  
    
    
        Code editor
     
    
        
        
        
            Reset editor
        
        
             
        
            
             
        
        
             
        
            
                vim/emacs? 
                regular 
                vim 
                emacs 
             
        
        
         
        
            Run
         
     
    
 
 
  
	
	
		
        
        
    
    
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
        
            
        
    
    
    
        {"id":39831685,"username":"2025-10-31_07:21:43_7@ko3)","email":null,"date_joined":"2025-10-31T07:21:43.939744+00:00","first_name":"","last_name":"","full_name":"","short_name":"friend","is_anonymous":true,"is_on_last_question":false,"percent_done":0,"num_questions_done":0,"num_questions_remaining":46,"is_full_access":false,"is_student":false,"first_payment_date":null,"last_payment_date":null,"num_free_questions_left":3,"terms_has_agreed_to_latest":false,"preferred_content_language":"","preferred_editor_language":"","is_staff":false,"auth_providers_human_readable_list":"","num_auth_providers":0,"auth_email":""}
    
    
	
	
    
        
    
    
    
        
            
                
                    × 
                    
                    
                        
                        
                            
    
    
    
    
        “ I cracked a lot of interviews just by thinking through the way your website solves problems. A huge thanks for helping me land my dream job. I highly recommend Interview Cake if you want to attend interviews with confidence!
        
            — 
            
                Harini
            
         
     
 
                         
                     
                     
                 
             
         
     
    
    
    . . .