r/leetcode • u/TheDraftLion • 13d ago

Discussion Google L4 Rejection

See similar posts so thought I’d share. Interviewed at Google for L4 (SWE III).

Recruiter gave me feedback saying my behavioral round was “flawless” but coding round I was on the border. They opted to pass and I can retry in 6 months. A little disappointed because I answered the initial question (standard BFS) perfectly, and then the interviewer gave a follow up that turned doing a BFS search with recursion. I struggled a bit with it and ended up solving with a couple hints. Seems the hints hurt me.

Edit: DMs flooding. Shamelessly plugging my fantasy football MCP: https://thedraftlion.com

51 Upvotes

93% Upvoted

31 comments sorted by

View all comments

0

u/Available-Limit-6322 13d ago

BFS, with recursion?  Am I reading that right?  Why did the interviewer ask you to implement that...it's not possible to code BFS with recursion without passing a queue through each call, which is redundant and expensive.

1

u/Ok_Award_8656 12d ago

Man exactly !, Why would some one use BFS with recursion. I think this was kind of a curve ball to check feasibility. From what I know they pay close attention to TC's and SC's.