Giving back to the community.

I was reached out by Meta Recruiter over email. Took 2 weeks to prepare. Solved 50 questions asked by meta to others in this discussion forum. First one came from the one i solved in this prep.

Interviewer joined 10 mins late when i was just about to drop from the call.

Q1. 408. Valid Word Abbreviation
Solved - https://leetcode.com/problems/valid-word-abbreviation/description/
=:> solved with two pointer and a StringBuilder storing intermediate digtis to form number. Since the space complexity becomes in that case to be 0(N) ( intitially i answered incorrectly in hurry that space compexity is O(1)) , asked if it can be solved with constant space but not implement it. Thought and replied we can do with two pointer starting from end and calculating number when facing digits to skip using ( sum +sum*10^n) format . Interviwerer agreed and went to next question.

Q2. 938. Range Sum of BST - https://leetcode.com/problems/range-sum-of-bst/description/
( Directly went to an property that BST are sorted in inorder traversal but he stopped and asked me to do in recursive way)
Did it in recursive way . Asked for some improvemt ( basically skip the left travelsal if node.val high) .

Completed the interview just in time. Waiting for results.