## /

BAN USER/

- 0of 0 votes

AnswersGiven a list L of numbers from 0 to n, and another number k = [0-9], find how many times k appears in L. If the target number in L is more than one digit, treat each digit separately. For example, k=0 appears twice in L = [0,10].

- / in United States| Report Duplicate | Flag | PURGE

Adobe SDE-3 Algorithm - 0of 0 votes

AnswersGiven a list L of numbers from 0 to n, and another number k = [0-9], find how many times k appears in L. If the target number in L is more than one digit, treat each digit separately. For example, k=0 appears twice in L = [0,10].

- / in Canada| Report Duplicate | Flag | PURGE

TalkIQ Senior Software Development Engineer Algorithm - -1of 3 votes

AnswersWrite a function that takes as input an array of integers A, and two integers low and high.

- / in United States

Your function has to output pairs of indices: {(i,j), ...}

Where each pair of indices denotes that the subarray of A[i...j] has a sum in the range low <= sum <= high.

Apparently there are algorithms better than O(N^2).| Report Duplicate | Flag | PURGE

Google Software Engineer - 0of 0 votes

AnswersGiven a timer time() with nanosecond accuracy and given the interface

- / in United States

interface RealTimeCounter:

void increment()

int getCountInLastSecond()

int getCountInLastMinute()

int getCountInLastHour()

int getCountInLastDay()

implement the interface. The getCountInLastX functions should return the number of times increment was called in the last X.| Report Duplicate | Flag | PURGE

Amazon Software Engineer / Developer Algorithm - 2of 2 votes

AnswersCreate a data structure that has fast insertion, removal, membership testing, and random selection.

- / in United States| Report Duplicate | Flag | PURGE

Amazon Software Engineer / Developer Algorithm

- 0 Answers
**Continuous/ranged coin change problem modified version**1) A soda water machine,press button A can generate 300-310ml, button B can generate 400-420ml and button C can generate 500-515ml, then given a number range [min, max], tell if all the numers of water in the range can be generated

- / March 06, 2014| Flag | PURGE - 0 Answers
**Iterative logarithmic exponentiation**Write an interative O(lg n) algorithm for finding the power of x^y (x is a double, y>0 is an int).

- / March 01, 2014

I first did the recursive divide and conquer one and tried to convert it to iterative... and I couldn't :S

Is there a method to convert recursion to iterative (it is easy for tail recursion) ?| Flag | PURGE

**CareerCup**is the world's biggest and best source for software engineering interview preparation. See all our resources.

Open Chat in New Window

Starting solving problems on careercup.com.

- / August 01, 2016When a term does not make sense, look it up.

Avoid questions that were generally avoided by other people (i.e., solve the questions with a lot of activity on it).