simona1@sfusd.edu sorting > merge
prev  |  next  |  chance

Merges two sorted arrays of integers into one sorted array of integers. There may be duplicates in the returned array. merge([1, 3, 5, 7], [2, 4, 6, 8]) → [1, 2, 3, 4, 5, 6, 7, 8] merge([1, 3, 99], [2, 6, 99]) → [1, 2, 3, 6, 99, 99] merge([1, 3, 99], [3, 6, 99]) → [1, 3, 3, 6, 99, 99] Go...Save, Compile, Run (ctrl-enter)Show Hint public int[] merge(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: 370 Post-solution available

Copyright Nick Parlante 2017 - privacy