norm.krumpe@muohio.edu program11 > singlesCount
prev  |  next  |  chance

Given a non-empty array of integers, count how many of the values appear exactly one time in the array. Solve this without modifying the given array or creating a new array. singlesCount([4, 7, 4]) → 1 singlesCount([3, 5, 3, 5]) → 0 singlesCount([4, 1, 9]) → 3 Go...Save, Compile, Run (ctrl-enter) int singlesCount(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: 300

Copyright Nick Parlante 2017 - privacy