LeetCode-Style Problem Solving | Dataford Interview Questions

Solve two LeetCode-style problems (typically one easy and one medium difficulty). Implement one function that solves both tasks: find the indices of the unique pair in nums that sums to target, and merge overlapping inclusive intervals. The function receives nums, target, and intervals, and returns a dictionary with two_sum and merged_intervals keys. Each test case contains exactly one valid pair.

Signature: solve_two_problems(nums, target, intervals)

Constraints

2 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Each test case contains exactly one valid pair
0 <= len(intervals) <= 1000
intervals[i] is [start, end] with start <= end
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint are merged

Function Signature

def solve_two_problems(nums, target, intervals):

Your question is LeetCode-Style Problem Solving. 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

Signature: solve_two_problems(nums, target, intervals)

Constraints

2 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Each test case contains exactly one valid pair
0 <= len(intervals) <= 1000
intervals[i] is [start, end] with start <= end
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint are merged

Function Signature

def solve_two_problems(nums, target, intervals):

Your question is LeetCode-Style Problem Solving. 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.