I think interview went average...
DSA q asked were :
1. .find the longest non-empty prefix which is also a suffix.
Example: s = "level"
Output: "l"
Example: s = โaabcdaabcโ
Output: โaabcโ
2. 2. Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
Note: You must not use any built-in BigInteger library or convert the inputs to integer directly.
Example 1:
Input: num1 = "2", num2 = "3"
Output: "6"
Example 2:
Input: num1 = "123", num2 = "456"
Output: "56088"
I fumbled with second question... I was not allowed to use methods or convert string to int directly...
FInding individual multiplication for each digit of second number with 1st number - manual multiplication is way. But How would you preserve a white space as done manually...
Idk
Passed 1st round...
Next round is Coding round.
face to face interview at Hyderabad...
But I already know i won't get selected... as even if i pass 2nd round last round is design round... and i don't have much knowledge on system design...
but for experience it's ok ... will give it a try