Preguntas de entrevista de Full stack engineer

9 mil

Preguntas de entrevista para Full Stack Engineer compartidas por los candidatos

Principales preguntas de entrevista

Ordenar: Relevancia|Popular|Fecha
monday.com
A un Full Stack Developer le preguntaron...7 de junio de 2020

Given a formula (string) and a dict, replace each key that appears in the formula with its value. "CONCATENATE("#first_name#", " - ", 30)" { 'first_name': "Moshe", 'age': 20, 'status': "Done"} Result: "CONCATENATE("Moshe", " - ", 30)"

9 respuestas

column_id_to_value = {'first_name': "Moshe", 'age': 20, 'status': "Done"} formula = 'CONCATENATE("#first_name#", " - ", #age#)' dotIt(formula, column_id_to_value) def dotIt(formula, dictionary): answer = [] formula_list = formula.split("#") for form in formula_list: if form in dictionary: answer.append(str(dictionary[form])) else: answer.append(form) print(''.join(answer)) Menos

let formula = "CONCATENATE('#first_name#', ' - ', '#age#')"; let user = { first_name: "Moshe", age: 20, status: "Done"}; let keys = Object.keys(user); function getKeys() { const keys = Object.keys(user); keys.forEach( key => formula = formula.replace(new RegExp('#'+key+'#'), user[key])); console.log(formula); } getKeys(); Menos

def calculate_for_row(formula, column_id_to_value): result = [] replaced_last_part = False new_formula_parts = formula.split('#') for index, part in enumerate(new_formula_parts): if part in column_id_to_value: result.append(str(column_id_to_value[part])) replaced_last_part = True else: if index > 0 and not replaced_last_part: result.append('#') result.append(part) replaced_last_part = False parse(''.join(result)) def parse(formula): print(formula) column_id_to_value = {'first_name': "Moshe", 'age': 20, 'status': "Done"} formula = 'CONCATENATE("#first_name#", " - ", #age#)' calculate_for_row(formula, column_id_to_value) Menos

Mostrar Más respuestas
Softsuave

list and array related questions Basic sql question

7 respuestas

did my level best in 2nd round but not selected.

Can you share 2nd round question

Total how many rounds

Mostrar Más respuestas
MountBlue Technologies

Print patterns like Swastic sign, 2-D Array manipulations(Bit Difficult) and String manipulations.

6 respuestas

They will mail the exact date. The joining date is between 6-16 aug. The difficulty of 2nd round was medium. One question was a bit difficult and the rest were medium.If you are good at coding and regularly doing it then you can easily crack it. Menos

when is your joining??what is the difficulty of 2nd round?

what questions were asked in 2nd round?

Mostrar Más respuestas
JATO Dynamics

Why did i choose to apply for JATO?

5 respuestas

I answered with I am looking for a challenge and to join a company that has a long term vision and goal and they needs people like me to join the journey and support them through the company transformation. Menos

Read my "Database Production Assistant" and you will realise how slippery, contorted, unreliable and mendacious they are, worthy of avoiding for aye. Menos

Thank you for your review. JATO appreciate the comments and feedback provided and are happy to hear you were happy with the outcome of the interview, even though the technical questions were a little difficult. Menos

Mostrar Más respuestas
Jobsity

solve a problem without for loops

5 respuestas

recursion

How went the second challenge?

How was the second challenge?

Mostrar Más respuestas
Boeing

difference between null and void

5 respuestas

Could you please tell us what can be the expected salary for 4-5 years of experience candidate. Menos

Do you know what is the salary band for PM?

How much salary did they offer you?

Mostrar Más respuestas
Panaya

return true if array of size n contains a permutation of [1,n]

4 respuestas

for(var i=0; i

public static bool isPermutation(int[] arr) { int num = 0; for (int i = 0; i arr.Length) return false;//number out of range int tmp = 1 << (arr[i]-1); if ((num & tmp) == tmp) return false;// number was found before - duplicate num |= tmp; } return true; } Menos

var permotation = function(arrayOriginal, arrayDuplication){ if(!Array.isArray(arrayOriginal) || !Array.isArray(arrayDuplication) || arrayOriginal.length != arrayDuplication.length){ return false; } var dictionaryObj = {}; var sumDuplication = 0; for(var i=0; i Menos

Mostrar Más respuestas
Jobsity

How to print numbers from 0 to n without using a loop?

4 respuestas

using recursion was my answer, make a function that calls itself with a stop condition Menos

Recursion

Recursion

Mostrar Más respuestas
LINE

They always start with: Why would you like to work with us?

3 respuestas

"It is very confuse they want a Country who speak Chinese but also native on English." wut Menos

"It is very confuse they want a Country who speak Chinese but also native on English." wut Menos

I also applied Full Stack Developer (No Japanese Required) Interview on my country. I found that LINE interview is good for fresh student because their technical question is not practical and quite look like my master degree homework question about the theory in I/O, network. I had 15 years+ experience in IT and 10 years in development cross-thought dataware house, ETL, windows, web, frontend, backend experience. But LINE doesn't focus on how's my experience can be contribute to their company, but just keep asking me question of (How to do), (What to do) brabrabrab to their product. Although they doesn't need to know Japanese, but they require the applicant have native level English. It is very confuse they want a Country who speak Chinese but also native on English. Menos

Envoy

Have you used AngularJS?

3 respuestas

This is a yes or no question...

True, the questions weren't difficult, but after I admitted I had used AngularJS, but not Angular, the interview basically ended. Menos

The key in these questions is to cover the fundamentals, and be ready for the back-and-forth with the interviewer. Might be worth doing a mock interview with one of the Envoy or ex-Envoy Full Stack Web Developer experts on Prepfully? They give real-world practice and guidance, which is pretty helpful. prepfully.com/practice-interviews Menos

Viendo 1 - 10 de 8673 Preguntas de entrevista

Consultar preguntas de entrevista para empleos similares

software engineer