Question Description: Write a function that, given a list of integers (both positive and negative) returns the sum of the contiguous subsequence with maximum sum. Thus, given the sequence (1, 2, -4, 1, 3, -2, 3, -1) it should return 5.
Software Interview Questions
747,533 software interview questions shared by candidates
You have 2 identical plates which break when thrown higher than a specific number of stories. You are in a 100 story building. What is the least number of tries you must do to determine the story number after which the plates are broken when thrown off the building?
Write a program that given 4 coin denominations and a dollar amount finds the best way to express that amount using the coins given. I.e. you have coins with denominations of 1c, 7c, 13c,19c and you have to express $2.12 with the least number of coins. There is always a 1c coin but the other 3 are arbitrary.
why are you choosing our company?
Behavioral Why outreach The impact you hope to have from your next role?What is most important factor in your career/job What do you think about RSpec? How do you compare it with other frameworks What was the hardest/Challenging technical problem you faced and how did you resolve it Coding This problem concerns finding a time when we can do daily recurring maintenance on a server. You are to write a function that is given the following information: List of times when the server is busy every day Duration, in minutes, of the desired maintenance window The function should return the start time of a daily maintenance window when the server is not busy. In pseudo-code, the function signature would look something like this: maintWindowStart(busyTimes, durationMins) -> startTime The "busy times" should be time ranges like the following, and can be represented in whatever data structure you feel is appropriate. 0:05 to 0:30 = [5, 30] 2:00 to 4:01 = [120, 241] 13:10 to 16:55 = [790, 1015] [[5, 30], [120, 541], [790, 1015]] // requested duration -> expected start time // 10 -> 30 // 120 -> 541 // 4 -> 0 // 300 -> 1015
write an algorithm to divide two numbers using only loops and addition.
Check whether the string is symmetric, how to test your result
Implement a base 3 adder which takes two strings as input and returns a string
The implementation question: Find a max and min in an array simaltaneously. I used a 2n comparisons approach and a 1.5n on-average approach.
Remove a node from a singly linkedlist without knowing the head node. All you have is the node itself.
Viewing 441 - 450 interview questions
See Interview Questions for Similar Jobs
Manual TesterChannel Sales ManagerTest AnalystMajor Account ExecutiveTechnical Support AssociateQa ManagerSenior SalesConfiguration ManagerErp Implementation ConsultantAccount Executive Mid MarketProgrammer AnalystEntry Level Digital Signal Processing EngineerEngineer DeveloperEntry EngineerFull Stack EngineerIos DeveloperEntry DeveloperIt HeadJava Developer