Code a program to check if a given string is matching a given regular expression
Engenheiro De Software Interview Questions
Engenheiro De Software Interview Questions
Engenheiros de software criam programas para desenvolver softwares de computador. As entrevistas são altamente técnicas. Portanto, prepare-se para resolver problemas de codificação e de matemática. As perguntas específicas que são feitas dependem do tipo de programação exigido na vaga. Pesquise sobre uma área específica de software, como desenvolvimento web, desenvolvimento de aplicativos ou desenvolvimento de sistemas.
Principais perguntas de entrevista para engenheiro(a) de software e como respondê-las
Pergunta 1: Como você descreve seu processo de programação?
Pergunta 2: Quais linguagens de programação você conhece e prefere?
Pergunta 3: Dê um exemplo de um projeto bem-sucedido que você tenha concluído.
420,454 engenheiro de software interview questions shared by candidates
How do you print all elements of a linked list.
Given two unsorted arrays, one with event start times and one with end times, find out if any two events overlap.
You are given a list of strings (e.g. ["cat", "dog", "hat", "apple", "c"] ). Write a program that would take as input a string containing a wild card character, like "*at", "**t" (could be "cat", "hat", "bat"), "ca*", etc. and return true if there is a corresponding string in the list, and false otherwise.
You have 8 balls. All are identical except one is slightly heavier. You have a balance. What is the minimum number of weighings required to find the heavier ball?
Describe a function (in C) that does the following Input : an integer. Output: if that integer is 4, the function returns 7. if that integer is 7, the function returns 4. constraints: the input is SURE to be either 4 or 7. no need to validate. you are not allowed to use any condition/flow commands (if, switch, while, for, trinary operator...) you are not allowed to use any external library or import anything (like math..) you are not allowed to use %(modulu), * (multiplication)
reverse bits of an integer that is a power of 2 , keeping complexity in mind.
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
You have two linked lists that merge at some node. The lists could be billions of nodes long. Find the node where the lists merge in the most optimal time while using a low amount of memory.
string compression: aaabbbbcc ->a3b4c2
Viewing 531 - 540 interview questions