Write a function (in your preferred language C, C++, or Java) that will take the given string and return the reverse. (ie. input:"abc def ghi" output:"ihg fed cba") Optimize the above code (if possible). Now knowing that the original function you wrote in pt1 is being used by other programs and cannot be modified write another function that when called will utilize the function from pt1 to only reverse the words in the sentence. (ie. input:"abc def ghi" output:"ghi def abc") Test your code.
Software Development Interview Questions
37,008 software development interview questions shared by candidates
design an elevator(uml+implementation+threads& syncroniczation and locking)
There was nothing difficult or unexpected about the interview.
Standard coding and design questions. Some questions about my background. A tedious question was to convert a string representing a roman number to an integer. This question is not hard to solve, but tedious to code.
Basic 2 sum problem. Finding pair of numbers that add to current sum.
How many gas stations are there in the United States?
The first question he gave to me, design a cab booking system (he just want a brief about how I'm going to define my entities) Use cases: 1. user can book a ride. 2. user can store favorite locations 3. user can view past bookings 4. new drivers can sign up 5. driver can view past bookings The next question was given an integer N and D I had to add the smallest possible number in N so that N doesn't contain the digit D. Test case1 : N = 100 , D=0, output = 11 Test case2 : N = 5925, D=9, output = 75
Remove a node from Linked list when address of same node is given
you have 9 marbles, all of them identical except one of them is slightly heavier than the rest. in order to determine which is the heaviest, you have a balancing scale, however you are only allowed to use it twice. how do you determine the heaviest marble?
Given a string s of length n and an index i (0 <= i <= n). Using only constant extra space, how do you manipulate the string in-place to yield the string s[i, i+1, ... , n-1, 0, 1, ..., i-1]?
Viewing 811 - 820 interview questions