sspiege3@schools.nyc.gov > minPositive2
prev  |  next  |  chance

Given an int array of mixed values, find the minimum of the positive values. The first positive value can appear in any position! Pre-condition: There is at least one positive value in the array: minPositive2([3, -2, 1, 9, -2, -3, 0]) → 1 minPositive2([5, 3, 4, -1]) → 3 minPositive2([-2, -3, -4, 99, 8]) → 8 Go...Save, Compile, Run (ctrl-enter) public int minPositive2( int [] nums ) { } Go Editor font size %:75100125150 Shorter output

Forget It! -- delete my code for this problem

Progress graphs:
 Your progress graph for this problem
 Random user progress graph for this problem
 Random Epic Progress Graph

Java Help

• Java Example Solution Code
• Java String Introduction (video)
• Java Substring v2 (video)
• Java String Equals and Loops
• Java String indexOf and Parsing
• Java If and Boolean Logic
•   If Boolean Logic Example Solution Code 1 (video)
•   If Boolean Logic Example Solution Code 2 (video)
• Java For and While Loops
• Java Arrays and Loops
• Java Map Introduction
• Java Map WordCount
• Java Functional Mapping
• Java Functional Filtering

Misc Code Practice

• Code Badges
• Introduction to Mod (video)
• MakeBricks problem and solution (video x 2)
• FizzBuzz the famous code interview question (video)

Difficulty: 200

Copyright Nick Parlante 2017 - privacy