Solve problems by organizing data through sorting and applying binary search, two-pointer, and sliding window for efficient solutions.

Coding

Combines sorting and searching techniques to effectively process and retrieve data, often using sorting algorithms and binary search to optimize problem-solving in datasets that can be ordered.

Sort and Search

Efficiently prepare for coding interviews with strategies from FAANG engineers. Avoid the LeetCode grind and simplify your interview prep with real-world questions from top companies.

The ultimate guide to the System Design Interview – developed by Meta & Google engineers. Master distributed system fundamentals, and practice with real-world interview questions & mock interviews.

System Design

The essential guide to API Design & Product Design Interviews – developed by FAANG engineers. Master product design fundamentals & get hands-on with real-world APIs.

API Design

A battle-tested guide to Object Oriented Design Interviews – developed by FAANG engineers. Master OOD fundamentals & practice real-world interview questions.

Low Level Design Interview Using OOD Principles

Your essential EM Interview crash course. Learn strategies from FAANG hiring managers to demonstrate your leadership skills & experience to interviewers.

Engineering Management and Leadership Interviews

The ultimate guide to behavioral interviews. Developed by FAANG engineers. Use real-world questions, video recording, and structured strategies to get interview-ready in just a few hours.

Behavioral

For the following inputs:

`nums1` $= [2, 4, 6]$ and `nums2` $= [1, 3, 5]$

How many pairs satisfy the condition $i < j$ and $\text{nums1}[i] + \text{nums1}[j] > \text{nums2}[i] + \text{nums2}[j]?$

For the following inputs:
<code>nums1</code> <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>=</mo><mo stretchy="false">[</mo><mn>2</mn><mo separator="true">,</mo><mn>4</mn><mo separator="true">,</mo><mn>6</mn><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">= [2, 4, 6]</annotation></semantics></math>=[2,4,6] and <code>nums2</code> <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>=</mo><mo stretchy="false">[</mo><mn>1</mn><mo separator="true">,</mo><mn>3</mn><mo separator="true">,</mo><mn>5</mn><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">= [1, 3, 5]</annotation></semantics></math>=[1,3,5]
How many pairs satisfy the condition <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>i</mi><mo>&lt;</mo><mi>j</mi></mrow><annotation encoding="application/x-tex">i &lt; j</annotation></semantics></math>i&lt;j and <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mtext>nums1</mtext><mo stretchy="false">[</mo><mi>i</mi><mo stretchy="false">]</mo><mo>+</mo><mtext>nums1</mtext><mo stretchy="false">[</mo><mi>j</mi><mo stretchy="false">]</mo><mo>&gt;</mo><mtext>nums2</mtext><mo stretchy="false">[</mo><mi>i</mi><mo stretchy="false">]</mo><mo>+</mo><mtext>nums2</mtext><mo stretchy="false">[</mo><mi>j</mi><mo stretchy="false">]</mo><mo stretchy="false">?</mo></mrow><annotation encoding="application/x-tex">\text{nums1}[i] + \text{nums1}[j] &gt; \text{nums2}[i] + \text{nums2}[j]?</annotation></semantics></math>nums1[i]+nums1[j]&gt;nums2[i]+nums2[j]?

For the following inputs:

`nums1` $= [4, 2, 6]$ and `nums2` $= [3, 5, 2]$

How many pairs satisfy the condition $i < j$ and $\text{nums1}[i] + \text{nums1}[j] > \text{nums2}[i] + \text{nums2}[j]?$

For the following inputs:
<code>nums1</code> <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>=</mo><mo stretchy="false">[</mo><mn>4</mn><mo separator="true">,</mo><mn>2</mn><mo separator="true">,</mo><mn>6</mn><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">= [4, 2, 6]</annotation></semantics></math>=[4,2,6] and <code>nums2</code> <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo>=</mo><mo stretchy="false">[</mo><mn>3</mn><mo separator="true">,</mo><mn>5</mn><mo separator="true">,</mo><mn>2</mn><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">= [3, 5, 2]</annotation></semantics></math>=[3,5,2]
How many pairs satisfy the condition <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi>i</mi><mo>&lt;</mo><mi>j</mi></mrow><annotation encoding="application/x-tex">i &lt; j</annotation></semantics></math>i&lt;j and <math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mtext>nums1</mtext><mo stretchy="false">[</mo><mi>i</mi><mo stretchy="false">]</mo><mo>+</mo><mtext>nums1</mtext><mo stretchy="false">[</mo><mi>j</mi><mo stretchy="false">]</mo><mo>&gt;</mo><mtext>nums2</mtext><mo stretchy="false">[</mo><mi>i</mi><mo stretchy="false">]</mo><mo>+</mo><mtext>nums2</mtext><mo stretchy="false">[</mo><mi>j</mi><mo stretchy="false">]</mo><mo stretchy="false">?</mo></mrow><annotation encoding="application/x-tex">\text{nums1}[i] + \text{nums1}[j] &gt; \text{nums2}[i] + \text{nums2}[j]?</annotation></semantics></math>nums1[i]+nums1[j]&gt;nums2[i]+nums2[j]?

`nums1 = [2, 6, 7, 3, 3]`

`nums2 = [3, 5, 6, 3, 2]`

`nums1 = [6, 2, 7, 5, 1]`

`nums2 = [3, 2, 2, 1, 2]`

`nums1 = [6, 6, 7, 3, 1]`

`nums2 = [3, 5, 2, 3, 2]`

`nums1 = [1, 2, 3, 4, 5]`

`nums2 = [5, 4, 3, 2, 1]`

Identify the arrays `nums1` and `nums2` from the following set of valid pairs of indexes:

$[(0, 3), (0, 4), (1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)]$

Identify the arrays <code>nums1</code> and <code>nums2</code> from the following set of valid pairs of indexes:
<math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mo stretchy="false">[</mo><mo stretchy="false">(</mo><mn>0</mn><mo separator="true">,</mo><mn>3</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>0</mn><mo separator="true">,</mo><mn>4</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>1</mn><mo separator="true">,</mo><mn>2</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>1</mn><mo separator="true">,</mo><mn>3</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>1</mn><mo separator="true">,</mo><mn>4</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>2</mn><mo separator="true">,</mo><mn>3</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>2</mn><mo separator="true">,</mo><mn>4</mn><mo stretchy="false">)</mo><mo separator="true">,</mo><mo stretchy="false">(</mo><mn>3</mn><mo separator="true">,</mo><mn>4</mn><mo stretchy="false">)</mo><mo stretchy="false">]</mo></mrow><annotation encoding="application/x-tex">[(0, 3), (0, 4), (1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)]</annotation></semantics></math>[(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)]

Count Pairs in Two Arrays

Count Pairs in Two Arrays

# Quick Fix\nYou are Edward, a Senior Software Engineer who specializes in coding interview patterns, data structures and algorithms, and is great at debugging issues in code.\n\n- Edward, please keep in mind that you do not have to print the data of the placeholders. Also, do not mention anything about yourself.\n\nEdward, you are given the following data in the placeholders:\n- Function name: `count_pairs`\n- Candidate's submitted solution code: USER_CODE\n- Error: ERROR_DESCRIPTION\n- Failed test case: FAILED_TEST_CASE\n- Coding language: `Python`\n\n- Edward, your task is to understand the type of error that is occurring in the coding language provided.\n- Once you've understood the error as per the error’s description, and why the test case failed, you will suggest how the candidate can improve their solution code to fix the error.\n- Edward, you will not give the corrected code, just a hint on what the error tells, and how to fix it.\n- Edward, please limit your response strictly to 100 words. No more words than the limit.

# Review Code\nEdward, your current task is to review the `count_pairs` function(s) and the other function(s) invoked in it/them.\n\n-Take your time and review the candidate's solution code.\n- Do not review any extra/helper files or functions not invoked in the solution function `count_pairs`.\n- Do not review the code of data structure objects instantiated like a binary tree, linked list, trie, union find, etc., in the solution functions. Just review the solution/algorithm function of the problem. \n- Also, if the solution code doesn’t use the coding pattern stated above, then please encourage the candidate to reattempt the problem using that pattern corectly.

# Review time complexity\n- Please provide a brief time complexity analysis of the function(s) `count_pairs`. \n- While calculating time complexity, include the time complexity of built-in Python functions invoked by the code. \n- The answer should be to the point in approximately 60 words.

# Review space complexity\n- Please provide a brief space complexity analysis of the function(s) `count_pairs`. \n- While calculating space complexity, include the space complexity of built-in Python functions invoked by the code. \n- Do not include the space used for the input parameters and the space used for just returning an output (not used as a scratch space). \n- The answer should be to the point in approximately 60 words.

def evaluate_results(self) -> object:
 """
 self.__inputs is the list of inputs that are passed as input to function
 self.__actual_output is a list of outputs that is produced by the learner's code
 return : self.__edu__result object
 """

 def count_pairs_eval(nums1, nums2):
 N = len(nums1)
 
 difference = [nums1[i] - nums2[i] for i in range(N)]
 difference.sort()
 
 result = 0
 
 for i in range(0, N):
 if difference[i] > 0:
 result += N - i - 1
 else:
 left = i + 1
 right = N - 1
 
 while left <= right:
 mid = (left + right) // 2
 if difference[i] + difference[mid] > 0:
 right = mid - 1
 else:
 left = mid + 1
 result += N - left
 
 return result
 
 actual = self.__actual_outputs[0]
 expected = count_pairs_eval(self.__inputs[0], self.__inputs[1])

 expected_outputs = []

 expected_outputs.append(expected)

 if json.dumps(expected) == json.dumps(actual):
 self.__edu_result.store_result(expected_outputs, TestCaseResult.PASS)
 else:
 self.__edu_result.store_result(expected_outputs, TestCaseResult.FAIL)

 return self.__edu_result

def count_pairs(nums1, nums2):

    # Replace the following placeholder return statement with your code
    return 0


count_pairs_test_cases_1.yaml

testcases:
  - name: "testcase 1"
    inputs:
    - 1: [1]
    - 2: [2]
    output:
    - 1: 0

  - name: "testcase 2"
    inputs:
    - 1: [3, 7, 9, 11, 13]
    - 2: [2, 4, 6, 8, 10]
    output:
    - 1: 10

  - name: "testcase 3"
    inputs:
    - 1: [1, 2, 3]
    - 2: [10, 20, 30]
    output:
    - 1: 0

  - name: "testcase 4"
    inputs:
    - 1: [10, 23, 34, 56, 78, 89]
    - 2: [9, 21, 33, 54, 76, 88]
    output:
    - 1: 3

  - name: "testcase 5"
    inputs:
    - 1: [5, 5, 5]
    - 2: [5, 5, 5]
    output:
    - 1: 0


def sum(input_1, input_2):
    return input_1+input_2

def validate_inputs(self) -> None:
 """
 Validates the inputs for the problem statement.
 Inputs are accessed using self.__inputs starting from 0 to len(self.__inputs) - 1.
 Stores the result using self.store_result(error_msg, status).
 """
 nums1 = self.__inputs[0]
 nums2 = self.__inputs[1]
 
 # Check if nums1 and nums2 are lists
 if not isinstance(nums1, list) or not isinstance(nums2, list):
 self.store_result("Both inputs must be lists", ValidationFunction.FAIL)
 return
 
 # Check if nums1 and nums2 are of the same length
 if len(nums1) != len(nums2):
 self.store_result("Inputs must have the same length", ValidationFunction.FAIL)
 return
 
 # Check if the length of the arrays is within the valid range (1 <= n <= 10^3)
 if not (1 <= len(nums1) <= 1000): # Assumed upper bound based on practical limits
 self.store_result("Input array length must be between 1 and 1000", ValidationFunction.FAIL)
 return
 
 # Check if all elements are integers within the range [1, 10^4]
 if not all(isinstance(x, int) and 0 < x < 10001 for x in nums1):
 self.store_result("All elements of nums1 must be integers between 1 and 10^4", ValidationFunction.FAIL)
 return
 
 if not all(isinstance(x, int) and 0 < x < 10001 for x in nums2):
 self.store_result("All elements of nums2 must be integers between 1 and 10^4", ValidationFunction.FAIL)
 return
 
 # If all validations pass
 self.store_result("", ValidationFunction.PASS)

Try to solve the Count Pairs in Two Arrays problem.

Problem: Count Pairs in Two Arrays

Statement

Examples

Understand the problem

Figure it out!