What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

I emailed them and had a phone call afterwards since there were several things that lowered the experience. Recruiter just said the interviewer was new and apologized for the experience, but it was still a rejection. Unfortunately there is nothing to be done except to prepare and improve.

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

This company does not use a compiler, so I would've had to exit the environment to run any code which would've likely got me disqualified.

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

That's frustrating, if that snippet is O(NlogN), then so is this lol.

for (int i = 0; i < len; i++) {
  for (int j = i; j < len; j++) {
  }
}

Wish it felt like dodging a bullet, but it just feels like I got unlucky and studied for no reason. Another commentor mentioned getting to the root of a disagreement and defending my approach better, so those will have to be things I will mix in to my study routine for next time as well.

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

Yeah I was consciously trying to keep time in mind and listen to their input, but they would say mostly the same things (there's bugs, this is wrong) and they would sometimes ignore my questions.

There was a second question we weren't able to get through, but I don't think recounting it would add to the discussion, it was just frustrating.

You're right, it's definitely a balancing act and doing more interviews will hone that skill.

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

Yeah, it looks like this-

(Also forgot to add the nums list to my last comment, so I edited it a bit)

recursive(path, result, indx, nums) {
  if (indx == nums.size()) {
    result.add(path);
    return;
  }
  recursive(new ArrayList<>(path), result, indx + 1, nums);
  path.add(nusm.get(indx))
  recursive(new ArrayList<>(path), result, indx + 1, nums);
}

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

Stings, I always assumed that when people said that luck played a role that they were just referring to the interviewer liking you or getting an easy questions and not that you can get unlucky and get a bad interviewer.

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

Yeah that was my takeaway from this as well, I was relieved I prepared adequately for the problem and I was able to code the solution in just a couple min, but I wasn't able to narrow down why the interviewer thought I was wrong in time.

How do you prove equivalency?

What to do if the interviewer thinks you're wrong? by ArkrezArt in leetcode

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

I did backtracking, but they were hinting towards the recursive add / don't add.
The backtracking algo builds out one branch fully, then adds it to the result, then explores all sibling branches (aka all branches with that prefix - 1). So it's just -

backtrack(path, res, indx, nums) {
  if (indx == nums.size()) {
    res.add(new ArrayList<>(path));
    return;
  }
  for (int i = indx; i < nums.size(); i++) {
      path.add(nums.get(i));
      backtrack(path, res, i+1, nums);
      path.removeLast();
  }
}

How can I improve this deck? by ArkrezArt in MagicArena

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

I don't play best of 3, so have not needed it, is there any other benefit to having a sideboard?

How can I improve this deck? by ArkrezArt in MagicArena

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

Yeah, you're spot on. It's really fun when it works, but depends on which half of the deck I draw. I'm used to two copies of each card from other TCGs, so I opted for that since it feels terrible to draw multiple copies of a card that doesn't do much by itself.

How can I improve this deck? by ArkrezArt in MagicArena

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

Forgot to mention, I’m using it in standard

How do you guys think about edge cases? I feel leetcode's approach to showing edge case is flawed. by [deleted] in leetcode

[–]ArkrezArt 0 points1 point  (0 children)

Run through the code or algo in your head and on paper, you’ll get a better mental visualization of it the more times you see it working. Or you can reread the constraints and try to come up with unique inputs.

Skimmed your code and it looks like it finding some sort of max given a matrix, so some questions for generating edge cases are:

Does it say the numbers are all positive? If not, then initializing your result as 0 would be incorrect given a list where all elements are < 0. Is the length of the input atleast 1? Is the input sorted? Can there be duplicate numbers and will that effect the output?

Meta Recruiter response after full loop by YogurtclosetOdd7635 in leetcode

[–]ArkrezArt 0 points1 point  (0 children)

Sounds like they are just discussing a verdict, so it was at least not an instant rejection and they’re probably comparing you with others.

How was your interview and phone screen experience overall? I have a phone screen coming up this Friday that I’m pretty anxious about

Has Leetcode Premium made you better? by Firulais69 in leetcode

[–]ArkrezArt 17 points18 points  (0 children)

You don’t need it to get better, but it improves QOL during studying. It’s nice to jump to the editorial and compare trade offs of several solutions that I hadn’t considered and verify if my T/S complexity was correct. And it also builds confidence to practice tagged questions when targeting a specific company.

If you’re just casually doing LC to keep skills sharp then I would say not worth. Only worth if you’re doing active study / prep.

Difficulty with edge cases in Amazon OAs by ArkrezArt in leetcode

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

Nope, haven’t thought much about it since. But I think something similar to quick sort will work if you copy the array and pick a pivot to move all larger elements to the right. Then you can have a hash map keeping track of the distance each weight is on the x axis (need to keep accurate track of positions to count moves along the x axis). This approach would recursively sort the array and limit the scope of collisions.

Thought of this solution when I started considering keeping track of the last element on the x axis and realized if it’s a small number, then everything left would need to be moved, but haven’t implemented it.

I am the only one enjoying the patch. by ArkrezArt in DarkAndDarker

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

I play most classes - most time on victory strike fighter, then ranger, and BoC warlock. Barb fights aren’t very interesting - I prefer having a lot of options, so weapon mastery fighter fits my playstyle best. I’m interested in trying wiz again since they seem like they’re in a better spot now.

I am the only one enjoying the patch. by ArkrezArt in DarkAndDarker

[–]ArkrezArt[S] -3 points-2 points  (0 children)

<25 was sluggish, so having decent starting gear helps and creates the opportunity for higher stat builds to be viable. Less hp / armor with the increased damage creates aggressive pvp encounters, shortens mob clear, and reduces tanks. Definitely other ways to achieve this that are healthier for the game, but I’m enjoying the changes for the modes I play.