Given two lowercase strings, S1 and S2, sort S1 in same order as S2. If a character in S1 doesn't exist in S2, put them at the end. If S1 is "program" and S2 is "grapo", then return "grrapom".
Desarrollador Java Senior Interview Questions
750,113 desarrollador java senior interview questions shared by candidates
Implement a method for a Fibonacci sequence where instead of adding the last 2 elemenT's you add the last n elements. For n=3. 1 1 1 3 5 9...
The first question was to print pattern that is n=1 *** n=3 * * *** *** ************ *** *** * * n=5 * * *** *** ***** ***** ******************* ***** ***** *** *** * *
Write a function to tell if two line segments intersect or not.
Given a sequence of numbers (34128) and an input map such as a dial pad on a phone (2->[a,b,c], 3->[d,e,f], 4->[g,h,i]) write an algorithm to return all possible words from the sequence. E.g. Input: 232 Output: [ada, adb, adc, aea, aeb, aec, afa, afb, afc, bda, bdb, bdc, bea, beb, bec, bfa, bfb, bfc, cda, cdb, cdc, cea, ceb, cec, cfa, cfb, cfc]
+-----------+ | 1 | 2 | 3 | +-----------+ | 4 | 5 | 6 | +-----------+ | 7 | 8 | 9 | +-----------+ | * | 0 | # | +-----------+ +---+ | U | +---+ +---+ +---+ +---+ | L | | S | | R | +---+ +---+ +---+ +---+ | D | +—+ Input String: "180*", output is the number of minimum operations needed to dial the input */ 2)How do you test login page?
Find if a word is anagram (e.g. ana is an anagram).
how many scale measurements does it take to know which ball out of 8 balls weighs more? Then how many does 28 balls take?
My strengths and weaknesses
First, a mathematic question, asking about a card game with how many possible way for the combination based on the rules it given. Second, let you to print out all the combination of 3 digit numbers with no duplicate, ex. 012, 013, ....123, 124, 125...
Viewing 201 - 210 interview questions