Judge if a Sudoku solution is right.
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,904 software engineer interview questions shared by candidates
Find the balance point in an array. (The index where the sum of the elements to the left it is the same as the sum of the elements to the right of it.)
An array contains integers with the property that a particular number, called the majority element, appears more than 50% of the time. Give an algo to find this majority number
Find the minimum number required to insert into a word to make it a palindrome.
Given a string, return the first NON-repeating character that occurs in the string. EX: "adzbdcab" returns 'z'.
Convert a binary search tree to a sorted, circular, doubly-linked list, in place (using the tree nodes as the new list nodes).
given a string with parenthesis, eliminate the illegal parenthesis and return a legal string. for example: "(()" -> "()" ")))(" -> "" "()(()" -> "()()"
Given two sorted input arrays which contain a two element array of [key, value], write a function which multiplies the two arrays together and sums them where the "key" matches. Example: "v1 = [[1, 3], [2, 4], [99, 3]]; v2 = [[2,3],[5,9],[99,1]]" results in "15". I first brute forced it with O(n*m) then used two pointers which resulted in O(n+m) then he asked me to write it in O(n log m). I could not think of an algorithm at the time for O(n log m).
How would you multiply two strings: "123 * "45", without any casting.
Swap two digits from an integer, the result should be the maximum. For example 3580 -> 8350
Viewing 221 - 230 interview questions