Online coding interview: Given an array of integers. Find the largest increasing sub sequence of integers in the array. // 10, 3, 7, 9, 0, 15 // return index 1&3
Softwareentwickler Interview Questions
Softwareentwickler Interview Questions
Softwareentwickler sind besonders gefragt und diese Rolle kann auch sehr gute Verdienstmöglichkeiten und hohe Arbeitszufriedenheit bieten. Bei einem Vorstellungsgespräch für Softwareentwickler werden Ihnen wahrscheinlich Fragen zu Ihren Hard und Soft Skills sowie zum effizienten Projektmanagement gestellt.
Typische Bewerbungsfragen als Softwareentwickler (m/w/d) und wie Sie diese beantworten
Frage 1: Welche Art von Softwareentwicklung betreiben Sie derzeit?
Frage 2: Beschreiben Sie ein Entwicklungsproblem, das Sie hatten, und wie Sie es behoben haben.
Frage 3: Wie gehen Sie mit dem QA-Prozess um?
512,192 softwareentwickler interview questions shared by candidates
Since this was a testing interview and not full out development he had some testing terms I had never heard of these include: Equivalence Class Testing Pair Wise Combinatorial Testing Failure Mode Analysis the only one I heard of was: White Box vs Black Box testing The coding portion was not difficult the question was this Write a function that takes two lists of strings and return a list of Strings with all of the intersections of the strings ex: List1 = {"a","a","a", "b", "d"} List2 = {"a", "a", "c", "d"} expectedReturn={"a","a","d"} Also he asked what tests cases I would use to validate the function also he wanted to know the run time analysis of the function
i) Given a value v, in a BST find the next value in order.
Given a (potentially large) array of integers, all but one repeating an even number of times, how would you find the one repeating an odd number of times in an efficient way? eg [1 2 3 3 2 2 1 4 2] should return 4
Find k largest/smallest number in a series of numbers. What data-structures will you use? Code it on white board.
Write a method which return how many palindromes are in a word. Eg: barbarabar has 7 (b,a,r,barab,a,r)
What a fibonacci function which return N th position number both in recursive and loop, also give the explanation on both implementation on their time efficiency.
If you had 100 floors and 2 eggs, what is the most efficient way to determine what floor is the maximum height you can drop an egg and not crack it?
* Merge two sorted linked list. The merged list should also be sorted. * Compact a string. i.e remove spaces * traverse a link list containing char* as data. test cases for the same. * reverse a string. test cases for the same. * remove all the given characters from a string.
The infamous "clock hands" question--how many times do the hour and minute hands of a clock overlap in a 24 hour period?
Viewing 471 - 480 interview questions