Sollicitatievragen voor een engineer


Sollicitatievragen voor een engineer gedeeld door sollicitanten

Meest gestelde sollicitatievragen

Sorteren: Relevantie|Populair|Datum
Er werd een Software Development Engineer In Test (SDET) gevraagd...4 september 2009

how would you move mount fuji?

27 antwoorden

I would first answer with, "First, I would analyze the problem and determine if it didn't make better sense to come to the mountain rather than move the mountain. Assuming that's not feasible..." I think that's a key element they're looking for in an answer. That you can look at a major task and first identify if there isn't a better approach. The next element is to determine how you would go about completing a seemingly impossible or gargantuan task. The specifics of this part of the answer don't matter other than to show that you have an understanding that huge problems need to be broken down into smaller, more manageable tasks using the resources you have. Minder

When they ask a quesion like this at MS, they do want an answer. If you tell them that you want to consider alternatives up front, they will wave that off and tell you that, in this hypothetical situation, alternatives were already considered and that moving the mountain is the approach was chosen. They really want you to answer the question. The point of this question is - process. They want to see what process you use to solve problems. It is important to show that you solve the problem not by arranging and re-arranging a series of random thoughts but that you can approach it methodically and that this methodology can be applied to any problem. Do not to to some up with a clever answer that attempts to solve the problem - they will just keep insisting that you tackle the problem. If you don't, you won't pass the interview. So, brush up on your problem solving process before you interview at MS. Use these questions as an opportunity to impress them with how well you can solve difficult problems. Minder

This is a common dorky Computer Science joke. The answer I believe they are looking for is that you use the Tower of Hanoi algorithm to move the mountain (i.e. that the problem of moving Mt. Fuji is reducible to the already-solved Tower of Hanoi problem). This could be accomplished by having a large laser and a couple of really good cranes. Minder

Weergeven Meer reacties

Mostly behavioral, and includes the coding sessions as well. They look at your approach and ask you the questions on what your approach is and why

27 antwoorden

I emailed the HR. She said there are lot of applications and it's taking time.

Can you please elaborate the questions you faced.

@ continue above what salary did they offer and any signup bonus and relocation things. Minder

Weergeven Meer reacties

how do you get an Elephant in the fridge?

27 antwoorden

take the Giraffe out first?

Open the fridge door, take the elephant then put it in the fridge, close the fridge door. Done Minder

I don't know! But do you know how to tell if there's an elephant in your fridge? There's footprints in the the butter. How can you tell when there's TWO elephants in your fridge? You hear giggling inside. How can you tell when there's THREE elephants in your fridge? You can't close the door. You're welcome. Minder

Weergeven Meer reacties

Given an input string S write a function which returns true if it satisfies S = nT. Basically you have to find if a given string can be represented from a substring by iterating it “n” times. n >= 2 An example would suffice – Function should return true if 1) S = “abab” 2) S = “abcdabcd” 3) S = “abcabcabc” 4) S = “zzxzzxzzx” Function should return false if 1) S = “abac” 2) S = “abcdabbd” 3) S = “abcabcefg” 4) S = “zzxzzyzzx” It would be easy to understand if you can give an algo instead of saying use kmp or suffix tree or… I came up with O(n*n) solution. Wondered how to do in O(n)

27 antwoorden

public static boolean getRepeatingSubStringLinear(String word) { int p = 0; for (int i = 1; i < word.length(); i++) { if (word.charAt(p) == word.charAt(i)) { p++; } else { p = 0; } } if (p != 0 && word.length()%(word.length() - p) == 0) { return true; } else { return false; } } Minder

nimo's solution is almost correct. However wrong for case like "axaaxaaxa". correction: 2) find D = highest common denominator of all non-zero values in array. if not exist (other than 1), return false. 3) divide each array entry by D 4) calculate sum of all array cells - this is the substring length. 5) check repeat of that substring in the whole string Minder

dux2`s solution is correct. I've changed step 2, instead of calculating GCD I've used minimum of occurrences of character from input string. Here is my solution: Complexity of my algorithms is O(N). Minder

Weergeven Meer reacties
Raytheon Technologies

In front of you are three light switches. Only one does anything, and it turns on the light downstairs. From here you can't see the light, and it makes no sound. You must determine which switch operates the light, BUT you can only go check it once. How do you figure out which switch is for the light?

26 antwoorden

Flip any switch you want. Wait for about 5-10 minutes to let the bulb heat up. Flip that same switch off, and another one on. Go check the light. If it's off and hot, it was the first switch, if it's on it was the second and if it's cold and off, it was the last one. Minder

Flip the switch on one end, wait a "long" time (e.g., 15 minutes); then flip the middle switch; them immediately go check the light for on/off status and temperature. If off: the switch you didn't change controls the light; If on and surrounding fixtures slightly warm, the middle switch controls the light; If on and surrounding fixtures fully warm of hot, the first switch controls the light. Minder

Tell the HR interviewer to go stick his/her finger in the light socket and scream when you flip the correct switch. Minder

Weergeven Meer reacties

What happens when you have much subscribers to an event and an exception would raise in one of them?

25 antwoorden

The answer is fired Clark Tiu from Hong Kong

The only exception is fired the useless Clark Tiu from Hong Kong office

A good software developer not only has the technical ability to take upon a task and is able to handle projects at same time. A bad developer is named Clark Tiu, who sit on his soft chair all day reading his news and chatting with his personal friends. Clark is a butt kisser and is the ONLY reason he's still surviving at Dealogic. He has 0 tech abilities and 120% butt kissing. I wabt to see how Clark I Pretend to Work Tiu survives with everyone leaving. Minder

Weergeven Meer reacties

Given an input array and another array that describes a new index for each element, mutate the input array so that each element ends up in their new index. Discuss the runtime of the algorithm and how you can be sure there won't be any infinite loops.

24 antwoorden

Essentially the same as Anh's answer but less code, assuming ES5 is available var arr = ["a","b","c","d","e","f"]; var indices = [2, 3, 4, 0, 5, 1]; arr = (item, index) { return arr[indices.indexOf(index)]; }); Minder

function reposition(arr, indices) { var newArr = []; // I'm not sure if extra space is allowed. If it is, the solution should be this simple. for(var i = 0; i < arr.length; ++i) { var newIndex = indices[i]; newArr[newIndex] = arr[i]; } return newArr; } var arr = ["a", "b", "c", "d", "e", "f"]; var indices = [2, 3, 4, 0, 5, 1]; reposition(arr, indices); // returns: ["d", "f", "a", "b", "c", "e"] Minder

function repositionElements(arr, indices) { // assert(arr.length === indices.length) var moved = []; for (var i = 0; i < arr.length; i++) { moved.push(false); } var moveFrom, moveTo, itemToMove; for (moveFrom = 0; moveFrom < arr.length; moveFrom++) { itemToMove = arr[moveFrom]; while (!moved[moveFrom]) { moveTo = indices[moveFrom]; var tmpItem = arr[moveTo]; arr[moveTo] = itemToMove; itemToMove = tmpItem; moved[moveFrom] = true; moveFrom = moveTo; } } return arr; } var arr = ["a", "b", "c", "d", "e", "f"], indices = [2, 3, 4, 0, 5, 1]; repositionElements(arr, indices); // returns: ["d", "f", "a", "b", "c", "e"] Minder

Weergeven Meer reacties

How many bottles of shampoo are produced in the world a year?

25 antwoorden

Let's start with the US market: 300X10^6 people. About 60% use shampoo (others are bald or use soap). They go through about one bottle every two months, so that is about 1.8X10^9. Human population is about 6.6 X 10^9. As far as the undeveloped nations, most people don't use shampoo. The developed world is about four times the size of the US population or approximately 1.2 X 10^9. People in the US wash their hair more than in Europe, but I will neglect this. My estimate is about 5X10^9 bottles. Minder

Lets look again at the question- it is not 'how many bottles of shampoo are USED" the question clearly states "how many bottles of shampoo are PRODUCED in the world in a year". It interests me to note that this is a production question for a software engineer position which clearly leads me to determine that the answer is not meant to be a number but a program or mathmatical equation of some sort. There is not enough information listed to solve to any given number with so many variables, and it is not safe to assume that 50% of the population uses shampoo or how many people are bald. The idea is to take the information given and develop a method to calculate the numerical value if the actual values are supplied. Minder

Enough to wash everyone's hair.

Weergeven Meer reacties
Palantir Technologies

Given a fleet of 50 trucks, each with a full fuel tank and a range of 100 miles, how far can you deliver a payload? You can transfer the payload from truck to truck, and you can transfer fuel from truck to truck. Extend your answer for n trucks.

23 antwoorden

The answer is 450 miles. it is the sum for n=1 to 50 of [ 100 / (50-n) ] After 2 miles you would transfer all of the fuel from one truck, and could fill all 49 of the other trucks. (100mile range / 50 trucks = 2 miles before the first truck could be emptied of all fuel and is not needed to carry any fuel) at that point you only have 49 trucks, so 100/49 is the distance before you park the second truck. After parking 49 trucks you would have one full truck of fuel that would finish the last 100 miles. General solution for X trucks with Y range is Sum for n=1toX of [Y / (x-n)] Minder

This is a straightforward programming problem. Clever solutions such as allowing the other trucks to refuel and allowing other trucks to tow extra trucks full of fuel rarely impress the interviewer. The simplest solution involves recursion, or induction. Imagine a function f(n) where f(n) is the distance n trucks can carry the load, the problem defines f(1)=100, and we're asked to solve for f(50), so our job is to solve for f(n) in terms of f(n-1), f(1) and n. It's safe to assume each truck, including the fully loaded truck will travel the same distance and that fuel is used uniformly over the distance. So with n trucks, the trucks should travel just far enough that n-1 trucks have room in their tanks for the nth truck's fuel, then transfer an solve for n-1. This equation is f(n) = f(1)/(n) + f(n-1) (All perl vs python vs ruby/etc wars aside) Plugging this into a simple scripting language such as perl is an easy way to solve this: sub f{ my $n = shift; return 100 if($n == 1); return f(1)/($n) + f($n-1); } print "50: " . f(50) . "\n";' On the command line, this gives a quick answer: > perl -e 'sub f{ my $n = shift; return 100 if($n==1); return f(1)/($n) + f($n-1);} print "50: " . f(50) . "\n";' 50: 449.920533832942 Approximately 449.92 miles with 50 trucks. The recursive subroutine above will suffice as a general solution in terms of n. Minder

So 50 trucks is solvable but annoying. The answer depends on payload size, also if the truck needs to return. If we assume no return and 1 truck can carry the payload. Make the number of trucks 64 for even powers of 2. The trucks all take off together and every 50 miles they all have half full tanks. Half of the trucks are sacrificed to refill the other half. Number of trucks goes from 64 -> 32 -> 16 -> 8 ->4 ->2 -> 1. So 6 splits * 50 miles = 300 + last truck has 100 miles. 400 for 64 trucks. 50 can be solved with annoying fractions. General answer is 50 * log(base2) of n + 100. :-) Minder

Weergeven Meer reacties

implement the dynamic polymorphism

23 antwoorden

Could you please answer me .what are the 2 coding questions you were asked in the round 2 so that we have an idea of what kind of questions they were expecting ? Hope a reply from you.Thank You Minder

Is it the same type of questions asked as he mentioned? or different set of questions. Is it through epam test portal? Minder

Already they have sent the mail's for second round for some people. Tommorow they have second round with following others rounds Minder

Weergeven Meer reacties
Weergave: 31 - 40 van 619.760 Sollicitatievragen

Sollicitatievragen weergeven voor vergelijkbare functies