Given two arrays which are sorted from min to max, return X smallest pairings based on the sum of the pairing A[i] + B[J]
Internship Software Interview Questions
24,864 internship software interview questions shared by candidates
What is the minimal number of coins you will need in order to reach a target. They give you the currency ex. [1,2,3,4,5,6] and the target ex. 28. you will need to return the number of minimal coins in order to reach the target.
Write a program to take inputs of word pairs, like box lunch, box car, car stereo, stereo sound, etc Start at a random index and output a list of pairs omitting previously used pairs.
The coding problem was around Leetcode level medium to hard.
My interests for work, Microsoft has a lot of jobs with different topics.
1. https://leetcode.com/problems/add-two-numbers/ 2. https://leetcode.com/problems/letter-combinations-of-a-phone-number/ 3. https://leetcode.com/problems/group-anagrams/
Given a graph find the number of connected components
they asked me to implement the add method for a binary tree followed by a problem to try to find it's brute force solution, the second interview was to implement an algorithm with 3 pointers to shrink a string by the number of repeated characters and override the original string with the answer.
How would you change all the phone numbers on a website?
Given an unsorted array guaranteed to only have the letter 'r', 'w', and 'b', sort the array in place.
Viewing 2801 - 2810 interview questions
See Interview Questions for Similar Jobs
Summer Internship Software EngineerInternship Software EngineerSoftware Engineer InternshipSummer Software Engineering InternshipSummer Software Engineering InternProgramming InternProgramming InternshipSoftware Development Engineer InternSoftware Development Engineer InternshipSoftware Engineer InternSoftware Development InternSoftware Engineer Summer InternshipSoftware Engineering Co OpSoftware Development InternshipSoftware InternComputer Science Co OpSoftware Developer InternGraduate Software Developer