Intern Software Interview Questions

17,764 intern software interview questions shared by candidates

Design a deck class. Given a fully implemented deck class, design a shuffling algorithm. Find the arithmetic mean of a binary tree. Follow-up to mean question: why can't you just design a function that recursively calculates the mean as it recurses the tree?
avatar

Software Engineering Intern I

Interviewed at National Instruments

3.7
Nov 18, 2015

Design a deck class. Given a fully implemented deck class, design a shuffling algorithm. Find the arithmetic mean of a binary tree. Follow-up to mean question: why can't you just design a function that recursively calculates the mean as it recurses the tree?

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 1371 - 1380 interview questions

Glassdoor has 17,764 interview questions and reports from Intern software interviews. Prepare for your interview. Get hired. Love your job.