Given n numbers (P1,P2,P3,.....Pn). Divide them in m contiguous partitions such that the sum of the maximum is minimum. For e.g. (5,1,4,2,3) and m =2 then (5,1)(4,2,3)
Softwareentwickler Praktikant Interview Questions
513,083 softwareentwickler praktikant interview questions shared by candidates
Given a string, find the longest substring T that contains m distinct characters. (need O(n) solution)
n= 20 for (i=0;i<n; i--) print i the question was to change or replace a only one character in for loop to print 20 times.
Given set of coins and each coin has its unique probability to be head up, say double[] probs stores the probability values for all coins, print out all different cases and accordingly probability.
1--a 2--b ... 26--z given a digit , return the count of the possible output eg. '1313' --- 4 acac mac mm acm '101' --1 ja cannot discard any digit .
Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"
Find all duplicate files by content in your filesystem.
The question was pretty basic and involved some data collection and analysis. I also needed to write the time complexity of my solution. In addition write several uni tests for the solution.
get the second most highest integer from an array
Rand(7) from Rand(5)
Viewing 301 - 310 interview questions
See Interview Questions for Similar Jobs
Softwareentwickler PraktikumPraktikant SoftwareentwicklerPraktikant Software-entwicklerEntwickler PraktikantPraktikum SoftwareentwicklerPraktikant SoftwareentwicklungSommerpraktikant SoftwareentwicklungWebentwickler PraktikantJava-entwickler PraktikantSpielentwickler PraktikantBerufseinsteiger Software-entwicklerSoftwareentwickler-praktikumSoftware PraktikantSommerpraktikant Software EntwicklungDiplom-software-entwicklerJunior SoftwareentwicklerProgrammierpraktikantIos Entwickler Praktikant