chanr@sfusd.edu mixedpracticeb > countOdds
prev  |  next  |  chance

Return the number of odd integers in the given array. Note: The mod operator %, which returns the remainder if the first argument is divided by the second, is useful. countOdds([1]) → 1 countOdds([1, 2, 3, 4, 5]) → 3 countOdds([1, 3, 5, 7]) → 4 Go...Save, Compile, Run (ctrl-enter)Show Hint public int countOdds(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: 203 Post-solution available

Copyright Nick Parlante 2017 - privacy