Видео

16:20 that's why you use a seperate computer

Thanks for the analysis! Could you help me with something unrelated: My OKX wallet holds some USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). What's the best way to send them to Binance?

Interesting. I Like It!

How do you not get in any trouble by publishing these videos?

I solved the shirt problem using JS and without creating a tree function lowestCost(redCosts, greenCosts, blueCosts){ function getColorCostForDay(color, day){ if(color === "r"){ return redCosts[day]; } if(color === "g"){ return greenCosts[day]; } if(color === "b"){ return blueCosts[day]; } } const days = redCosts.length; // NOTE: pre-computed to avoid calculating it on every iteration const oppositeColorsByColor = { "r": ["g", "b"], "g": ["r", "b"], "b": ["r", "g"] } // NOTE: initialize queue with the 3 possible first nodes to be visited const queue = [ { color: "r", cost: redCosts[0], p: [], total: 0, }, { color: "g", cost: greenCosts[0], p: [], total: 0, }, { color: "b", cost: blueCosts[0], p: [], total: 0, } ]; let smallestCost = Infinity; let smallestPath; while(queue.length > 0) { const node = queue.shift(); const computedPath = [...node.p, node.color]; const computedTotal = node.total + node.cost; // NOTE: when in the last level (day), start computing the smallest path if(computedPath.length === days){ if(computedTotal < smallestCost){ smallestCost = computedTotal; smallestPath = computedPath; } } // NOTE: while not in the last level (day), queue visits else { const oppositeColors = oppositeColorsByColor[node.color]; oppositeColors.forEach((color) => { queue.push({ color, cost: getColorCostForDay(color, computedPath.length), p: computedPath, total: computedTotal, }); }); } } return smallestPath; } function main(){ const redCosts = [4,6,4]; const greenCosts = [3,5,7]; const blueCosts = [1,1,1]; console.log(lowestCost(redCosts, greenCosts, blueCosts)); } main();

Great work!

For the closest temp question I came up with; var closest = temperaturesArray .Select(n => (Temperature: n, AbsoluteValue: Math.Abs(n))) .GroupBy(x => x.AbsoluteValue) .OrderBy(x => x.Key) .First() .Max(x => x.Temperature);

Your problem-solving skills are amazing! Many people think that being a good programmer means never asking for help or looking things up, but you're proof that real programming is about finding solutions however you can. Haha, shoutout to you-great videos! :]

Ahhhh had me for a while there. I get it this got to be a parody of all those serious test interview videos out there…right?? If not, brother I hope you quit the drugs and complete your rehabilitation journey. Probably didn’t help that I just commented to help you earn more money…

Did you stay sober today?

I like those challenges, but where can I get a link to those tests ?

"This is.. this is goind to fire me later" :D

Easiest sql query ever

This is surprisingly easy, I was expecting the stuff you see on google competitions 😂

this gave me confidence to try applying to some stuff sometime, ppl make it seem like the questions they ask are impossible

pretty insane these challenges are unpaid. huge waste of time if you get rejected

That second bullet on the SQL task is an absolute clusterfuck

I took a screenshot of the instruction page, used an online OCR, pasted the text into ChatGPT and manually input the Chat code into the Tesla code editor.

This looks like something from highschool wut

Dude doesn’t even know DATEDIFF lol. Warra scrub 😂😂😂

love it

did you get the job?

Interesting. My challenge was determining which folder to put my rejection email in.

i opened this expecting it to be near impossible.. but looked at it and was like.. o.o

for number 2: cant we just get the smallest absolute value within the array and then check if that value is in the original array? if it is then return that number if not return a negative version of that number ?

did you get the job

This is the easiest way to get banned by the company, good luck - I would ban you instantly from being hired as you usually sign some kind of nda by launching the tests. That is also a test - if you cannot keep company secrets... you're bad hire.

1:39 bro your history. every day is a new day man! Much love

where do u find that jobs? when I send it in linkedin some company says that im outside of their country :/

Привет Great video, especially the back story >1:45 Today I'll be sober >4:35 Cut off the girl from the photo, left only yourself

Gotta make it easy as to not discriminate Pajeet

Keep the great work! I was wandering if you used DP in Q2 as I can see that the code is a simple backtrack without DP!

Never understood the point of this type of questions but to each his own I guess. I always give more realistic tasks on interviews.

bro you just solved one of their biggest bugs in their system. 😂

Both programing problems are sort of classic dynamic programming with a little twist. Good questions.

You should have been rejected and reported just because you shared the challenge online

my goat

One day, I hope to be as good as you are.

For #1 you could use a heap, and since it is only 3 elements we could maintain 3 heaps. Each iteration we pop off each heap, O(3logn), if the minimum is the same as the previous day out of what we popped from the 3 heaps compare the other 2 elements popped and choose the minimum. Add back to the respective heaps whatever element we didn't choose. The complexity would be O(nlogn)!

i didn't watch the whole thing, but it's funny how the 2nd tutorial question can be solved with a single line in python: closest_to_zero = min(numbers, key=lambda x: (abs(x), -x)) if numbers else 0 Also, with the SQL queries... AI is actually exceedingly good with creating SQL queries if you give it the exact parameters you need... surprised those type of questions still exist because of AI.

Can please do more of these technical interview type videos!?

public int MinValue(List<int> values) { if (values == null || values.Count == 0) return 0; var minValue = values.Min(Math.Abs); return values.Contains(minValue) ? minValue : -minValue; }

Ok the Last question or it was the First question was very simple if you just went through the loop and each time you find the minimum of the three you make the next element in that array as INT_MAX so everytime you would consider the minimum from the other two for the next day and just repeat it till the end.

I wouldn’t contribute anything to Elon musk

how did you apply? Where do they post their positions?

thats nice but stop pasting

12 mins for the SQL question? Damn.

Might be a bit of an off-topic, but I noticed you're often halted without thinking. Many of those halts are caused by the lack of your mouse accuracy in addition to your slow type speed. They seem to delay you a lot. I think once you improve that, find a good mouse and dpi settings and perhaps revisit your key typing manners, you will have a lot more time to relax during coding. We call it "Idle strain", idle time that costs energy while being unproductive.

That's it? I could probably do all of it and I am just in high school

Nowadays passing the cv screening is already kinda difficult. It would be interesting to see how you structured your cv!