frew@mclean.com apcs2025unit4aalgs > countModPairs
prev  |  next  |  chance

Find all elements in the array such that a mod b = 0, where a appears earlier in the array than b. Return the count of such pairs. Pairs do not need to be consecutive. countModPairs([6, 3]) → 1 countModPairs([6, 7, 3]) → 1 countModPairs([2, 10, 8, 5, 4]) → 2 Go...Save, Compile, Run (ctrl-enter) public int countModPairs(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