Find the largest possible difference in an array of integers, such that the smaller integer occurs earlier in the array.
Software Interview Questions
748,344 software interview questions shared by candidates
what happens when you call fork() fork () fork()
Common integers in two arrays.
Reverse a linked-list.
find the missing number of an array of consecutive numbers.
NDA
Experience working on technical projects as part of a team
String s = "Hey"; s = s.concat(" Guys") sop(s)
* Print binary tree level by level * Find distance between words in a string eg: String => "I am a good girl" distance between "I" and "good" is 3
You have a potentially very-large set of documents, which are potentially very-large, and contain text. For searching these documents, they've been pre-processed into a (very-large) table mapping words to the set of documents that contain each word. E.g. (word) : (documents (referenced by ID) containing that word) Apple: 1, 4, 5, 6, 32 Banana: 5, 6, 7, 9, 32 Cantaloupe: 1, 2, 6 ... Clients will pass in a set of words (e.g. {apple, cantaloupe}), and want the set of document IDs that contain all the words. (e.g. {apple, cantaloupe} -> {1, 6}) Design a distributed system to implement this, bearing in mind that the number of documents, the number of words, and the number of document-IDs-per-word are potentially really, really big.
Viewing 1551 - 1560 interview questions
See Interview Questions for Similar Jobs
Channel Sales ManagerProgrammer AnalystTest AnalystErp Implementation ConsultantConfiguration ManagerTechnical Support AssociateSenior SalesAccount Executive Mid MarketQa ManagerMajor Account ExecutiveManual TesterFull Stack EngineerEntry Level Digital Signal Processing EngineerEntry EngineerEntry DeveloperJava DeveloperIt HeadIos DeveloperEngineer Developer