Coding Challenges

Implement a deep link parser for a mobile application. Given a URL and a set of route configurations, parse the URL to determine which screen to navigate to and extract path parameters and query parameters. Parse the deep link URL scheme…

You are visiting a farm that has a single row of fruit trees arranged from left to right. The trees are represented by an integer array fruits where fruits[i] is the type of fruit the $i^{th}$ tree produces. You want to collect as much…

You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating all the parts in order, the resultant…

Implement a throttle function that limits the rate at which a function can fire. The throttled function will only invoke the original function at most once per every interval milliseconds. Unlike debounce (which delays execution until…

The count-and-say sequence is a sequence of digit strings defined by the recursive formula: countAndSay(1) = "1" countAndSay(n) is the way you would "say" the digit string from countAndSay(n-1), which is then converted into a different…

Design and implement a production-grade CI/CD pipeline using GitHub Actions. The pipeline should handle the full lifecycle from code validation to deployment, with proper safeguards and optimizations. Given a project configuration,…

In this challenge, you will design a system that efficiently finds the top $K$ drivers within a certain radius of a given latitude and longitude. This is a core component of ride-hailing services like Uber or Lyft. Given millions of…

A car travels from a starting position to a target destination, which is target miles east of the starting position. Along the way, there are gas stations. Each station[i] represents a gas station that is position_i miles east of the…

Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. Example 1: Example 2: The number of nodes in the list is in the range [0, 300]. -100 <= Node.val…

Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Example 2: 0 <= nums.length <= 10^5 -10^9 <= nums[i] <= 10^9

In English, we have a concept called root, which can be followed by some other word to form another longer word - let's call this word derivative. For example, when the root "help" is followed by the word "ful", we can form a derivative…

You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index, or false…