If you were a gerbil, which gerbil would you be?
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
The Game of Nim worded diffently.
Create a stack of numbers where the maximum number is always known.
Same as above but another one is taken out again. Find the two missing nubmers
out of 25 horses select the fastest three in minimum number of races where in each race there would be exactly five horses.
Traverse nodes in a binary tree
In a stream of integers from 1 to n, only one number will be repeated. How can you tell what that number is?
An abstract question about ways to simulate behavior of workers who move stools around a workspace in some controlled way, and what the expected results would be.
Given two (dictionary) words as Strings, determine if they are isomorphic. Two words are called isomorphic if the letters in one word can be remapped to get the second word. Remapping a letter means replacing all occurrences of it with another letter while the ordering of the letters remains unchanged. No two letters may map to the same letter, but a letter may map to itself. Example: Given "foo", "app"; returns true we can map 'f' -> 'a' and 'o' -> 'p' Given "bar", "foo"; returns false we can't map both 'a' and 'r' to 'o' Given "turtle", "tletur"; returns true we can map 't' -> 't', 'u' -> 'l', 'r' -> 'e', 'l' -> 'u', 'e' -'r' Given "ab", "ca"; returns true we can map 'a' -> 'c', 'b'
1. Count the number of positive integers less than N that does not contains digit 4. 2. Design a data structure that can do the followings in O(1) time: (1) insert (2) remove (3) getRandom
Viewing 101 - 110 interview questions