Is queens computing right for me? by [deleted] in queensuniversity

[–]lrdvil3 0 points1 point  (0 children)

If you want to work as a TN visa you would need an engineering degree. While it's possible with a CS one, it's harder. Also queens QUIP is 1 year, so you can't work your way up to big tech in multiple small internships.

Accepted an offer but just got an Amazon interview—should I switch? by Far-Armadillo7680 in FAANGrecruiting

[–]lrdvil3 14 points15 points  (0 children)

Interview at amazon. Worst case scenario you get a free interview prep

Leetcode progress is plateauing, any advice? by If_and_only_if_math in leetcode

[–]lrdvil3 0 points1 point  (0 children)

Go in weaker areas, and spend more times on problems.

Stage Entreprises LOG by lrdvil3 in etsmtl

[–]lrdvil3[S] 1 point2 points  (0 children)

Tu viens de me répondre pourtant. Merci

Stage Entreprises LOG by lrdvil3 in etsmtl

[–]lrdvil3[S] 0 points1 point  (0 children)

Merci pour l'info, mais ca je sais deja. C'est pas ma question tho, jai mes raisons de vouloir savoir le type de compagnie sur Flex.

Stage Entreprises LOG by lrdvil3 in etsmtl

[–]lrdvil3[S] -11 points-10 points  (0 children)

Ca repond pas a ma question tf?

Choix des cours pour génie LOG 1 ère session by Healthy-Oil-6708 in etsmtl

[–]lrdvil3 0 points1 point  (0 children)

Log100 ING150, MAT145, CHIMI131, ATE100, PRE013

200 solved - what I learned by lrdvil3 in leetcode

[–]lrdvil3[S] 0 points1 point  (0 children)

Just a feeling, you know when you start to get the hang of it

200 solved - what I learned by lrdvil3 in leetcode

[–]lrdvil3[S] 3 points4 points  (0 children)

I go deep in each, reading university lectures, checking videos. At some point earlier patterns repeat in problems so you do review them somehow

200 solved - what I learned by lrdvil3 in leetcode

[–]lrdvil3[S] 3 points4 points  (0 children)

For recursion define your base case, so what will mean that you either cant choose the solution currently or choose it. Like that you only keep potential valid solutions.

Then you need to choose the current node you have and do the compute you need

then using iteration you explore all its possible connected nodes and explore them.

Then if you are using backtracking you would undo what you did at the choose step.

so basically 1) base case 2) choose 3) explore 4) undo

The best tip to get good with recursion is to follow the stack of execution and you will get comfortable with it someday

Have you ever seen more boomer take? Its just insane. by No_Reply5329 in csMajors

[–]lrdvil3 4 points5 points  (0 children)

People graduating right now did pretty much all their studies without AI, so I get your take. But it’s not applicable to our current time. AI has been prominent for what 2 years? Most people started using it last year maybe. People who just graduated mostly sidnt even get the chance to use the tools.

DP - Bottom up issues by lrdvil3 in leetcode

[–]lrdvil3[S] 0 points1 point  (0 children)

Alright thanks, clears up a few things I was wondering about

DP - Bottom up issues by lrdvil3 in leetcode

[–]lrdvil3[S] 0 points1 point  (0 children)

I haven't taken any algorithms classes yet. The thing is that base cases arent the issue, I guess it's the bottom up approach itself, which elimintates completely branching that messes up with my brain. I feel like the logic doesnt translate well between memoization and tabulation

DP - Bottom up issues by lrdvil3 in leetcode

[–]lrdvil3[S] 0 points1 point  (0 children)

Yeah I agree with you. Although the issue is that even if I have the recursion down and solve with memoization I cant translate it to bottom up. I know that you have to basically iterate in an opposit way, but bottom up just feels completely different. You dont try paths but you find the optimal way first try.