Find the Missing Number in an Array | Implementation | Coding Interview Question

[@shubhamagarwal1434]

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over UA-cam with java implementation and found this. Hats Off To You Man....Excellent Work. GOD BLESS YOU :)

[@itsdineshvaryani]

Thanks !!!

[@suseelkumarannamraju]

Thank you for the algorithms and data structures series so far sir. It really helped me a lot from 0 knowledge to something which i m now and able to think through the solutions a bit. Hope u will upload more videos and help students like me for building our paths

[@itsdineshvaryani]

Yes i will !!!

[@anupambasak4223]

I found a way but not sure about it's time complexity...
public int findMissingNumber()
{
Scanner sc=new Scanner(System.in);

TreeSet set=new TreeSet();

for(int i=1;i

[@arijitmohapatra147]

Congratulations for 22k subscribers🔥u'll see one day this channel will get millions of subscribers n views keep doing the good work sir🎉love from the core of the 💓🙏

[@itsdineshvaryani]

Thanks !!!

[@bablumehta4679]

Woo super sir ...very good explanation I enjoyed lot by studying from your channel .....I requested u to pls upload subarray sort topic sir 🙏🙏🙏🙏

[@itsdineshvaryani]

Thanks !!! I request you to please share it with ur friends and colleagues as well !!!

[@ajayrajpoot6315]

nice explanation

[@itsdineshvaryani]

Thanks

[@prasadkadu9737]

Thanks

[@itsdineshvaryani]

Welcome

[@AbdurahmonMirobidov]

I liked your each video

[@itsdineshvaryani]

Thanks for the support !!!

[@anupambasak4223]

What if the ques is from any number to N... and the array is arr[]= {13,11,15,14};... Then what will be the approach? I've done using Arrays.sort(arr) but it takes O(nlogn) time... What will be the approach for O(n) time?

[@ashutoshgupta752]

int cannot be derefenced wala error aaraha hai yaar

[@AbdurahmonMirobidov]

Break a leg ✊