Challenging World's Most Selective University with Coding Question!

Подписаться 1,1 млн

Просмотров 330 тыс.

50% 1

Challenging Stanford Students to code in 5 mins with a problem asked in IIT & MIT exams!!
Edited by Chaitanya khachane
📈 Get 2 FREE Stocks in US (valued up to $1400): a.webull.com/i/SinghinUSA
I use WeBull & RobinHood for stock trading which are legal.
My Study Abroad channel: / @harnoorsinghofficial
iPhone Vlogging Gear:-
📱iPhone 14:
amzn.to/3Mqn3AL(India)
amzn.to/3VkIKq9(US)
📸Sony Camera:
amzn.to/3EAjKFx
🎥360 Camera:
amzn.to/35QU0jg (India)
amzn.to/2MfDp1q (US)
Tripod:
amzn.to/3EAk1be
🎙Vlogging & Podcast Mic (I use different cable for iPhone & Camera):
amzn.to/2OzeeZ3 (India)
amzn.to/2Y02IJo (USA)
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Follow me on -
Instagram - / iharnoor
Twitter - / iharnoorsingh
For Doubts Related to Undergrad: / 1234179803434320
Discord Server: / discord
E-mail for BUSINESS INQUIRY & HELP- hello@singhinusa.com
MUSIC CREDITS:
Music From (Free Trial): www.epidemicsound.com/referra...

Опубликовано:

28 окт 2022

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 253

@Swmdwn.Khakhlary Год назад

honestly, I really enjoy such content harnoor, please continue doing such type of vids. I really appreciate your effort man

@aanifshabir1554 Год назад

14:03 best part 😂

@shachisinghal8856 Год назад

Keep posting such videos. They are very inspiring.

@goodhuman1 Год назад

All of these videos are so good, especially at Stanford and with the Meta guy!!

@tebooo_n Год назад

Please make more videos like this 🥹 really enjoy watching them. Very insightful

@hitman_zw590 Год назад

um with u

@atmangautham7078 Год назад

I’m loving this series of asking questions to top College students❤

@starboy001 Год назад

The way SHE told that why she was able to solve the 'leetcode' questions, shows us the harsh reality of being poor. Kudos woman.👍🏿👍🏿

@joelmarkjmj Год назад

We want this type of content More and More and Most

@theprofessor8844 Год назад

Good to see people appreciating difficulty at IITs ....

@rohanIVY Год назад

Tho tu kyu khush ho raha

@abhijeetsingh4824 Год назад

@@rohanIVY INKO IIT ME NAUKRI LAGA HAI. JANITOR KA

@akashpaul4143 Год назад

@@rohanIVY dikhai nahi deta woh professor hai !!🙂🥲

@theprofessor8844 Год назад

@@rohanIVY Because I was at one point involved in studying for these institutes. I understand how hard it is to get in.

@hippityhoppity3964 Год назад

@@akashpaul4143 Bhai phir toh muje kal paaka asli Willi smith ne comments meh gaali di

@raghavchhabra5951 Год назад

Everytime I watch his video, I start doing leetcode for a week and then stop. 😂

@rohanIVY Год назад

Relatable😂

@boy0607boy Год назад

@@rohanIVYhow do you decide on the list of problems?

@redhair1401 Год назад

@@boy0607boy no. Of likes on the problem

@dokyungsoo8623 Год назад

Me tooo

@dark_techyy 3 месяца назад

Let me take your mock interview if you are still alive!😊😂

@mohitchoudhary3668 Год назад

Honestly i enjoy the series It's great to know the foreign students how they study in college and what apporch they think 💬. And sir one request is there , can you make a video for Bca students . How they can start to do coding and after doing bca they should do masters for multinational companies . And for multinational companies only coding is important or any more thing we have to study. Because we are learning basic things of coding . And one more thing i am noob in coding so how can i start coding can you explain in video or reply here . And for coding you can prefer any book .

@noorarahiman8429 8 месяцев назад

Same

@Asherstitusworld Год назад

Super video Bro Nice Intro

@raghavgujjar Год назад

The O(1) solution is limited by the address space of the registers in the CPU and ALU. So for very large powers of two, like above 2^64 it may not be as efficient. Depends on how many bits the registers can store. Disclaimer: This is just thought aloud. Might need more verification.

@ujjwaldhyani5063 Год назад

yeah but the input itself is stored in int/long format so this solution would work

@shukanyahazarika1789 Год назад

int range 2^31-1

@mohitmishra3091 Год назад

bhai indians hi indians dikh rahe sab jagh..hahah..its like u r in dilli sarijini nagar..so happy seeing indian roots at all places !!

@mrd6840 Год назад

I need this kind of videos more ...

@HungryWTF Год назад

bro that string question is cake walk level 😂

@rahuliitbhu3111 Год назад

good job , keep it up.

@mrd6840 Год назад

Hey bro I need more videos like mit students solving iit question paper and iit students as same as mit question paper. Need from you

@ItxLittleHappiness 12 дней назад

6:54 if a number can be written as a power of 2 then it means that it is divisible by 2 ...so I think so we can do it by simply testing as we test an even number 🥇 or not ??

@Rahul62635 Год назад

Stanford Universities not all students r as briliant as iitians As 40-50% goes to iit due to their social activities in international level

@jaycen1856 Год назад

This is just a pure understanding of how binary operations work…. Nothing too technical on algorithm.

@masudahmed5196 Год назад

Wow awesome 👌 Appreciating for Last girl 👧

@vision_lc Год назад

He never stop to motivate people 🥺

@sankalpvats4658 Год назад

Amazing content❣️❣️I also wanna be like you

@AbhishekSingh0216 Год назад

Their names were Sanjay,Sahil & saurav and they were not from India🙃.even foreigners give Indians name to their children.

@sxmeersharma Год назад

They are from Indian origin not Indian their parents are probably 2nd Gen Immigrants

@mrkiba1781 Год назад

@@sxmeersharma Sahil from Bangladesh

@sxmeersharma Год назад

@@mrkiba1781 it’s a common name in both countries he could be even Pakistani

@arnavD007 Год назад

I guess they are OCI's

@mrkiba1781 Год назад

@@sxmeersharma he is my relative, don't claim anyone Indian origin

@MLRTrytonix13 Год назад

For the second problem I'm actually surprised the first guy didn't have a clue of the most efficient way. I'm a CS Junior and one of my first class last semester was about assembly. It helped me so much with the understanding of problems like these.

@eduardocod8924 Год назад

Yeah but after 3 months you’ll forget it 😂

@indrashispowali Год назад

Maja e aa gaya vlog dekh ke toh

@furiousbro4685 Год назад

This students are quite intellegent .

@neon-astronaut Год назад

Bhai won Stanford hai Wahan to honge hi

@THE_GFI 10 месяцев назад

This is good content bro but please post the selected question or any question to solve for the viewers ✌

@Piggynmoo Год назад

My son is doing CS from UTS in sydney and Its my dream to see him get his masters from MIT.

@kirtisahani3412 Год назад

I really enjoy it 😀😀🙃.

@aritano491 8 месяцев назад

For the power of 2 one you can just do log(number)/log(2) and if its an int then you know the number has a base of 2. However, I may have also misunderstood the question lol.

@forunsecurewebsite156 Год назад

Question: im bad at math but i want walk in technology path, should i learn math first or codding(Frontend) but i havent decide what i want to focus with is it website or the other.

@themanofgod8770 11 месяцев назад

I suggest sticking to your passion, if you love technology then pursue that, allow everything else to follow suit. I shall give you an example, a strategy game like Yu-Gi-Oh requires a lot of reading, however reading is not a necessity, if one has a passion in Yu-Gi-Oh, they simply need to play the game, memorising the cards they need to know, eventually memorising what words relate to what meaning, after decades of playing Yu-Gi-Oh, do you not think he would have grasped basic reading, enough to play Yu-Gi-Oh effectively? Analogous to you grasping maths, enough to be effective in the path of tech

@pradyumnasharmakattel129 Год назад

harnoor? please tell me,, are you on your OPT right now or what? in what status are you there right now? you had got F1 again in dropbox from delhi,, so you are doing masters?

@draviki Год назад

i like your content Harnoor. Keep visiting the college

@swarupbehera6806 Год назад

x=int(input(enter the no;)) y=x/2 if y==x//2 : print("is a power of 2") maybe the second question cqn be solved like this

@Sanyu-Tumusiime Год назад

why bother doing that? just use bitwise to solve it public static void main(String[] args){ int x = [INPUT]; int ct = 0; while(x > 0){ if(x & 1 == 1){ ct ++; x >>= 1; } if(ct == 1) System.out.println("is a power of 2"); else System.otu.println("not a power of 2"); } very easy

@swarupbehera6806 Год назад

@@Sanyu-Tumusiime that seems more hard though 😅😅🤣🤣

@v.varsha4633 Год назад

Hey yours will be wrong as for ex of we take 12 it will return 6 and 12//2 also returns 6 even though they are same we know that 12 is not a power of 2

@Sanyu-Tumusiime Год назад

@@v.varsha4633 you're right. it will be wrong. use my solution

@swarupbehera6806 Год назад

@@v.varsha4633 you are absolutely correct ma'am and i agree as now I can see I am purely wrong there btw I started to learn programming 3 months ago so no hardships 😁 Let's see what this world has to offer for me 😌

@thankyou_guruji Год назад

Aryender is doing such an amazing job as Harnoor's new partner! Also giving away 100 or 50 USD to these students who can afford leetcode premium doesn't makes much sense! Why don't you give your Indian subscribers a question who can't afford leetcode premium?

@vishalraghav8982 Год назад

For 2 to the power n, can’t we just take base 2 log of the number. If we get an integer back. Then it’s true else it’s false. That would also be constant time. Assuming log2 function has constant time.

@spiderop2125 Год назад

Where can you get that log function from ? Not every lang is python.

@prabhattiwari007 Год назад

@@spiderop2125 exactly...That is what I was thinking

@yunik_developer Год назад

Yeah it can be possible in Java and CPP both they have log functions

@manfromwuhan714 Год назад

They’re basically asking them to code the log function from scratch. In the most efficient way possible

@rahbs26 Год назад

GREAT HARNOOR BRO

@diganta7 9 месяцев назад

Can I know which programming language are they using?

@muditkhanna8164 Год назад

the solution you just gave for was very creative for checking the power of the two , but after that the more simple answer would've been just checking the LSB of that binary number

@lokendrasingh841 Год назад

brother i want to know more about cs engineering so please can you give idea of a good plate-form for coding.

@jasdeepsinghgrover2470 Год назад

BTW all these solutions are actually correct... The full adder circuit is itself O(number of bits) so subtracting 1 takes O(number of bits which is same as number of digits)

@ziedbrahmi4812 Год назад

mm not really , it's more efficient because it's a native thing for the processor.

@jasdeepsinghgrover2470 Год назад

@@ziedbrahmi4812 but it is still under the assumption that number fits in the circuits

@udproductions5855 Год назад

Mai bba ka student hu pr Mai ek code developer bna cahta hu to kya Mai bn skta hu agr bnta hu to bhi kya mujhe achi job milegi jaise ki btech walo ko milte hai

@shauryakansal1081 Год назад

thanks for everything!

@venkateshkumar9289 Год назад

This would work right ? base_number = 2 power_of = int(input("Enter the power of number: ")) user_calculated_output = int(input("Enter the number to check if the required result is True/ False: ")) multiply_power = base_number ** power_of if multiply_power == user_calculated_output: print("True") else: print("False")

@tripcreator87 10 месяцев назад

Admission in IIT is much tougher than MIT, People like you who not able to clear JEE moved to US/UK for further degree course.

@dakshbhatnagar Год назад

I thought MIT < Stanford. Anyways bro you got to get a dedicated mic since the device is picking up sounds of the background as well

@mugiwara_ Год назад

lmao why , MIT is #1

@shayanali7558 Год назад

I would have gone for; int a ; if (2 modulus a == 2) {cout

@goodguy128 Год назад

No...

@shahbazkhalilli8593 Год назад

please share the result such as valid answers of all questions at the end

@no-eh4sz Год назад

MIT admissions process pa ek video banaow bahi

@liontalha7383 11 месяцев назад

And me thinking the optimal solution for power of 2 => (ceil(log2(n)) == floor(log2(n)))

@avocadorable18 Год назад

Video seems to be lagging. Anyways harnoor great content.

@harshvardhannaik1959 Год назад

Bro my brain 🧠 is hanged after watching match . Any mathematic solution for this?

@thelegend5633 Год назад

Please make video on MIT VS STANFORD

@mugiwara_ Год назад

just stupid idea bro

@ahmadcheema8389 Год назад

bhai jan. Full stack web developer kha be scope ha canada ma plz reply

@kislayanegi1742 Год назад

Ayender is genius!!!!

@user-pf7ch6ys9r 3 месяца назад

i am from pakistan i don`t no what an diffecult level(mean at logically level not craming ) iit take off the test but an incridble change in india education really appricated ....

@IMINTONIRVANA Год назад

Ivy league kids are literally out of this world

@rohanIVY Год назад

Facts

@ankurpathak5964 Год назад

kuch samjah nehi aya but sunke achaa lagaa :)

@rashmikadk6796 Год назад

Can you share the links of sources of these problems please 🙏

@ansh_rp Год назад

IIT--jalba h hamara 🤣

@Ayan-who Год назад

I have seen that purple t-shirt guy with glasses in one of your other video

@shubhanshukumarsingh6133 Год назад

14:00 "IIT" be like Raula hai hamra , kabhi kabhi to lgta hai apun hicch bhagwan hai.

@mugiwara_ Год назад

Still not in top 50 in global list where as MIT and Staford are in top 3

@bigtummy8533 Год назад

Can you meet Manu Chauhan? You interviewed him?

@lostgoat Год назад

8:00 return n & (n-1) == 0

@__T-T__ Год назад

8:45 here's my solution, Please tell me is this a good solution (I am just a beginer) counter = 0 a = int(input("enter any no.")) b=a while True: if b%2==0: counter += 1 b = b/2 else: break if (2**counter)==a: print("True") else: print("False")

@quandledingleiv6082 Год назад

Idk

@chickenstrangler3826 Год назад

@@quandledingleiv6082 why comment "idk"

@aman_singh__ Год назад

its TC is still o(log n) its not the most optimal solution the & operation solution is O(1) so that is the most optimal solution

@quandledingleiv6082 Год назад

@@chickenstrangler3826 my choice

@chickenstrangler3826 Год назад

@@quandledingleiv6082 Stupid choice.

@pritikahanda7709 Год назад

i learnt whole of this binary system in grade 10th and after joining coaching institute it all went to vein due to extreme pressure of examsss

@jasminevora852 Год назад

Jalwa hai .

@pratikdharanep.d.8938 Год назад

BCA student here ❤️

@sandeep8203 Год назад

Bhai isse software kaise banta hai 😭😭😭

@ANNGUYEN-cw7lw Год назад

You can visit mission college to contest code in 5 minutes

@Lol-qy1dy Год назад

Multiple of 2 question soo easy...

@prodabber0222 Год назад

imagine how selectvie stanford would be if it was in washington

@ankurrajbangshi7133 Год назад

What is Lewis Hamilton doing in Stanford??🤔

@arnavfx6466 Год назад

Good vid

@sahilnandal1643 Год назад

Can you also show the complete solution of questions???

@yusuf_cars Год назад

where can I get those IIT exams pdf am studying computer science.

@mugiwara_ Год назад

from students at iit

@ankitrawat-acodebreaker Год назад

shouldnt N & (N-1) be O(log2N) and not O(1)

@yahyaashraf5511 Год назад

Please visit LAC too

@anshul2000punk Год назад

Man I just saw this video to make me realize how dumb I am.

@sanjaygatne1424 Год назад

why not popcount(x)==1 to find pow of two.

@ankitclass10th62 Год назад

Is everyone knows about iit in stanford

@ShivamMishra-zm3hh Год назад

Wedding begins 😃😃 next year

@sunny---24 Год назад

you go to USA and find Indians there

@abhisheksingh402 Год назад

In my college out of 100 almost 99 can't solve these problems. Here almost every one have knowledge

@fredericnoa-jy2ui 5 месяцев назад

For powers of 2 Idk bool is_power_of_two(int number) { return number > 0 && (number & (number - 1)) == 0; } Could someone check please 10:31 10:32 10:35

@randym1788 Год назад

What is not clear in the question is if the result is to be in binary format or decimal. 1100 or 12?

@parthankolikar5864 Год назад

bruh these questions are so easy

@anantpandey4985 Год назад

Bro go for campus tour also

@avinashgupta4038 Год назад

Lagta hai bhai ko bhi startup karne ka hai.

@devanshsolani2711 Год назад

No longer Meta Engineers😣😣

@redhair1401 Год назад

Both were super easy 😉

@luismuller6505 Год назад

I Agree

@andiuptown1711 Год назад

They literally said it’s easy questions

@dark_techyy 3 месяца назад

I have a question for all of you. Q1. Given the root of a binary tree where every node contains a natural number, return the maximum path sum from node to leaf.