Leetcode problem 102 - Maximum Strong Pair XOR I
You are given a 0-indexed integer array nums. A pair of integers x and y is called a strong pair if it satisfies the condition:
Jonghan's learning path
Today I Learned as a developer
Recent posts
Leetcode problem 101 - Interval List Intersections
You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each list of i...
Leetcode problem 100 - Maximum Twin Sum of a Linked List
In a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0 <= i <= (n / ...
Leetcode problem 99 - Rearrange Array Elements by Sign
You are given a 0-indexed integer array nums of even length consisting of an equal number of positive and negative integers.
Leetcode problem 98 - Partition Array According to Given Pivot
You are given a 0-indexed integer array nums and an integer pivot. Rearrange nums such that the following conditions are satisfied: