How would you implement a sparse array (key could be any integer, but only a few would be used) with limited memory.
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,337 softwareentwickler interview questions shared by candidates
Extract the N largest floating point numbers from a large file of floating point numbers.
Given an array of integers, all but one of which appears an even number of times, find the one integer which appears an odd number of times. Upon completion, asked to improve the algorithm in terms of both time and space, eventually asked to do it in O(n) time and constant space.
2. You have an array (size is not known) and whose elements are having the values from 0-> 99. Find out the three largest elements in that array and return those.
Find the numbers in an array that appear an odd number of times.
Given the word "HEAD" and the word "TAIL," write code and/or describe using computer science algorithms how you would transform from the word HEAD to the word TAIL. Each change must be by only one letter, you cannot change the letter in a given position twice, and each new word must be a valid word.
Given an integer array which consists of numbers from 1 to N with 1 number missing find the missing number. What will you do if 2 numbers are missing?
Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.
Implement a Queue using 2 Stacks
Given a list of transactions, How can we calculate the frequency counts of all possible item-sets? For example, Input: ID Purchased Items 1 apple, banana, lemon 2 banana, berry, lemon, orange 3 banana, berry, lemon Output: Itemset Frequency apple, banana 1 apple, lemon 1 banana, berry 2 banana, lemon 3 ... apple, banana, lemon 1 banana, berry, lemon 2 ... banana, berry, lemon, orange 1
Viewing 971 - 980 interview questions