179. Largest Number | Daily Challenge | 18 Sep 2024 | POTD #leetcodechallenge #dsa #dailychallenge

preview_player
Показать описание


Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.

Since the result may be very large, so you need to return a string instead of an integer.

CHAPTERS
0:00 Welcome
0:12 Question Explanation
1:20 Intuition with two numbers
2:42 Comparator
4:35 Built-in sort
8:03 Theory - Largest Number
8:50 Steps
13:20 Time & Space Complexity
13:45 Code
19:00 Conclusion

------------------------------------------------
Your queries:

179 Largest Number
data structures playlist
data structures
data structures and algorithms
Leetcode
Leetcode java
Leetcode playlist
Problem 179
Leetcode 179
Largest Number java
Largest Number
Largest Number c++
POTD
Problem Of The Day
Leetcode Daily Challenge

#codinglife #programming #webdev #codenewbie #fullstack #frontend #backend #devops #blockchain #leetcode #algorithms #datascience #python #javascript #java #cpp #ruby #golang #rust #php #sql #cloudcomputing #docker #kubernetes #serverless #web3 #techcommunity #softwareengineering #codechallenge #developerlife #array ###codingjourney #doublylinkedlist #codingproblems #codenewbie #javaprogramming #leetcodejava #linkedlistimplementation #arraysinjava #leetcodechallenge #leetcodejava #learning #datastructure #datastructureimplementation #algorithms #dsa #dsalgo #softwareengineering #faang #faangpreparation #faangcodinginterviewpreparation #faangpreparation #interviewquestions #interview #codingquestions #codingtutorial #codingforbeginners #linkedlist #leetcode179 #Largest_Number #dailychallenge #potd #problemoftheday

===========================
➡️ Connect with me:
===========================
Рекомендации по теме
Комментарии
Автор

/**
* @param {number[]} nums
* @return {string}
*/
var largestNumber = function(nums) {
let result;
let b = nums.sort((a, b) => {
let first = String(a);
let second = String(b);
let sumFirst = first.concat(second);
let sumSecond = second.concat(first);
if (Number(sumFirst) > Number(sumSecond)) {
return -1;
} else {
return 1;
}
});
if (b[0] === 0) {
return String(0);
} else {
let c = b.map(item => {
return String(item);
});
result = c.join('');
}
return result;
};

Same Approach But I Have Used JS.
Nice Explanation 😇.

HamzaShafqat-wm
Автор

Join Our Discord Community! 🎉
Looking to master data structures and algorithms, ace your interviews, or dive into tech discussions? Our Discord server is the perfect place for you!
Whether you're preparing for a job interview or just passionate about coding, you'll find valuable resources, discussions, and support from like-minded individuals.
See you there! 👋

CTO-Bhaiya
join shbcf.ru