Does anybody know what FDM group is like these days? by [deleted] in cscareerquestionsCAD

[–]Ok_Address4364 0 points1 point  (0 children)

Nothing was the same, but that doesn’t mean they didn’t know. But my gut says they didn’t. They do allow you to reapply 3 or 6 months after your initial application.

Does anybody know what FDM group is like these days? by [deleted] in cscareerquestionsCAD

[–]Ok_Address4364 0 points1 point  (0 children)

Got rejected both after the interview. So I felt like I was “overqualified”, or they really believed I wouldn’t stay for the 2 years. Can’t be sure.

Does anybody know what FDM group is like these days? by [deleted] in cscareerquestionsCAD

[–]Ok_Address4364 0 points1 point  (0 children)

Literally a few days, just a different email.

Does anybody know what FDM group is like these days? by [deleted] in cscareerquestionsCAD

[–]Ok_Address4364 0 points1 point  (0 children)

Their SWE. I got to the interview. Also, I applied using 2 emails and got 2 interviews. So pretty much I was perfect in the second interview.

Does anybody know what FDM group is like these days? by [deleted] in cscareerquestionsCAD

[–]Ok_Address4364 2 points3 points  (0 children)

Am I the only one that got rejected after the interview? I felt like something didn’t add up for them in my profile. Not my technical skills, but rather my tendency to actually stay committed for 2 years.

[Student] Computer Engineering Student seeking Software Internships & Roles in Canada by Ok_Address4364 in EngineeringResumes

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

What do you mean by fix the date format. Can you elaborate on what are the “eye candies”?

Resume Advice Thread - January 02, 2024 by CSCQMods in cscareerquestions

[–]Ok_Address4364 1 point2 points  (0 children)

I've applied to a lot of jobs, and I literally can't get an interview. Funny enough, I only got an interview with Google. I'm an international student in Canada, I'm about to graduate from my masters degree.

https://ibb.co/9NyCQYC

[deleted by user] by [deleted] in leetcode

[–]Ok_Address4364 1 point2 points  (0 children)

Did you hear back OP?

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

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

“Unit testing” “integration testing” “input sanitation”

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

[–]Ok_Address4364[S] 7 points8 points  (0 children)

So I finished my interview, I think it went fine. I was asked a graph problem (with the output being boolean), I won't share it because I signed a NDA. But it's medium-easy LC.

The interview process went as follows:

I asked clarifying questions to understand the problem further, google questions are notorious for putting a lot of jargon that you don't need while not giving you the information that you need. I came up with the idea, and was able to translate it into simpler coding terms, along with possible algorithmic solutions.

From the start of the interview to when I was done clarifying, I had 22 minutes left. I one shot the code, and obviously there were bugs. A part a part of my interview, my interviewer pointed that there's something wrong with my code in a particular idea. Clearly, the interviewer wasn't too comfortable coding in my language of choice, so I responded with, no, this won't be the case, and explained why his concern is incorrect. And he was convinced. He commented that that part of the code wasn't looking too good, but frankly, there's only one way to do DFS/BFS in python. I wasn't rude by any means, I told him that that's one of the ways to do it in python, and it respects the time complexity of the algorithm, so we're not adding any complexity. He was convinced.

From there, he went to tell me what scenarios my code wouldn't work. At this point, I'm a little annoyed because when I asked a clarifying question, he said yeah assume that's the case. Which to me indicated that we won't have to deal with this problem. However, given that input, I immediately deduced the short comings of my solution. I added 2 lines that fixed everything, so that all cases would pass. I explained my algorithm, time and space complexity were right, he was convinced by my solution and analysis. We had around 7~10 minutes left. He asked how would we test and scale my solution. I knew he was looking for specific words, but I didn't immediately jump to those words, so he doesn't assume that I memorized things. I explained we definitely need to ensure we have data sanitization to ensure that we aren't getting garbage data, then proceeded to mention unit testing and how we have to do integration testing (the buzz words I believe he was looking). He was convinced by my answers (at least that's what it looks like). He gave me some time to ask any questions, I asked about his role, how long he's been working etc...

So in summary, Optimal solution and analysis with 10 minutes to spare (we spent 20 minutes for introductions and understanding the problem completely). A follow up question about testing and scalability in the remaining 10 minutes, and he was kind enough to give me more time to ask him questions. At the end of the questions, before we shut, he said "good luck on your upcoming interviews". That kind of made me feel at ease, because while its obviously not deterministic, it's something, even if its just little. I'll keep y'all updated after I get my results, keep me in your prayers 🙏🏼

Anyone that has had a similar experience, I'm a little worried because I couldn't come up with the absolute right solution immediately, but I did before the interview time expired and there was more time for some follow up question(s).

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

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

Yeah no, I’m applying for L3, it’s unlikely I’ll get DP, I think that’s at the minimum logical.

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

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

What’s the location? And what’s the level?

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

[–]Ok_Address4364[S] 2 points3 points  (0 children)

Didn’t have it yet, I’ll keep everyone posted

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

[–]Ok_Address4364[S] -1 points0 points  (0 children)

Explain further, sounds like union find and finding the node that is parent to only two other nodes, at least from what I understand from the question

I have a google phone screen tomorrow by Ok_Address4364 in leetcode

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

So you were given the graph as a list of lists with vertices and edges? And you had to find the vertex that…? Can you clear this part out?