simona1@sfusd.edu arrays4 > numMatch
prev  |  next  |  chance

Given arrays nums1 and nums2 of the same length, return the count of the number of times that two elements at the same index in each array are equal. numMatch([1, 2], [1, 1]) → 1 numMatch([5, 4, 3, 2, 1], [1, 2, 3, 4, 5]) → 1 numMatch([1, 2, 3, 4], [5, 6, 3, 4]) → 2 Go...Save, Compile, Run (ctrl-enter) public int numMatch(int[] nums1, int[] nums2) { } 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)

Post-solution available

Copyright Nick Parlante 2017 - privacy