Return a sorted array in lexicographical order in JavaScript

We are required to write a JavaScript function that takes two arrays, say arr1 and arr2. Our function should return a sorted array in lexicographical order of the strings of arr1 which are substrings of strings of arr2.

Example

The code for this will be −

const lexicographicalSort = (arr1 = [], arr2 = []) => {
   let i, j;
   const res = [];
   outer: for (j = 0; j < arr1.length; j++) {
      for (i = 0; i < arr2.length; i++) {
         if (arr2[i].includes(arr1[j])) {
            res.push(arr1[j]);
            continue outer;
         };
      };
   }
   return res.sort();
};
const arr2 = ["lively", "alive", "harp", "sharp", "armstrong"];
const arr1 = ["xyz", "live", "strong"];
console.log(lexicographicalSort(arr1, arr2));

Output

And the output in the console will be −

[ 'live', 'strong' ]

AmitDiwan

Published on 24-Nov-2020 09:55:48

• Related Questions & Answers
• Last Substring in Lexicographical Order in C++
• Finding squares in sorted order in JavaScript
• Python Pandas - Return a sorted copy of the index in descending order
• C++ Program to Sort Elements in Lexicographical Order (Dictionary Order)
• Sort the words in lexicographical order in Python
• Sort the words in lexicographical order in C#
• Sort the words in lexicographical order in Java
• K-th Smallest in Lexicographical Order in C++
• Print all the combinations of a string in lexicographical order in C++
• Merge two sorted arrays to form a resultant sorted array in JavaScript
• JavaScript - Check if array is sorted (irrespective of the order of sorting)
• Searching in a sorted 2-D array in JavaScript
• Finding desired numbers in a sorted array in JavaScript
• Print all longest common sub-sequences in lexicographical order in C++
• Checking for majority element in a sorted array in JavaScript