Scan an integer and print the alphabet so that: 1-A; 2-B...26-Z; 27-AA,28-AB,29-AC...52-AZ; 53-AAA,54-AAB,55-AAC...78-AAZ...etc.. If you provide an integer, say 28-it should print AB. If you scan another integer say 55, it should show AAC
Desenvolvedor De Software Interview Questions
Desenvolvedor De Software Interview Questions
A área de desenvolvimento de projetos está em alta e oferece bons salários e realização profissional. Em entrevistas para cargos de desenvolvimento de software, são normalmente feitas perguntas relacionadas às suas habilidades técnicas e comportamentais e a como você gerencia projetos de maneira eficiente.
Principais perguntas de entrevista para desenvolvedor(a) de software e como respondê-las
Pergunta 1: Com qual tipo de desenvolvimento de software você trabalha no momento?
Pergunta 2: Descreva um problema de desenvolvimento que você tenha tido e como o solucionou.
Pergunta 3: Como é seu processo de garantia de qualidade?
93,114 desenvolvedor de software interview questions shared by candidates
Say I have a deck of 52 cards, regular deck of cards. I put a joker in the deck somewhere and shuffle it up. Now I start dealing you cards until the joker shows up. Once it shows up, I stop dealing you cards. What is the probability that you have, in your set of cards, all 4 aces?
You are in a room with 100 lights, initially all off. If you first toggle every light, then every second, and so forth up to 100, which lights will be on at the end?
what is hash table??
print a pattern 012345678910987654321
Just one question: shift an array to the right by n positions such that the right most indexes are become the first ones and the first ones move ahead. like: 1 2 3 4 5 --> shift by 2 --> 4 5 1 2 3
There are 20 floors in a building. If you're on an elevator and you're trying to get to the 20th floor, what is the probability that 4 people ahead of you click the 20th floor before you do? Assuming you click last.
Design an algorithm to find the first unique element in an array.
1. pattern question n=1 * *** n=2 * *** * * ***** n=3 * *** * * ***** * * * *******
Given heads of two linked lists. Find if the two linked lists intersect. Solution should not use extra memory.
Viewing 11 - 20 interview questions