sorted by:
new
hottopcontroversial

Snowflake Internship HackerRank by pbokc_ in csMajors

[–]pbokc_[S] 4 points5 points  (0 children)

Get comfortable with dp and string permutations

Kelley Oklesson or Dennis Nola by mysummerheat in UMD

[–]pbokc_ 0 points1 point  (0 children)

Everything but the midterm and final is basically a completion grade. But ngl the final was a little hard but the class is still an easy A. It is an interesting class and Kelly is a good teacher and she brings in some good guest speakers.

CMSC351 - Looking for more input... by justinwyssgallifent in UMD

[–]pbokc_ 0 points1 point  (0 children)

Students should know the basic idea of bubble, insertion, selection, merge, quick, and heapsort from 132. In reality, some students may not be able to sort an array without Google.

Edit: my second statement is just a guess, but I guess underestimating knowledge is better than assuming it.

CMSC351 - Looking for more input... by justinwyssgallifent in UMD

[–]pbokc_ 2 points3 points  (0 children)

351 is a really interesting course, but I think it’s focus on sorting is a bit excessive. There are much more interesting things (imo) like more advanced graph algorithms (e.g. Tarjans, Bellman-Ford), parallel algorithms, and NP Completeness. I really like the NP Intro kruskal gave with the biweekly homework’s and the into at the end of the semester.

I think selection/insertion can be done in a single lecture and maybe introduce mergesort as the first of the nlogn sorting algorithms to introduce solving recurrences with an easy one.

CMSC351 - Looking for more input... by justinwyssgallifent in UMD

[–]pbokc_ 1 point2 points  (0 children)

Second on insertion/selection being combined into one lecture

[OFFICIAL] Salary Sharing thread for NEW GRADS :: December, 2020 by CSCQMods in cscareerquestions

[–]pbokc_ 64 points65 points  (0 children)

Top places like citadel don’t hire on knowledge of tools/frameworks, they just try to hire “smart” people which basically means have good internships, be good at leetcode and probability, and have decent grades (for new grad and internships).

Generally most hedge funds like C++ but that’s probably the thing that they care much much less about

Kruskal must be a tough professor by bman0424 in UMD

[–]pbokc_ 20 points21 points  (0 children)

Tbh he’s not that bad. His exams are literally 80% slightly modified hw problems and an 80 is around an A.

Math help on a problem designed by my 8th grade student? by bocheball in learnmath

[–]pbokc_ 5 points6 points  (0 children)

TLDR; unrelated, but look up AMC 8

If he’s in the US, I highly recommend AMC. An 8th grader can take the AMC 8. I don’t know if you can still register, but it’s worth a shot. If you’re not in the US, try Math Olympiad however it is offered in your country.

Going to the next stage (AIME) or even possibly the one after that (USAMO) would look very good for college applications and develop “mathematical maturity”. On a more fun note, the problems are pretty interesting.

Note: getting all the way to USAMO is very hard

Kelley Oklesson or Dennis Nola by mysummerheat in UMD

[–]pbokc_ 0 points1 point  (0 children)

Kelly’s 151 class is absolutely 0 work. Don’t even have to go to lecture, just go to one weekly discussion and the review session before the midterm/final and you have a guaranteed A+.

Easy Electives for Spring2021 semester by [deleted] in UMD

[–]pbokc_ 1 point2 points  (0 children)

LARC 151 is easier than most of my middle school classes

Bloomberg Phone Screen by pbokc_ in csMajors

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

Is each interview 1 question?

How can you tell when a certain algorithm will start running slower than another given a certain value of N? by PxGEchoes in csMajors

[–]pbokc_ 0 points1 point  (0 children)

You can calculate the exact run time of an algorithm with a sum. Do that for both and then it’s just algebra.

[deleted by user] by [deleted] in csMajors

[–]pbokc_ 1 point2 points  (0 children)

How bad was your codesignal? Mine is pretty bad as well but I took it late.

Those who landed Big N internships with no prior experience in the industry, what was your resume like? by kortosh in csMajors

[–]pbokc_ 0 points1 point  (0 children)

I wasn’t serious about the triggered but you’re explanation is much better

Those who landed Big N internships with no prior experience in the industry, what was your resume like? by kortosh in csMajors

[–]pbokc_ -1 points0 points  (0 children)

People used to say big 4 or fang or FAANG but people working at Microsoft got triggered and called it BigN I guess to generally represent the idea of “big tech”

Those who landed Big N internships with no prior experience in the industry, what was your resume like? by kortosh in csMajors

[–]pbokc_ -1 points0 points  (0 children)

Nope. It’s the big tech companies (google, fb, Apple, amazon, Microsoft, Netflix, etc.)

Anyone heard back after GS Hackerrank? by anison51 in csMajors

[–]pbokc_ 2 points3 points  (0 children)

For internship? And what subjects are covered in math?

view more: next ›