Largest number formed from an array

This video explains an important coding interview question which is to find the largest number formed from an array of integers or strings. I have explained the solution in the simplest way possible using just string comparison and sorting. CODE LINK is present below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

[shivatomar]

This is only channel which talk about the intuition of the approach like he actually tells why we doing everything ! Great work man. Keep up the good work, please keeping bringing more questions like this if possible more frequently...we enjoy solving problems with you.

[HariKrishnan-ffhf]

Thanks for doing the inner explanation of Comparator..i was unhappy about geeksforgeeks explanation..but you cleared it👍

[akshatjain]

Brother I have been watching your videos and I am in love with coding just coz of u. Thank you so much bro. Keep uploading these type of videos. Coding community needs u.

[jiteshkumar]

best channel who's main motive is to tell approach and clear the concept..thanks you Sir!

[akshayapanda]

Please don't provide wrong information, Do you think the sorting technique you have used here will give nlogn time complexity?

[cseengineering]

your voice and explanation both are so clear, this thing attracts me to this channel.

[deepikadhamija]

They way u explain things, clear all the doubts. Thnx for making such explanatory videos

[mobilesuniverse]

yeh sabse best video hai, bhaut jagah solution deka, samaj ni aya, vector hashmap use kar rhe the

[alokesh]

Excellent video. Couldn't find a better explanation online!

[ShreyaSingh-vrqi]

Video is good, but you used selection sort technique. So, time complexity is O(n^2). Thanks for making video bro, I am currently in my pre-final year preparing for product based companies. Whenever i stuck on a problem or not get good expaination from GFG. in 70./. of cases i got your tutorial which helps me. Thanks again for your hard work.

[blumef]

sir i have huge respect for u... if i land a job i will love to meet and thank u a dozen... and dont stop making videos until u hit a million!

[blazedcosmicgoat]

for those saying it's O(N2) just implement the same logic in mergesort inside the merge function and you will have nlogn complexity.

[davidjonson]

Thanks sir ..for such video
Your video is so easy to understand and help us a lot

[rhythmbhandari]

The explanation is pretty much simple and easy
Thank you

[CodeSuccessChronicle]

You’re my motivation to start coding.... thank you so much please keep inspiring us with your

[varunnarayanan]

Some kind of Bubble sort is used here but the logic is explained which is the most important part. Very good video

[amermd]

Thanks for the 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<343 we will swap 3 with 34
after swapping [ 34, 30, 3]
for the next iteration, we are starting from i = 1, j=2. but how it is guaranty that i = 0, j = 1
3430 > 3034 why this condition is not checked, is it every time the condition is satisfied?

[ihopethiscommentisntabusiv]

Thank you for the video, but as someone mentioned the runtime is O(N^2), would be help to add the disclaimer that this can be done with mergesort to get N log(N). Either way thanks!

[robertsedgewick]

Very clear explanation. Makes the solution so intuitive!

[funcode-twcg]

thanks for the easy explaination of this problem !