How do you write an algorithm to count all subsets of strings in a string.
Senior Interview Questions
340,968 senior interview questions shared by candidates
Is this valid/what would this do (C): int *p; p=0; p++; printf("%d",p);
Write an algorith to print a series of roman numerals.
A gas station has 30 gallon of gasoline worth 1.20 per gallon and some worth 1.40 per gallon .how many gallons of the 1.40 brand must the owner mix in to produce gasoline that cost 1.28 per gallon
Java question was around String pattern searching which you can do easily in around 20 minutes, if you can keep your mind calm where that clock is also ticking.
Focued on my Sales Experience - situational style questions and why I was applying to join Salesforce & why now ??
Given an ordered large array of integers, find all pairs of numbers that add up to a particular given sum.
A vaguest ion that was asked in a very general way, but which the interviewer clearly had specific answers he was looking for: "what are four components that are included in every specification doc". That sounded a lot like a thing you would find at Microsoft and similar large companies where process is more strictly defined. I answered poorly, I think, perhaps because I haven't worked with that kind of spec in a very long time, and not on any projects that worked out well. Smaller orgs/programs/projects (startups and incubators, for example, where the outcome is always in flux, as I am accustomed to working with) can have poor specs, specs that are centered on marketing, planning documents that are made up of wireframes and time-based stage gates. In any case, I choked a bit, and the interview kind of skated around and became more specific as we went along. I don't think that is inappropriate, though, because Amazon does value and expect the ability to deal with ambiguity.
Write a function that determines if a tree is a BST or not
Given the daily stock prices of a share during last 30 days, write a program to find out best buying and selling dates for maximum gain. The program should run with O(n) complexity.
Viewing 221 - 230 interview questions