I have an upcoming interview at FB. The recruiter sent me a sample coding problem. Wondering if the question is standard template or level of sample problems change on type of position. Just trying to gauge the complexity of the problems at the interview. The position is not in the eng org but for a eng related position in another org if that matters. The problem for ref. Here’s a sample problem to get started. Sample Problem Write a function to return if two words are exactly “one edit” away, where an edit is: Inserting one character anywhere in the word (including at the beginning and end) Removing one character Replacing exactly one character
It's a problem from CTCI
It seems an easy leetcode
Answered above that it’s hard. That’s not the question though.
I’d say FB interview questions are generally of the same difficulty or harder. But of course, difficulty is subjective depending on the category of questions. Expect graph, tree, DP, backtracking, etc questions
Seems a bit too easy for FB
Got this once on a Google phone interview. I guess if you can solve it fast you will get a followup to generalize it to N edits.
That seems like a pretty typical Leetcode Medium to me—which in term is pretty typical for Facebook.
It’s actually hard on Leetcode
I would have totally guessed it to be a medium. I feel like Leetcode sometimes isn’t very consistent with their difficulty ratings and personally I feel like this is an example of that. There’s definitely some problem-solving here, but you don’t need any sort of special data structures or memoization.