Given two sorted arrays. Write a method that returns the intersection of the arrays. Ex. [2,4,3,6] and [8,9,2,4] would return [2,4].
Software Engineer Interview Questions
Software Engineer Interview Questions
I Software engineer scrivono i programmi per progettare e sviluppare software informatici. I colloqui sono prettamente tecnici, quindi preparati ad affrontare problemi di programmazione e rompicapi matematici. Le domande specifiche che ti saranno poste dipenderanno dal tipo di posizione che stai cercando nell'ambito della programmazione. Prova a fare le dovute ricerche su una disciplina software specifica, come lo sviluppo si siti web, di applicazioni o di sistemi.
Domande tipiche dei colloqui per Software engineer e come rispondere
Domanda 1: Come descriveresti il tuo processo di programmazione?
Domanda 2: Quali linguaggi di programmazione conosci e preferisci?
Domanda 3: Parlami di un progetto che hai portato a termine con successo.
418,956 software engineer interview questions shared by candidates
Write a function that takes the ordinal number of a column in a spreadsheet and returns the label of that column: i.e. 1 -> A 2 -> B, 26 -> Z, 27->AA
Write a function that computes the intersection of two arrays. The arrays are sorted. Then, what if one array is really larger than the other array?
you have an array of stock prices. i-th element in that array represents the stock price of that day. find the buy and sell dates to maximize profit.
Given a TV remote, write a script that would give directions to input some letters. Starting from the upper left-hand corner. If the buttons were in 3 columns, and you wanted to type "feed", you would want the output of the program to say "right, right, down, PRESS, left, PRESS, PRESS, left, PRESS"
Implement string rotateString(string input, int amt)
Using Collabedit, write a program to find the index of the first non-repeated character in a java string.
Nothing unexpected, I solved all the problems but I think I was too slow on the first one, which goes like: Given an array of numbers, they are arranged so that the a[0] is in the 1st bucket, a[1]a[2] are in the 2nd bucket, a[3]a[4]a[5] is in the 3rd bucket and so on. The question is then: given a number, you need to return if it is in any bucket or not.
Given a string with parenthesis like "()()(()(()()", check to see if there are matching pairs. If there are matching pairs, return true, else return false. For example, ()()() returns true, ()()()) returns false.
Suppose you have a matrix of numbers. How can you easily compute the sum of any rectangle (i.e. a range [row_start, row_end, col_start, col_end]) of those numbers? How would you code this?
Viewing 281 - 290 interview questions