Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 93

Intersection of Two Linked Lists

EasyLinked List

Lists a and b may share a suffix. You are given their values plus skipA, skipB describing where they merge (or -1). Return the intersection value, or -1 if they never meet.

Examples

Example 1

Input: intersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5]

Output: 8

Constraints

The number of nodes of listA is in [1, 3 * 10⁴]

Target ComplexityNot required

O(n) Time · O(1) Space

Companies (6)

AmazonGoogleMetaMicrosoftAppleBloomberg

Node 22.08.0

Loading editor…

Test casesRun to compare output

InputintersectVal = 8, listA = [4,1,8,4,5], listB = [5,6,1,8,4,5]

Expected8

Output—