gaurav.gupta@mq.edu.au arrays > isSubsetOf
prev  |  next  |  chance

A is said to be a subset of B if, every item in A occurs in B at least as many times as it occurs in A. Define a function that when passed two integer arrays, returns true if the first array is a subset of the second array. isSubsetOf([20, 10], [10, 70, 20, 90]) → true isSubsetOf([20, 20], [10, 70, 20, 90]) → false isSubsetOf([10, 70, 20, 90], [20]) → false Go...Save, Compile, Run (ctrl-enter) boolean isSubsetOf(int[] a, int[] b) { } 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: 3 Post-solution available

Copyright Nick Parlante 2017 - privacy