You are going to take some numbers as an input from a file. You need to witer a program to find longest increasing sequence. You should process it as soon as you are taking an input. After finishing the last input immediately you should be able to tell the sequence. Input: 1 5 3 4 6 4 Output: 3 4 6
Given two unsigned integer values, write a function that returns the first divided by the second. You cannot (of course) use div or mod operators - only addition, subtraction and multiplication. Discuss the strengths/weaknesses/algorithmic complexity of your solution. Is there a better way to do it? If so, what, and what is its complexity?
Q: Write a function that can tell if a string is a palindrome regardless of punctuation or capitalization?
Given the following list of objects {user, loginTime, logoutTime}. What is the maximum number of concurrent users logged in at the same time? Input: [ {user: A, login: 1, logout: 3}, {user: B, login: 3, logout: 4}, {user: C, login: 1, logout: 2}, {user: D, login: 123123123, logout: 987987987}, {user: E, login: 1, logout: 3} ] Output: 3
If we write for(i=0;i<10;i++); printf("%d",i); What will be the output?
Design a system for counting how many times an item is clicked on. You need to record clicks and be able to report how many clicks for a given item. Be able to report which items are the most popular. Keep in mind scalability, since this is Amazon we're talking about.
What is the time complexity of your solution?
A list with a set of integers. All elements appear even number of times while one appear odd number of times. Find this number that appear odd number of times
How could you represent days and month using 2 6 sided dice
Considering a 2-dimension matrix that can only be traversed by 1 adjacent position at a time and never diagonally. Create an algorithm to traverse that matrix from its upper-left corner to its lower-right corner using the shorter possible path in the most efficient way.
Viewing 551 - 560 interview questions