Describe a time when you had to make a trade-off between technical debt and delivering a feature on time. How did you handle it?

LeetCode #295 - Find Median from Data Stream\nYou are given two sorted arrays, nums1 and nums2, of size m and n respectively. Your task is to find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).\n\n**Input:**\n- nums1: array of integers\n- nums2: array of integers\n\n**Output:**\n- median of the two sorted arrays\n\n**Constraints:**\n- 0 <= nums1.length, nums2.length <= 1000\n- -10^6 <= nums1[i], nums2[i] <= 10^6\n

How would you design a rate limiter for a web service to prevent abuse? What considerations would you take into account?