179. Largest Number | sorting | string | Leetcode Daily Challenge | DSA | Java | hindi

Problem Name:
179. Largest Number
Problem Statement:
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.
Problem Link:
leetcode.com/p...
Solution Link:
github.com/Tiw...
Graph Playlist:
• Graph Data Structure S...
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Pl...
Java Plus DSA Sheet:
docs.google.co...
Notes:
github.com/Tiw...
Telegram Link:
shashwattiwari...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding​​ #problemsolving​

[@shashwat_tiwari_st]

like target for this video is 120. Please do like if you have understood the explanation as well as the code😊😊

[@kritikumari727]

Very helpful way of understanding

[@sushantsingh7924]

Great explanation bhaiya

[@rohanshenoy9464]

very nice explanation..thank u 🙌🙌

[@Bhalu-kl7sq]

other just gives the solution to the specific question but you always tell some extra things such that we can solve similar questions in future thanks love it😁

[@sonikumariprajapati]

Thank you ❤

[@pranavamali05]

👍👌👌

[@NaniVaddi-k1t]

👍🏻👌🏻👌🏻

[@user-yf9fo2pg5e]

everything fine just that is in java, C++ lovers can do anything

[@amermd9254]

@shashwat_tiwari_st , thanks for explanation, I have a doubt about the sorting process Let's take an example [3,30,34] i = 0, j =1 => 330>303 so we don't swap i = 0, j = 2 => 334 3034 why this condition is not checked, is it every time the condition is satisfied?

[@shashwat_tiwari_st]

It's bubble sort technique we are trying to find the target digit number and hence when first iteration is over we get the largest one at 0th index, thus we skip it in the next iteration and find for index 1, then for index 2 and so on.. if you have not read about bubble sort, please read once, then it will be more clear..

[@pranavamali05]

Sir radix sort se karna achha rahega kya??

[@cyclo_studios4229]

Please provide me with comparator basics video

[@shashwat_tiwari_st]

@@cyclo_studios4229 This one. kzbin.info/www/bejne/p6bImIyih8qtqq8si=Lbt3LRLoA5pFWtXM

[@Ni_Xk]

Need guidance

[@gajananmathe3720]

Thanks ❤🎉