You are given an array of integers, nums. Return an array of the same length, in which the ith element represents the count of smaller elements to the right of <code>nums[i]</code>. 

Example:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: [5,3,4,7,2]
Output: <code>[3,1,1,1,0] 
Explanation:</code>
There are 3 smaller elements (3, 4, 2) on the right side of 5.
There is only 1 smaller element (2) on the right side of 3.
There is 1 smaller element (2) on the right side of 4.
There is 1 smaller element (2) on the right side of 7.
There is 0 smaller element on the right side of 2.
</pre>

Count Smaller Numbers

Given two integer arrays, return the intersection of the two arrays.
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2]
</pre>
<div>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
Output: [9,4]</pre>
</div>
&nbsp;

Intersection Of Two Arrays

Given an array consisting of only positive lengths, return the largest perimeter of a triangle that can be formed from any 3 lengths.
If no triangle can be formed return 0.
<div>
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [2,1,2]
Output: 5
</pre>
<div>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [1,2,1]
Output: 0
</pre>
<div>
Example 3:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [3,2,3,4]
Output: 10
</pre>
<div>
Example 4:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [3,6,2,3]
Output: 8
</pre>
</div>
</div>
</div>
</div>

Largest Surrounding Triangle

Given an array that is not sorted, return the maximum difference between any two successive elements when the array is in sorted order.
Return 0 if the array contains less than 2 elements.
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [3,6,9,1]
Output: 3
Explanation: If we sort the array we get: [1,3,6,9], either
&nbsp; (3,6) or (6,9) has the maximum difference 3.</pre>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [10]
Output: 0
Explanation: Return 0 if the array contains less than 2 elements.</pre>
Constraints:
<ul>
<li>Assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.</li>
<li>Can you solve it in O(n) time/space?</li>
</ul>

Maximum Sorted Difference

Given an array of time intervals that consist of start and end times, return the minimum number of meeting rooms required.
<code>Input: [[s1,e1],[s2,e2],...]</code> (si &lt; ei)
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: <code>[[0, 30],[5, 10],[15, 20]]</code> Output: 2</pre>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [[7,10],[2,4]]
Output: 1</pre>

Meeting Rooms II

Given an array of time intervals that consist of start and end times, return true if the person can attend all the meetings, otherwise return false.
<code>Input: [[s1,e1],[s2,e2],...]</code> (si &lt; ei)
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: <code>[[0,30],[5,10],[15,20]]</code> Output: false</pre>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [[7,10],[2,4]]
Output: true
</pre>
&nbsp;

Meeting Time

Given an array of intervals, combine all intervals that are overlapping.
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Merge the intervals: [1,3] and [2,6] into [1,6].
</pre>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] overlap so merge them into [1,5].</pre>

Combine Intervals

Given a string and check if you can arrange all characters in such a way that no two adjacent characters are the same.
If it is possible, return your result. Otherwise, return an empty string.
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: S = "aab"
Output: "aba"
</pre>
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: S = "aaab"
Output: ""
</pre>
&nbsp;
&nbsp;

Problem Title	Difficulty	Frequency in Interviews
Combine Intervals	Medium
Meeting Rooms II	Medium
Intersection Of Two Arrays	Easy
Restructure String	Medium
Count Smaller Numbers	Hard
Meeting Time	Easy
Largest Surrounding Triangle	Easy
Maximum Sorted Difference	Hard

Most Frequently Asked Sort Interview Questions

Sort By: Company Questions

Sort By: Problem Type