The solution for the find duplicate number blew my mind away honestly, but I feel like the question was formulated from the answer itself and the specific constraints that need to exist for the solution the work
@yang5843 Жыл бұрын
If i ever see a hard Leetcode question in an interview, I'll walk out
@sanskartiwari2496 Жыл бұрын
Out of my last 4 interviews, 3 asked hard questions. The avg level is rising and more students are getting competent, atleast here in India. The questions I was asked are by the following names on leetcode Edit Distance : dp, Burst Balloons : dp MCM, Maximum Path Sum : Binary Trees
@sakilnathaniya423 Жыл бұрын
@sanskartiwari2496 was the interview for a jr dev or senior dev?
@prateek5668 Жыл бұрын
@@sanskartiwari2496😢😢
@sanskartiwari2496 Жыл бұрын
@@sakilnathaniya423 fresher graduate Associate SWE and SDE intern. Mid size startups.
@one_step_sideways Жыл бұрын
@@sanskartiwari2496 If you're in India, I feel sorry for you. The stats for the people studying programming that are actually fit for the job are very demotivating. It's become too hard to get a job in programming for the average Prakash. Cheating during an interview is also never ever ever an option.
@davidjones1310 Жыл бұрын
Burst balloons is a classic crackhead problem.
@arihantbedagkar7678 Жыл бұрын
It's an MCM pattern question in DP. If you solve MCM type questions, bust balloons is not that hard.
@mohitkanodia5388 Жыл бұрын
What is mcm pattern?
@XYZ-ow8lx Жыл бұрын
It is a combination of DP and div & conq ... it is a classic problem of its type probably you didnt come across this problem b4 that is why you felt hard
@stage666 Жыл бұрын
@@XYZ-ow8lxthey are all FK ING useless aside from passing the interview and getting into the rat race.
@shubhamjaiswal9505 Жыл бұрын
Feeling so Proud I solved Alien Dictionary by myself, I was on god stuff at that moment
@satyamjha68 Жыл бұрын
When I first studied KMP algo , I didn't understand it in first go. I had to watch it twice.
@mohabkhaled1391 Жыл бұрын
to further on KMP, where does the textbook and academic algorithms stand in this world - leetcode, interviews ..etc.
@CreamusG Жыл бұрын
If you need to know a bunch of academic algorithms for your job, you probably are long past the interview process lol
@GouravMoondra Жыл бұрын
the only one i have come across from this video is kmp algorithm , i have watched so many explanations and i still dont understand why it works so i just memorized the code which is not that difficult .
@junkman631 Жыл бұрын
Approach 5 in the editorial of Knight Dialer is pretty insane too.
@電腦騙徒剋星 Жыл бұрын
modelling dp as matrix problem is pretty standard in competitive programming
@zzzzzzzjsjyue2175 Жыл бұрын
knight dialer is not very hard tbh
@Ruby_Ai Жыл бұрын
Hi, first, my hardest so far sudoku validator, pretty basic problem, but I am only solved 30 of them.
@samarthjain5015 Жыл бұрын
That was the first medium problem that I solved.
@mct6902 Жыл бұрын
There was a meta question asking if a mouse can escape the room while a cat is catching. Both were at the same speed. The room has obstacles, and if the mouse can reach any 0 near the edge of the matrix before the cat can reach the mouse anytime before or at the same time, it means the mouse can escape. The follow-up was if there are "steroids" in the matrix if either the mouse or cat eats it will double its speed, can the mouse escape?
@alek4001 Жыл бұрын
Sounds like complex simulation problem. "864. Shortest Path to Get All Keys" is somewhat similar. I do not think it has "clever" solution or specific "named" algorithm.
@samarthjain5015 Жыл бұрын
Make an "Easiest Leetcode Hard problems". It's time for me to increase the number of hard problems solved.
@butoyighyslain1712 ай бұрын
word!
@ssuriset4 ай бұрын
Okay, find the duplicate number is one of those where you can’t do it on an interview if you haven’t seen it before.. like the tortoise and hare.. the Regex question was asked in my friend’s Amazon OA apparently and I wanted too solve it, and I still can’t.
@MBXD001 Жыл бұрын
Bro have you cracked the book introduction to algorithms ? by cormen
@greatestever2914 Жыл бұрын
i got stickers to spell words on my meta phone screen :')
@adityarao41576 ай бұрын
i think it might be verbal arithematic puzzle, literally i skipped it , (i have never skipped a problem atleast i understand then implement by resources but never skipped) it hits me different, but now i ll solve it after seeing this video
@adrified93527 ай бұрын
Median of two sorted arrays is easy with Python
@ihsannuruliman4005 Жыл бұрын
Burst Balloons and New 21 Game. I'm skipping those two because they're just out of my mind.
@ruthlessogre24416 ай бұрын
Burst balloons and median of two sorted arrays
@Ruby_Ai Жыл бұрын
I have a question whether it is possible to enter Faang without a degree (any degree) or not at all.
@ianokay Жыл бұрын
100%
@zzzzzzzjsjyue2175 Жыл бұрын
it technically is but most likely not worth trying because more likely than not you will fail. Most faang engineers are top students from top universities so that is your competition
@Ruby_Ai Жыл бұрын
@@zzzzzzzjsjyue2175 thanks for answer, but I am going to try anyway, it's not like I need to drop from my job to interview there)
@ramcharanrampage-im3mf7 ай бұрын
Please do Maximum Total Damage With Spell Casting
@dinzonnyuoe Жыл бұрын
Cat and mouse prpnlem is super hard😂
@dehsaW Жыл бұрын
qiqi impact mention pog
@stoppls170910 ай бұрын
🗿
@vikassinghbisht7305 Жыл бұрын
kmp is very easy
@fastlaner77464 ай бұрын
Surprised not to see 2sum
@Sudhanvapops Жыл бұрын
hey bro can you plss solve geeks for geeks practise problems too