Relative Sorting Problem Statement
You are given two arrays, 'ARR' of size 'N' and 'BRR' of size 'M'. Your task is to sort the elements of 'ARR' such that their relative order matches that in 'BRR'. Any elements in 'ARR' not found in 'BRR' should be appended at the end in sorted order.
Example:
Input:
ARR = {9, 5, 8, 4, 6, 5}
BRR = {8, 4, 5}
Output:
{8, 4, 5, 5, 6, 9}
Constraints:
1 <= T <= 5
1 <= N <= 10^5
1 <= M <= 10^5
-10^9 <= ARR[i], BRR[i] <= 10^9
- Time limit: 1 sec
Note:
Elements of 'BRR' are non-repeating.
Additional Information:
This function only needs implementation; the output is automatically handled elsewhere.

AnswerBot
1y
The task is to sort the elements of ARR in such a way that the relative order among the elements will be the same as those are in BRR. For the elements not present in BRR, append them in the last in s...read more
Help your peers!
Add answer anonymously...
Top Software Developer Interview Questions Asked at Newgen Software Technologies
Q. What are constructors?
Q. Define the concept of OOPs.
Q. What is OOPS in Java?
Interview Questions Asked to Software Developer at Other Companies
Top Skill-Based Questions for Newgen Software Technologies Software Developer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

