Isn't that a common criticism of every interview style? Whether it's whiteboard questions, take-home projects, soft skill questions, lots of people will lie and say they've never seen the question before.
At this point, you would be foolish to admit that you’ve seen a question before. Everyone is faking it, and if you be honest, you’ll just keep getting harder and harder questions from the interviewer. The only time you should not fake it is if you’ve been asked that question at the same company. I think they would keep track of that and if you didn’t mention it, they would look deceitful on your part if they catch you.
> you’ll just keep getting harder and harder questions from the interviewer.
Well, there is a counter strategy that works even in this situation.
The counter strategy would be to just know way more interview questions than the interviewer, and know the answer to every question that they have, so that they run out!
When I was full time applying for jobs, a couple years ago, it got to the point with me. It turns out that people interviewing others, only have a couple questions that they use for interviews, and it is not that hard to know all of them.
It's worth learning anyway, even just to help one's family videos not be so damned boring and amateurish.
Not everything has to be directly related to employment. It's nice to know how to cook a meal, even if you have absolutely no ambition to work in a restaurant.
If we're being very charitable I guess the idea of using a HashMap for an optimal solution might slip your mind but even a freshman in CS can just loop twice over an array and solve it.
I might be misunderstanding the question; how many pairs can there be? You can't just loop over the array twice to find all qualifying pairs of indices, if there are multiple. You'd have to loop over the array n times, where n is the size of the array. Isn't that why the question is difficult? There doesn't seem to be much incentive to using a hash table, complexity wise, if you could just solve it in O(n) time and O(1) space by naively iterating over the array.
He meant "write two loops" when he said "loop twice". It seemed obvious to me that he meant that but I can see how if you're used to more unambiguous language it could be confusing.
Yeah, you just do it in O(n²) worst case because the problem is O(n²) to find all pairs that match because there can be O(n²) pairs.
However he meant one pair here too. Pretty easy to solve. Did it in under 30 s in Python on my broken cellphone. If there are multiple pairs, just replace return with yield.
I want to grind Leetcode and tackle FAANG interviews. Working at companies like Microsoft and Google looks very fun and the pay obviously goes without saying.
I would agree with your criticisms of most of those companies as not being suitable for large companies, but I would argue Salesforce is definitely an option for large companies. I see job postings for Salesforce developers from companies like Google and Facebook all the time, and personally every company I've worked at as a Salesforce developer has been a Fortune 500 company.
