Status: Experienced 6 years
Position: SSE in a service based company.
Location: India
Date: October, 2020

Interview Process :
1. Very short discussion with recruiter about my current role and experience and QnA( 1 word answer) on complexity of very basic algos( mere formality)
2. First Technical interview on coderpad and video ( 2 Questions, 45 minutes )

• Question 1 : You're given a string S. Can you make it a palindrome by removing at most 1 character?
  Example : tacocats --> True # tacocatS --> tacocat , abcd --> False
• Question 2 : You're given N pieces of wood with lengths L[i].
  You can cut them into smaller pieces.
  You need to get K pieces of the same length.
  What is the maximum length possible?
  M - max length of a single piece
  Example:

1. L = [5, 9, 7], k = 3. Max length = 5
   [5, 5+4, 5+2]
2. L = [5, 9, 7], k = 4
   [4+1, 4+4+1, 4+3], max_length = 4
3. L = [5, 9, 7], k =1. Max length (answer) = 9

Answered the first question with some help from the interviewer. I was stuck at the second question and interviewer guided me to come to a solution of O(n LogM). But by that time there was no time left for coding.
It was my very first interview experience with faang. One thing I found really good is the way the interviewer guides you in case you are stuck at some point.
I wish I weren't this nervous this time which is partly why I wasn't able to think through to come up with solution during the interview but it was a good experience.