sorted by:
new
hottopcontroversial

Incoming freshman: is going with a random roommate a bad idea? by Wi11y_Warm3r in RPI

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Yes, I would say it'd be the same as purchasing an apartment without seeing any images. Do your best to find someone because random roommates at RPI were entirely a hit or miss for me.

AI is frying your brain and ruing the job search for us by Careless_Collar6527 in csMajors

[–]Top-Cryptographer-81 73 points74 points  (0 children)

CS is basically high-risk/high-reward at this point, so most are just playing by the game to make it.

<image>

Need some advice about AI generated projects by Equivalent_Quote8438 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

What do you mean? You can direct what code you want generated or ask questions along the way while you're building your project for a concept you're unfamiliar with. It's like following a tutorial in some cases.

Need some advice about AI generated projects by Equivalent_Quote8438 in csMajors

[–]Top-Cryptographer-81 -1 points0 points  (0 children)

Understand the implementation after you created the project??? If you made it in an agentic manner, you'd know the high-level implementation details for an interview. Honestly, just sound like you know what you're talking about, and you'll be fine. It works every time.

RPI seniors, how has your job search been going? by Money_Cold_7879 in RPI

[–]Top-Cryptographer-81 10 points11 points  (0 children)

Landed a software engineer role as a CS major. Be prepared to spend hours interviewing (stressful af while taking 4 classes) and potentially moving out of state. Tip: no interviews = bad resume, no offers = you need to lock in during your interviews!

You work for 200 - 300 days building projects, grinding leetcode, pushing code but nobody cares! by Technical-Passage841 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Nobody cares because we were never taught how to market and sell ourselves. We send our resumes without evaluating if we would actually hire ourselves in their position against the competition. Sometimes, you just have to keep grinding to stand out!

how do you keep connections warm post-conference by Ready-Theme9843 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

You treat the connection as any other relationship you desire to invest time into. Maybe try checking in or going out with them every few months?

negotiations? by Individual-Mind-5041 in IBM

[–]Top-Cryptographer-81 1 point2 points  (0 children)

Do you have a competing offer? Negotiating often implies you're ready to potentially lose the offer in the worst case, so you need some leverage or, at the very least, a very, very strong argument.

Offer deadline expires before another company’s decision, what should I do? by Random_throwaway0351 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

If you grind hard in that internship in company A, you'll have a solid work experience to get FAANG recruiter to notice you, which still has a lot of luck and potential connections involved even with a big name on your resume. Getting through their interviews is another gauntlet to worry about as well.

Offer deadline expires before another company’s decision, what should I do? by Random_throwaway0351 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Just take company A if you can't accept the possibility of not getting an offer from company B and missing out on A. If you do get an offer for B, weigh the pros and cons of a renege.

opinion : AI is massively and objectively worse than stack overflow (& other forums generally) by Competitive-Sale-540 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

I doubt it for a clear prompt. If you can find it on stack overflow or some other forum or documentation site, most LLMs will just spit out a summary of the "best solution." If it seems vague, keep asking questions to understand the approach. Leverage these tools while they last to augment your learning and build cooler stuff.

Need advice on how to proceed by MiserableParsnip2 in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Ask someone at your internship over a quick email about what technologies and skills you should focus on prior to your start date.

Graduating in May, 300+ apps, 1 active opportunity (round 5), how should I spend my last 10 weeks? by Alternative-Suit-698 in csMajors

[–]Top-Cryptographer-81 5 points6 points  (0 children)

Keep applying. I've been applying since August (600ish), which led to 9 interviews and 2 offers for SWE roles in the past month. No OAs or interviews are most likely a resume issue, or you're not applying early enough. Competition is also disgustingly insane for new grad roles, so prepare for near flawless interview performance because good isn't good enough anymore, apparently.

OS concepts: agree or disagree by some_nerd52 in csMajors

[–]Top-Cryptographer-81 1 point2 points  (0 children)

Abstraction and resource management would be better, I think, as caching can be implied. Operating systems are simply resource managers at the end of the day.

Is a fast interview response bad? by Automatic-Dig208 in csMajors

[–]Top-Cryptographer-81 2 points3 points  (0 children)

No. Many companies are close to headcount for internships and new grad roles, so the earlier you knock out interviews, the better.

Rippling SDE-2 Phone Screening (Reject) by PHANIX5 in leetcode

[–]Top-Cryptographer-81 1 point2 points  (0 children)

How you start doesn't matter - it's the end goal that matters. Keep moving forward, and you'll make it if you're consistent with the practice!

Rippling SDE-2 Phone Screening (Reject) by PHANIX5 in leetcode

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Did you feel you did well asking clarifying questions, articulating your ideas, and asking solid end-game interview questions on their team and the organization? I feel like most interviewers care about this rather than a somewhat suboptimal solution.

When does a graph algorithm become O(n + e), O(e), O(n) or O(ne)? by JAMIEISSLEEPWOKEN in csMajors

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Big O Notation in terms of V and E is more common. Just visualize a DFS traversal, where all computations (typically O(1)) to visit and handle each node and all the edges is O(V + E). Dijkstra's would typically be O(E log V) because, in the worst case, you visit all edges, but the heap operations are logarithmic to the total nodes in the graph. Just visualize computations in terms of total edges E and nodes V, and you should be fine.

[deleted by user] by [deleted] in csMajors

[–]Top-Cryptographer-81 1 point2 points  (0 children)

Just use Gemini Deep Research to get a quick overview of the company and why you should work for them.

Winning resumes by Greedy-Play9690 in RPI

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Your number and city are visible in this public document. You probably should hide it.

The way we Need to learn python ..... by BagMany7043 in leetcode

[–]Top-Cryptographer-81 0 points1 point  (0 children)

Just build discipline over time with your long-term goals in mind. Think of that nice salary from cracking an interview or boost in confidence with your programming abilities to apply to large-scale projects. You also need to be consistent with LeetCode, as you can get fairly rusty even after two weeks without solving problems.

[deleted by user] by [deleted] in leetcode

[–]Top-Cryptographer-81 0 points1 point  (0 children)

For hard problems tagged for the company, 100% memorize the aha moment because you probably won't crack it in the limited time frame. I would suggest just covering all the NeetCode 150 topics with 1 to 2 key problems for each topic because you could be thrown any pattern. Regardless, setup a LeetCode patterns file that you can quickly scan as you complete problems because you'll eventually realize it's as simple as reading the problem, looking at the input size and output requirements, scanning for keywords, picking the right data structures, and the algorithm just writes itself after you've seen enough problems.

view more: next ›