CareerCup

# Given a set of strings, print them in Lexicographic order (dictionary/alphabetical order)
# Example,
# Input:
# “ABCDEF”, “AA”, “BEF”, “A”, “AABB”
# Output:
# “A”, “AA”, “AABB”, “ABCDEF”, “BEF”

Write a function that takes a magic number and a list of numbers. It returns true if it can insert add or subtract operations in the list of numbers to get the magic number. Otherwise, it returns false.

For example:

f(10, [1,2]) = false. There's no way to add or subtract 1 and 2 to get 10.
f(2, [1,2,3,4]) = true. 1 + 2 + 3 - 4 = 2.
f(0, []) = true
f(1, []) = false
f(1, [1]) = true
f(0, [1]) = false

Is there any way to find pow(a,b)mod n when b exceeds long range.

Given a square matrix of size n (elements of the matrix can be negative). we need to find the square submatrix with maximum sum.

You have been given a string and a number. You need to find the longest common suffix between string and substring(0 to number)

Example : String = "ababa"
Number is 3
Take a substring from 0 to 2 which is aba

now find the longest matching suffix between "ababa" and "aba"

I don't remember perfectly the question, but it was like this


Given a list of 100 songs on your cell phone, find a way for each user to hear the songs without repeating songs, you need to use an algorithm that uses shuffle for songs.

Are you looking for Dell Printer Support Number to solve technical problems which occur while using your Dell printer? Just make a call to Dell Printer Support Canada: 1-855-253-4222 to resolve your all technical query related to Dell printer. You can also connect with us via e-mail or live chat. Always happy to help you!
For more, info visit our website:- https://dell.printersupportnumbercanada.ca/

Design Amazon prime video

Did any one took Microsoft Online Technical Screen ?? What questions I can expect in this test ??

Given 2 strings representing very large numbers (these are not representable as a BigInteger or other various type) write a method for adding the two numbers and returning their sum.

word look up

Design and implement a interest matching algo, to match people according to their interests in a particular area.
Suggest a score based on their interests. And rank matchings accordingly.

Implement a rate-limiter-like iterator and how to improve the space complexity

Given a <Word, TimeStamp> pair data type iterator as input. Implement an iterator based on it which can ignore the item if the same word has occurred in the past 10 seconds.

My implementation is to use a HashMap to memorize the word and its latest timestamp + 10s. For each new item, it will be checked against the HashMap to see if it has duplicated word occurred in the past 10s.

The interviewer asked me how to improve the space complexity if the string value varieties are infinite. He mentioned some boundary stuff.

Could anyone share some thoughts?

windowing in tcp

stateful and stateless firewall

Read data from a API call that gives org structure data in JSON format and arrange that data in requested format

log file parsing.

print LinkedIn if a number is divisible by 4 and 6, Linked if it is divisible by 4 and in it is by 6.

You are standing in the top-left corner of n*m grid. At each step you can only move up, down, right or left. Count the number of unique paths to the bottom-right corner of the grid (paths cannot cross themselves). The interviewer suggested that a backtracking solution is not the most performant one.

In a Binary maze with 0 and 1, 0 is the valid cell to which we can travel and 1 means that the cell is blocked. Given source and destination. We have to find-
1. IF path exists, if yes, find shortest path.
2. If we are given a chance to toggle single cell from 1 to 0 , which cell you will toggle so that you will surely get the shortest path.

Round 3- Find the first duplicate occurence of a number in an array

Round 3 - puzzle-there are 8 coins out of which 1 coin is faulty.The faulty coin has a lesser weight than the rest of coins which all have the same weight.You have been given a weighing balance with a pulley.Find the faulty coin

Round 3 - Write a java program to print a matrix in spiral

Round 2 - Write a java program to determine if a 10 digit number is magic number.A number is magic number if it has all digits between 1 to 6 occuring in it or if it has any number between 0 to 9 occuring thrice or if it contains three consecutilvely increasing or decreasing digits differing by 1 example 345 or 543

Round 2 - write java code to create the following pattern
*
* * *
* * * * *
* * * * * * *
* * * * * * * * *

Round 1-question 1 - given an array of stock prices for n days.Write an algorithm to maximize the profit of a customer such that he can buy and sell only once.
-Question 2
Prove that complexity for searching in arraylist is o(n)
and adding is o(1)

write java code to create the following pattern
*
* * *
* * * * *
* * * * * * *
* * * * * * * * *

Round 2- puzzle given 4 pair of socks of different colors(Red,green,blue and yellow)
Arrange the socks in such a way such that there are exacly 4 socks between the yellow socks,3 between the red ones and 2 between the green

Round 1-Question 2
Prove that complexity for searching in arraylist is o(n)

Round 1-Question 1
1)Given an array of stock prices for 7 continuous days.Write an algorithm to maximize the profit for a customer who buys stock on any day and sells it later.Buying and selling can happen only once and selling should happen on any day after buying