How should I practice Find Number of Perfect Pairs?

Start by reading the full statement, solve the visible examples, then compare the pattern against related LinkedIn online assessment problems in FastPrep.

Is Find Number of Perfect Pairs associated with LinkedIn?

FastPrep tags this as a LinkedIn online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Find Number of Perfect Pairs

Learn this problem

● Medium

LinkedInOA

Problem statement

A perfect pair (x, y) is such that min( | x - y |, | x + y | ) <= min( | x |, | y |) and max( | x - y |, | x + y | ) >= max( | x |, | y |). Given an array of unsorted integers, find the number of perfect pairs.

Function

findNumberOfPerfectPairs(nums: int[]) → int

Complete the function findNumberOfPerfectPairs in the editor.

findNumberOfPerfectPairs has the following parameter:

int[] nums: an array of integers

Returns

int: the number of perfect pairs

Examples

Example 1

nums = [2, -3, 5]return = 2

(2, -3) and (-3, 5) are perfect pairs

Problem statement

Function

Examples

Example 1

More LinkedIn problems