Given an array of randomly arranged lower case letters, uppercase letters, and numbers, sort the array such that all lower case letters come before all uppercase letters, come before all numbers. The classes of characters do not need to be in order in their respective sections.
I was asked two questions. Q 1. You are given two version numbers of a software, like Version 10.3.4 and Version 10.3.41. Write a program to find out which of the version numbers are the latest. If version 1 is latest output -1, if version number 2 is latest output +1 else output 0 if same version. Both the version numbers are taken as string. He also asks to make the program of minimum time complexity as we can. At the end he also asked the difference between an iterative program and one with recurrence and their advantages and disadvantages. Q 2. Given two files with a list of application IDs (or some kind of data) stored in them , write a program to compare the data in the two files and output all the common data found in each. What data structure would you use and why ? Give a minimum time and space complexity algorithm. Why did you choose the particular data Structure or algorithm ?
what is the angle between the hour hand and minute hand in between 2:20
What is the angle between the two arms of the clock at 2:40?
Toss a fair coin between two people. If it end with HHT, A wins the game. If it ends with HTT, B wins the game. Whats the probability of A wining the game.
If you flip ten coins, what is the expected value of the product of the number of heads times the number of tails? You have 3 minutes with a pen and paper, and at the end of that, I want you to give me a range.
Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"
n= 20 for (i=0;i<n; i--) print i the question was to change or replace a only one character in for loop to print 20 times.
Design a data structure that supports insert, delete min, delete max, get min, and get max, all in log(n) time.
To return the 'm' smallest numbers from a file of 'n' numbers
Viewing 71 - 80 interview questions