def min_interval_brute_force(intervals: list[list[int]], queries: list[int]) -> list[int]:public int[] minIntervalBruteForce(int[][] intervals, int[] queries)vector<int> minIntervalBruteForce(vector<vector<int>>& intervals, vector<int>& queries)function minIntervalBruteForce(intervals, queries)
def min_interval_brute_force(intervals, queries):
# Write your solution here
pass
class Solution {
public int[] minIntervalBruteForce(int[][] intervals, int[] queries) {
// Write your solution here
return new int[queries.length];
}
}
#include <vector>
using namespace std;
vector<int> minIntervalBruteForce(vector<vector<int>>& intervals, vector<int>& queries) {
// Write your solution here
return vector<int>(queries.size(), -1);
}
function minIntervalBruteForce(intervals, queries) {
// Write your solution here
}
Common Bugs to Avoid
Wrong: [-1, -1, -1]Not checking any intervals for queries or returning default -1 without processing.✅ Add iteration over intervals for each query and update minimum length if interval covers query.
Wrong: [3,3,3,4]Not updating minimum length correctly; always returning length of first covering interval.✅ For each query, compare lengths of all covering intervals and return the smallest.
Wrong: [1,1,1,-1]Incorrectly treating zero-length intervals as length 0 instead of 1 or excluding them.✅ Calculate length as end - start + 1, so zero-length intervals have length 1.
Wrong: TLE or timeoutUsing brute force approach for large inputs causing O(n*m) complexity.✅ Implement sorting of intervals and queries and use a min-heap to track active intervals for O(n log n + m log n) complexity.