Mark likes to listen to music while travelling. His iPod™ contains N songs and he wants to listen to L (not necessarily different) songs during a trip. So he creates a playlist such that: • Every song is played at least once. • A song can be played again only if at least K other songs have been played Mark wants to know how many different playlists are possible. Can you help Mark determine this number? As the number can be very large, display number modulo 1,000,000,007. You are given N, K and L.
Software Engineer 2 Interview Questions
664,898 software engineer 2 interview questions shared by candidates
If you have a file containing millions of integers, how would you sort the data in the file using extremely limited resources, such a s 1GB of memory?
What are your greatest technical strengths?
What are the implications of covid-19
Given an input string and a target string, find the minimum substring of the input string that contains all of the characters in the target string
What excited you about working in the company?
First round was online test which contains 75 aptitude,reasoning and english questions and 5 programs you have to execute either in c++ or java.Online test is conducted by deselect.this pattern is similar to the amcat pattern.
Recently I attended the interview at Google and I was asked "You are given a sorted list of disjoint intervals and an interval, e.g. [(1, 5), (10, 15), (20, 25)] and (12, 27). Your task is to merge them into a sorted list of disjoint intervals: [(1, 5), (10, 27)]."
one question was as under - "Symmetric Difference of Arrays" Input: two arrays of integers Output: one array of integers which occur in only one (not both) arrays Test case: Input: [ 1, 7, 8, 2, 4, 5 ] [ 3, 5, 1, 7, 6, 9 ] Output: [ 8, 2, 4, 3, 6, 9 ]
How to check if a number is divisible by 16 without using operator / or % ?
Viewing 221 - 230 interview questions