I was not able to code reversing a Query using recursion. :(
Software Developer Engineer Interview Questions
466,934 software developer engineer interview questions shared by candidates
Given an array of unsorted numbers, find triplets that equal a specified sum.
“You have all of the prices for a given stock for the next year. You can buy once and sell once in that year. How do you determine when to buy and sell to maximize your profit?”
6) Mr. Wagle goes to work by a bus. One day he falls asleep when the bus still has twice as far to go as it has already gone. Halfway through the trip he wakes up as the bus bounces over some bad potholes. When he finally falls asleep again, the bus still has half the distance to go that it has already traveled. Fortunately, Mr. Wagle wakes up at the end of his trip. What portion of the total trip did Mr. Wagle sleep? 7) How many numbers between 3000 and 4000 do the digits in the number go in increasing order? 8) A ship is twice as old as the ship's boiler was when the ship was as old as the boiler is. What is the ratio of the boiler's age to the ship's age? 9) A four-person crew from Classic Colors is painting Mr. Field's house. Michael is painting the front of the house. Ross is in the alley behind the house painting the back. Jed is painting the window frames on the north side, Shawn is on the south. If Michael switches places with Jed, and Jed then switches places with Shawn, where is Shawn?
Given a map of integer as key and String as a value, how to efficiently get all the keys whose value consists of certain given input string as a sub-string.
(i) Explain virtual memory from application level all the way to chip level. (ii) Merging 2 sorted list of elements. (iiI) Given N knights and N targets, what are the minimum moves needed for the knights to reach the targets.
Q. Two arrays, a and b of arbitrary size containing more than 1 lakh entries which are unsorted. Print common elements in both arrays without sorting and complexity less than O(n^2)
Given a character array, calculate the minimum no. of jumps from 1st alphabet to reach the last alphabet. CRITERION: From a given character, you can either: 1. Jump to the adjacent character 2. Jump to the same character positioned in a different place
Write a log paser
Was a simple exercise with little complexity.
Viewing 1271 - 1280 interview questions