Bigger Is Greater HackerRank Solution

[@JavaAidTutorials]

JAVAAID community: KZbin recently changed the way they monetize my content. My channel now needs 1,000 subscribers so it would be awesome if you could show your support by both watching my videos and subscribing to my channel if you haven’t already done so. Monetizing my videos allows me to invest back into the channel with new equipment so a small gesture from you goes a huge way for me. Many thanks for your support!

[@smahidharreddy]

Hi Kanahaiya, Thanks for the video. your solution is good and pretty simple to understand. Could you also make video on Queens Attack II.

[@JavaAidTutorials]

​@@smahidharreddy Thanks for your compliment. Will try to make a tutorial on this on future if possible. It takes a lot of effort and time to make the good content and after that, very fewer people will watch then it does not motivate the creator at all. so currently I am focusing on the questions which most of the people tried but did not able to solve due to the right algorithm or approach. If there are too many people who want the solution for Queen attack problem will definitely make a video tutorial on this very soon. but if you need help to solve this, I can.

[@navinchainani4721]

First i don't understand programming i finds it too difficult then i started coding from u KZbin channel after that i understand coding very nicely

[@JavaAidTutorials]

thanks for the such a nice compliment.🙂 I am glad, you are learning something from our channel.

[@GG-sw9vm]

Does this work with "dkhc", with the logic, it will be d k h c, since d < k, we swap out c which is the smallest character to the right, now it becomes c k h d, after sorting c d h k which is wrong.

[@yashsalvi5043]

How do you come up with such logics bro ? Legit 🐐

[@abhinashbihari2881]

We can use next_permutation(s.begin,s.end) to get next lexicographical greater string

[@Mike-mw1fu]

Thank for helping me in optimizing code

[@JavaAidTutorials]

Most welcome.

[@ashutoshaswal]

From your reply on my solution! Thanks for helping me in optimizing the code!

[@JavaAidTutorials]

most welcome..:)

[@rajasinghrajpoot8626]

thank u very much brother..

[@satyasantosh3143]

Very good explanation!

[@JavaAidTutorials]

Glad it was helpful!

[@susritipal3747]

Sir why you take endindex = n-1, extend- -, In the loop please explain

[@arunkumarvaithiyanathan9808]

Please Explain Line 32: int firstSmallChar=charArray[endindex-1] why should we convert char to int ? Instead of do like Line 32: int firstSmallChar=endindex-1; Line 37: In 'if' condition (charArray[startindex]>charArray[firstSmallChar]) Thanks in Advance!!

[@navinchainani4721]

Bro u are best KZbinr u are making future of ours keep doing bro

[@JavaAidTutorials]

thanks. just trying to convey my knowledge in a best possible ways.

[@adarshjaiswal7334]

I have started loving your vedios and parallelly the Hackerrank. But I was having a doubt here line37 :- Is it necessary to check charArray[startIndex]> firstSmallChar , bcz in the starting loop itself we have selected "d" which is smaller than all other so obviously value of charArray[startIndex] will be always greater than "d". Please let me understand if I misunderstood something.

[@JavaAidTutorials]

Could you please mentioned the time as well , so that i can go and recall it.

[@reevarastogi6224]

very nice explaination!!

[@kratikavarshney1106]

Thanks. Very clear

[@JavaAidTutorials]

thanks for you feedback @Kratika.

[@codeminatiinterviewcode6459]

I was doing the same thing but just using an extra string for return and hence HRank was giving Segmentation Fault... And I wasted 2 Hrs. in Detecting Error of Memory overload... I hope this helps... :)

[@sagarock1012]

Hey! I didn't get the question , how is "abcd" > "abdc" Thank you

[@JavaAidTutorials]

you have to consider lexicographical order (alphabetical order).that's why abcd > abdc because abcd comes before abdc (if you look into dictionary)

[@sandrakonotey4570]

@@JavaAidTutorials "abcd" < "abdc"(abcd is less than abdc) not "abcd" > "abdc"

[@anuragsekhri2315]

well explained

[@JavaAidTutorials]

thank you..:)

[@tanmaysinghal8370]

Bro please make the video solution for all the solution that is in there in your GitHub.

[@JavaAidTutorials]

Sure, we are working on it. 👍

[@linuxtubers7313]

Thanks

[@JavaAidTutorials]

Welcome

[@ankitkumar-ql4yh]

hey i followed your video and did the same but still my half test cases are getting time out..i have commented my code in the discussion section in your comment thread ..please check it and tell me what im doing wrong

[@rogercute2002]

Why not "ecdfhi" is the answer?

[@TheAriaFans]

Subtitles pls i really need it.

[@LetszGoo]

What is the complexity of this

[@AnkitKumar5]

This is O(n^2) solution. Is there a better solution?

[@JavaAidTutorials]

The above explained solution is having O(N) complexity 😊.

[@sterl1789]

this solution is nlogn

[@JavaAidTutorials]

Hi Sterling Quinn, this is the catch here, it looks that its nlogn but it's not because sorting a string array will take O(nlogn) time but sorting a char array will take only O(n) time, you can apply counting sort for that.

[@sterl1789]

JAVAAID - Coding Interview Preparation oh cool that makes sense thank you!

[@JavaAidTutorials]

welcome. :) if you find this channel useful , please share with your friends.

[@jhonhernandez9210]

I couldn't understand much cause of tha english with indian accent

[@kingnani1557]

Explain the code more clearly .. you're explaining the code very fast

[@JavaAidTutorials]

Thanks for your feedback @KING NANI , will try the same. Keep leaning , keep sharing..!!😊

[@groot4957]

Thanks

[@Pr3kashSingh]

Thanks