Print a binary tree level by level
Softwareentwickler Backend Interview Questions
512,316 softwareentwickler backend interview questions shared by candidates
How do you find the kth smallest number in a binary search tree.
Regular expression and strStr. I was not able to give KMP algorithm to strStr
Except experience related questions I was asked coding question and I was supposed to write the solution to the problem in any programming language in a simple web-based code editor. The question was: given and array of positive integers and another integer find whether there is a consecutive range in the array, so that the sum of integers in the range is equal to the given number. They put an emphasis on delivering working, efficient solution. In my opinion this kind of interview requires a thorough preparation.
Given an array a contains all digits 0-9 a = [1, 4, 2, 1] # which represents 1421 Add one to the number and return the array return a = [1, 4, 2, 2] # which represents 1422
Write a function to multiply two arbitrarily large integers.
Tell me about yourself?
Given a string, remove all chars from the string that are present in say another string called filter.
Given an integer, if the number is prime, return 1. Otherwise return its smallest divisor greater than 1. e.g. if n = 24, its divisors are [1, 2, 3, 4, 6, 8, 12, 24]. The smallest divisor greater than 1 is 2.
List of n number with k numbers missing. How do you identify the missing numbers? What is the run time?
Viewing 711 - 720 interview questions
See Interview Questions for Similar Jobs
SoftwareentwicklerJunior SoftwareentwicklerSoftwareentwickler NetzentwicklerSoftwareentwickler ISenior Software EntwicklerSoftwareentwickler SoftwareentwicklerSr. softwareentwicklerApi-entwicklerBackend-entwicklerSoftware-entwickler CoLinux-entwicklerSoftware-anwendungs-entwicklerDiplom-software-entwicklerJunior Java-entwickler Software-ingenieurLeitender System-software-ingenieurAtg EntwicklerBerufseinsteiger Embedded Software-entwicklerComputer Software Entwickler