find if 2 strings are anagrams
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,738 softwareentwickler interview questions shared by candidates
Identify pairs of integers in an array which sum to a specified x.
How to detect loops in a linked list without using a data structure
Write out merge sort and apply it to two arrays of integers.
Find largest element in array without using any extra variables or any functions
Given a matrix of integers, start from any column of the first row. can only move diagonally left, diagonally right and down. find the max sum possible. This is a DP problem.
Given a string that has various brackets (e.g. “{“, “(“, “[“, “}”, “)”, “]”) built into it, how would one tell that the string has a balanced number of brackets and in order?
Given any number of arrays containing numbers, write a function which finds the numbers that appear in exactly two arrays. arrays = [ [6, 2, 2, 0, 4], [5, 0, 2, 6, 7, 1], [6, 7, 9, 9], ] find_in_two(arrays) should return [2, 0, 7]
input log = [ { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 5}, { 'user': 'A', 'page': 2}, { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 2}, { 'user': 'C', 'page': 7}, { 'user': 'C', 'page': 3}, { 'user': 'A', 'page': 3}, { 'user': 'C', 'page': 1}, ] please implement discover_site_map(log) discover_site_map returns a representation of the links between pages, using whatever data structure you think is suitable: 1 -> 2, 3 2 -> 1 3 -> 1 5 -> 2 7 -> 3
You have 10 boxes of balls (each ball weighing exactly10 gm) with one box with defective balls (each one of the defective balls weigh 9 gm). You are given an electronic weighing machine and only one chance at it. How will find out which box has the defective balls?
Viewing 661 - 670 interview questions