LeetCode 1385 | Find the Distance Value Between Two Arrays | Java | Easy | Array | CodeByTushu
Description: 🚀 Welcome Back to CodeByTushu!
In today’s video, we solve LeetCode 1385 — Find the Distance Value Between Two Arrays using Array & Two Pointers in Java.
In this problem, we are given two integer arrays arr1 and arr2 along with an integer threshold d. We are asked to compute the distance value between the two arrays, which represents the count of elements in arr1 for which no element in arr2 has an absolute difference less than or equal to d. Geometrically and algebraically, an element a from arr1 is valid if and only if no value in arr2 falls inside the closed interval [a - d, a + d].
We implement an optimal linear scan paired with early-exit pruning. For each element in arr1, we check elements of arr2, immediately breaking the inner loop upon finding the first violating element where |a - b| is less than or equal to d. This optimization drastically reduces actual operations in practice, achieving high performance with O(N * M) worst-case time complexity, near-linear average time, and strictly O(1) constant auxiliary space.
🔥 Problem Highlights
✅ Interval exclusion principle: no element in arr2 can lie within [a - d, a + d]
✅ Early-exit pruning breaks the inner comparison loop on the first threshold violation
✅ Direct in-place evaluation with zero extra memory allocations
✅ Simple and cache-friendly comparison pattern
✅ Handles negative values and edge thresholds seamlessly
✅ O(N * M) worst-case time complexity and O(1) constant auxiliary space
⏱️ TIMESTAMPS
00:00 Intro & Day 103 Streak Celebration
00:32 Problem Understanding & Constraints Analysis
01:21 Key Breakthrough: The Interval Exclusion Principle
02:04 Step-by-Step Algorithm & Early Exit Pruning
02:48 Optimal Java 17 Solution Walkthrough Line by Line
03:37 Test Cases Walkthrough & Day 103 Streak Celebration
04:10 Time Complexity Analysis (O(N * M) Worst, O(1) Pruned)
04:44 Space Complexity Analysis (O(1) Constant Auxiliary Space)
05:04 Summary & Outro!
📂 Problem Folder & Detailed Documentation:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/tree/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays
☕ Java Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/Solution.java
🐍 Python Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/solution.py
⚡ C++ Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/solution.cpp
🌐 JavaScript Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/solution.js
🔗 LeetCode Source Code
📌 https://codebytushu.com/leetcode/problem/find-the-distance-value-between-two-arrays
🌐 All LeetCode Solutions
📌 https://codebytushu.com/Leetcode/
📱 Join CodeByTushu on WhatsApp
Get coding updates, LeetCode solutions, daily questions and more.
https://whatsapp.com/channel/0029Vb8k5mCDeON2Xwlkxe40
❤️ Donate
📌 https://codebytushu.com/Leetcode/donate.php
🔥 Perfect For
LeetCode Easy Problems
Java DSA Preparation
Array Manipulation
Two Pointers Technique
Binary Search Applications
Time Complexity Optimization
Coding Interview Preparation
Problem Solving
🌐 Follow CodeByTushu
▶️ YouTube: https://www.youtube.com/@codebytushu
📸 Instagram: https://instagram.com/codebytushu/
💼 LinkedIn: https://www.linkedin.com/company/codebytushu/
🌍 Website: https://codebytushu.com
🐙 GitHub: https://github.com/CodeByTushu
❤️ Don’t Forget To
👍 Like | 💬 Comment | 🔔 Subscribe
💬 Question of the Day
What is the condition on element b in arr2 that causes an element a in arr1 to be disqualified from the distance count?
1️⃣ b lies within the closed interval [a - d, a + d]
2️⃣ b is strictly greater than a + d
3️⃣ b is strictly less than a - d
4️⃣ b equals a
#LeetCode1385 #LeetCode #FindTheDistanceValueBetweenTwoArrays #Java #JavaDSA #Array #TwoPointers #BinarySearch #DSA #CodingInterview #ProblemSolving #LeetCodeEasy #DailyLeetCode #JavaProgramming #CodeByTushu
👇 Comment the answer below! 🔥 Close description
In today’s video, we solve LeetCode 1385 — Find the Distance Value Between Two Arrays using Array & Two Pointers in Java.
In this problem, we are given two integer arrays arr1 and arr2 along with an integer threshold d. We are asked to compute the distance value between the two arrays, which represents the count of elements in arr1 for which no element in arr2 has an absolute difference less than or equal to d. Geometrically and algebraically, an element a from arr1 is valid if and only if no value in arr2 falls inside the closed interval [a - d, a + d].
We implement an optimal linear scan paired with early-exit pruning. For each element in arr1, we check elements of arr2, immediately breaking the inner loop upon finding the first violating element where |a - b| is less than or equal to d. This optimization drastically reduces actual operations in practice, achieving high performance with O(N * M) worst-case time complexity, near-linear average time, and strictly O(1) constant auxiliary space.
🔥 Problem Highlights
✅ Interval exclusion principle: no element in arr2 can lie within [a - d, a + d]
✅ Early-exit pruning breaks the inner comparison loop on the first threshold violation
✅ Direct in-place evaluation with zero extra memory allocations
✅ Simple and cache-friendly comparison pattern
✅ Handles negative values and edge thresholds seamlessly
✅ O(N * M) worst-case time complexity and O(1) constant auxiliary space
⏱️ TIMESTAMPS
00:00 Intro & Day 103 Streak Celebration
00:32 Problem Understanding & Constraints Analysis
01:21 Key Breakthrough: The Interval Exclusion Principle
02:04 Step-by-Step Algorithm & Early Exit Pruning
02:48 Optimal Java 17 Solution Walkthrough Line by Line
03:37 Test Cases Walkthrough & Day 103 Streak Celebration
04:10 Time Complexity Analysis (O(N * M) Worst, O(1) Pruned)
04:44 Space Complexity Analysis (O(1) Constant Auxiliary Space)
05:04 Summary & Outro!
📂 Problem Folder & Detailed Documentation:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/tree/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays
☕ Java Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/Solution.java
🐍 Python Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/solution.py
⚡ C++ Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/solution.cpp
🌐 JavaScript Solution:
https://github.com/CodeByTushu/CodeByTushu-LeetCode-Solutions/blob/main/solutions/November/05-November/1385-Find-the-Distance-Value-Between-Two-Arrays/solution.js
🔗 LeetCode Source Code
📌 https://codebytushu.com/leetcode/problem/find-the-distance-value-between-two-arrays
🌐 All LeetCode Solutions
📌 https://codebytushu.com/Leetcode/
📱 Join CodeByTushu on WhatsApp
Get coding updates, LeetCode solutions, daily questions and more.
https://whatsapp.com/channel/0029Vb8k5mCDeON2Xwlkxe40
❤️ Donate
📌 https://codebytushu.com/Leetcode/donate.php
🔥 Perfect For
LeetCode Easy Problems
Java DSA Preparation
Array Manipulation
Two Pointers Technique
Binary Search Applications
Time Complexity Optimization
Coding Interview Preparation
Problem Solving
🌐 Follow CodeByTushu
▶️ YouTube: https://www.youtube.com/@codebytushu
📸 Instagram: https://instagram.com/codebytushu/
💼 LinkedIn: https://www.linkedin.com/company/codebytushu/
🌍 Website: https://codebytushu.com
🐙 GitHub: https://github.com/CodeByTushu
❤️ Don’t Forget To
👍 Like | 💬 Comment | 🔔 Subscribe
💬 Question of the Day
What is the condition on element b in arr2 that causes an element a in arr1 to be disqualified from the distance count?
1️⃣ b lies within the closed interval [a - d, a + d]
2️⃣ b is strictly greater than a + d
3️⃣ b is strictly less than a - d
4️⃣ b equals a
#LeetCode1385 #LeetCode #FindTheDistanceValueBetweenTwoArrays #Java #JavaDSA #Array #TwoPointers #BinarySearch #DSA #CodingInterview #ProblemSolving #LeetCodeEasy #DailyLeetCode #JavaProgramming #CodeByTushu
👇 Comment the answer below! 🔥 Close description