Complex Coding Set | Dataford Interview Questions

As part of a Luxoft engineering assessment, implement four independent algorithms in one Python function. Return the required result for each task: find a pair summing to a target, merge overlapping intervals, find the longest substring without repeated characters, and determine whether two strings are anagrams.

Formal Specification

Implement solve_all(nums, target, intervals, s, t). Return a dictionary with these keys:

two_sum: the zero-based indices of the unique pair in nums whose values sum to target, or [] if no pair exists.
merge_intervals: all overlapping intervals merged and sorted by start time.
longest_substring: the length of the longest substring of s containing no repeated characters.
valid_anagram: true if s and t contain the same characters with the same frequencies, otherwise false.

Intervals are represented as two-element lists [start, end]. Treat strings as case-sensitive and compare every character, including spaces and punctuation.

Constraints

2 <= len(nums) <= 10^5
-10^9 <= nums[i], target <= 10^9
0 <= len(intervals) <= 10^5
Each interval has exactly two integers and start <= end
0 <= len(s), len(t) <= 10^5
At most one valid two-sum pair exists
String comparison is case-sensitive and includes spaces and punctuation

Function Signature

def solve_all(nums, target, intervals, s, t):

Your question is Complex Coding Set. Start with the requirements in the Question tab.

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

Problem