id/email | |

password | |

forgot password | create account |

about | help | code help+videos | done | prefs |

AP-1 > commonTwo

prev | next | chance

Forget It! -- delete my code for this problem### Java Help

### Misc Code Practice

prev | next | chance

Start with two arrays of strings, a and b, each in alphabetical order, possibly with duplicates. Return the count of the number of strings which appear in both arrays. The best "linear" solution makes a single pass over both arrays, taking advantage of the fact that they are in alphabetical order. commonTwo(["a", "c", "x"], ["b", "c", "d", "x"]) → 2 commonTwo(["a", "c", "x"], ["a", "b", "c", "x", "z"]) → 3 commonTwo(["a", "b", "c"], ["a", "b", "c"]) → 3 ...Save, Compile, Run (ctrl-enter) |

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 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

- Code Badges
- Introduction to Mod (video)
- MakeBricks problem and solution (video x 2)
- FizzBuzz the famous code interview question (video)

Difficulty: 254.0

Copyright Nick Parlante 2017 - privacy