Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Array Subset Sorting Logic

EasyPython00:00
Practice interviewer
In session
5 left
00:00

Your question is Array Subset Sorting Logic. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

Fivetran connector workflows may need to align a selected list of fields with the order provided by a source field list. Given two integer arrays A and B, reorder B so its values follow the same relative order as they appear in A.

A contains distinct integers. Every value in B appears in A, and B may contain repeated values. Repeated values should appear together according to their position in A.

Formal Specification

Implement sort_by_reference(A, B):

  • Input: A, a non-empty list of distinct integers, and B, a list of integers whose values all occur in A.
  • Output: A new list containing the same values and multiplicities as B, ordered by each value's index in A.
  • Do not modify A or B in place.

Constraints

  • 1 <= len(A) <= 10^5
  • 0 <= len(B) <= 10^5
  • Values in A are distinct integers
  • Every value in B appears in A
  • -10^9 <= A[i], B[i] <= 10^9

Function Signature

def sort_by_reference(A, B):
Your solutionPython 3
You need to log in / sign up to run or submit.
Run your code to see test output