Day - 92

Assalamu alaykum, everyone! Day by day I see these actions are giving the result! It is the 92nd day of my coding challenge!

I am going to say thanks for your attention and support! It motivates me to make it better!

So, let me write the code!

1. Problem 2418. Sort the People

Time Complexity:

The sortPeople() function has a time complexity of O(n^2), where n is the number of elements in the names and height arrays. This is because the sort() function iterates through the track array n times, and each iteration of the loop compares two elements in the array, which takes O(1) time. Therefore, the total time complexity of the function is O(n * n) = O(n^2).

Space Complexity:

The sortPeople() function has a space complexity of O(n), where n is the number of elements in the names and height arrays. This is because the function creates a new array track to store the sorted data, which takes O(n) space. The function also returns the track array, which adds another O(n) space. Therefore, the total space complexity of the function is O(n + n) = O(2n).

Code:

/*
?* @param {string[]} names
?* @param {number[]} heights
?* @return {string[]}
?*/

var sortPeople = function (names, heights) {
? let track = names.map((name, ind) => ({
? ? name: names[ind],
? ? age: heights[ind],
? }));

? track.sort((a, b) => b.age - a.age);

? return track.map((person) => person.name);
};        

#coding #challenges #leetcode #javascript #typescript #algorithms #100daysofcodechallenge #share #like