Skip to contentSkip to footer

Software Engineer Intern Interview Questions

Salaries
Interviews

9,339 software engineer intern interview questions shared by candidates

Given an eBay type service with multiple front-end applications, user information is being truncated when sent back to the user (Name was 'Andrew' but shows 'And'). Discuss your strategy on debugging this issue.
avatar

MSIT Software Development Engineer In Test Intern

Interviewed at Microsoft

4★
Jan 25, 2013

Given an eBay type service with multiple front-end applications, user information is being truncated when sent back to the user (Name was 'Andrew' but shows 'And'). Discuss your strategy on debugging this issue.

To see if a number is divisible by 3, you need to add up the digits of its decimal notation, and check if the sum is divisible by 3. To see if a number is divisible by 11, you need to split its decimal notation into pairs of digits (starting from the right end), add up corresponding numbers and check if the sum is divisible by 11. For any prime p (except for 2 and 5) there exists an integer r such that a similar divisibility test exists: to check if a number is divisible by p, you need to split its decimal notation into r-tuples of digits (starting from the right end), add up these r-tuples and check whether their sum is divisible by p. Given a prime int p, find the minimal r for which such divisibility test is valid and output it. The input consists of a single integer p - a prime between 3 and 999983, inclusive, not equal to 5.

Intern - Software Engineer

Interviewed at RemoteInterview.io

Apr 25, 2021

To see if a number is divisible by 3, you need to add up the digits of its decimal notation, and check if the sum is divisible by 3. To see if a number is divisible by 11, you need to split its decimal notation into pairs of digits (starting from the right end), add up corresponding numbers and check if the sum is divisible by 11. For any prime p (except for 2 and 5) there exists an integer r such that a similar divisibility test exists: to check if a number is divisible by p, you need to split its decimal notation into r-tuples of digits (starting from the right end), add up these r-tuples and check whether their sum is divisible by p. Given a prime int p, find the minimal r for which such divisibility test is valid and output it. The input consists of a single integer p - a prime between 3 and 999983, inclusive, not equal to 5.

Viewing 761 - 770 interview questions

Glassdoor has 9,339 interview questions and reports from Software engineer intern interviews. Prepare for your interview. Get hired. Love your job.