Find the positive integer smaller than a given number S that has the maximum possible sum of digits. Should return this number as a string, ensuring that it contains only digits and has no leading zeros. If multiple numbers yield the same maximum digit sum, any valid result can be returned. The solution must be efficient, as S can have up to 100,000 digits.
You are given an array A of N positive integers. The task is to determine how many unique products can be obtained by removing exactly one element from the array and computing the product of the remaining elements.
Design a chat application. Fix the bugs in existing code.
stored procedures
Related to test and asked about projects done.
A senior staff member asked me a lot of questions about java's garbage collection process.
The hardest question for me would be when I was asked about something I failed at and why it happened. It is difficult to show your weak side in an interview without worrying that it would put you in a bad light. But I just tried to emphasize how I fixed things and what I learned from it.
Tell me more about you? Why do you want to join FM ? What do you like or dislike about C++ and Python? Tell me about a time when you had a challenging project and how did you manage to resolve it?
What is your background/experience in this profession? What do you think you would like about working for this company?
Nothing too difficult or unexpected in any part of the interview process
Viewing 971 - 980 interview questions