Rand(7) from Rand(5)
Software Engineer Senior Interview Questions
64,283 software engineer senior interview questions shared by candidates
Write a function that divides one number by another, without using the division operator, and make it better than O(n).
code a function that takes 2 parameters and an algorithm, print out all the numbers between the 2 parameters that completes the algorithm
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
Implement a base 3 adder which takes two strings as input and returns a string
Search a max value in an unsorted array. (Very abstract question) in better than O(n).
Search a sorted array for the first element larger than k
Write the function that calculates price of the cup of coffee where price of the condiments depends on size of the coffee cup. For example milk cost 10 c for small cup 15 c for medium and 20 c for large
1. Give you a data structure Seq class Sqe { int value; Seq nex; } and give you two Seq object seq., seq., compare two objects, return true if there is only one difference or no difference, false if more than two differences. 2. Giving a array which has zero and no-zero elements, move all zero elements to the end and no-zero elements to the begin.
Given an array of integers A[1...n], compute the array B[1...n] such that B[k] is the product of all the elements of A, except A[k]. Part ii) Try to do it without division (some mobile devices don't have division). Was asked to write code for part ii.
Viewing 21 - 30 interview questions