Given n+1 buckets with n of them with ball inside and move(a,b) function, that moves ball from bucket a to bucket b. Each ball has a different number from [1,n] on it. Move balls, so each bucket has a ball with matching number in it.
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,282 softwareentwickler interview questions shared by candidates
Given 2 arrays sorted in ascending orders (a[n] and b[n*2]) with the second half of array a[] being empty, create a function that merges both arrays into a single sorted array.
Given two binary trees, return true if they have same elements (irrespective of tree structure)
Give a dictionary with a huge set of words and a string with wildcard. You are required to find whether there is a match in the dictionary for this given string.
Write a function to take a BST and a value k as input and have it print the kth smallest element in the BST.
Given an array as an input: [1,2,3,4,5] Return an array, which has a given index the product of all the other numbers in the array (except for the number at the given index), without using the divide operator: [120,60,40,30,24]
You have an analog clock with two hands, one for the hour and one for the minute. Given a time of the day, what is the angle between the two hands?
Write a program to count the number of words in a file.
Given an array of unsorted integers, determine which number appears most often.
Given two very large binary trees T1, with millions of nodes, and T2, with hun- dreds of nodes, create an algorithm to decide if T2 is a subtree of T1.
Viewing 651 - 660 interview questions