# 88

Preguntas de entrevista para Ingeniero De Aws compartidas por los candidatos

## Principales preguntas de entrevista

Ordenar: Relevancia|Popular|Fecha
A un DevOps Data Engineer (AWS) le preguntaron...25 de marzo de 2017

3 respuestas

Yes

Yea

Yes

### Hardest Q was: Here's a binary tree: find the longest path within it. So, find a path between any two leaf nodes, where the path is the longest.

3 respuestas

class Solution{ int ans[] = new int[1]; //O(n) public int efficientDia(TreeNode root) { if(root == null) return 0; int left = efficientDia(root.left); int right = efficientDia(root.right); ans[0] = Math.max(ans[0], 1 + left+ right); return 1+ Math.max(left, right); } //O(n^2) public int getDiameter(TreeNode root) { if(root == null) return 0; int leftHeight = getHeight(root.left); int rightHeight = getHeight(root.right); if(ans[0] &lt; 1 + leftHeight + rightHeight) { ans[0] = 1 + leftHeight + rightHeight; } return Math.max(getDiameter(root.left), getDiameter(root.right)); } Menos

int ans[] = new int[1]; //O(n) public int efficientDia(TreeNode root) { if(root == null) return 0; int left = efficientDia(root.left); int right = efficientDia(root.right); ans[0] = Math.max(ans[0], 1 + left+ right); return 1+ Math.max(left, right); } //O(n^2) public int getDiameter(TreeNode root) { if(root == null) return 0; int leftHeight = getHeight(root.left); int rightHeight = getHeight(root.right); if(ans[0] &lt; 1 + leftHeight + rightHeight) { ans[0] = 1 + leftHeight + rightHeight; } return Math.max(getDiameter(root.left), getDiameter(root.right)); } private int getHeight(TreeNode root) { // TODO Auto-generated method stub if(root == null) return 0; return Math.max(getHeight(root.left), getHeight(root.right))+1; } Menos

Indians at all companies always ask tree questions, it makes them giggle inside. I know, because I'm half indian and have interviewed people... tee hee hee Menos

### come avresti disegnato il seguente DB data le richieste dell'esercizio a casa?

1 respuestas

DB relazionale con PKs e foreign key etc.

### -Write code for us in real time

1 respuestas

I provided a back-end call to a MongoDB database.

1 respuestas

Well.

### che cosa è un file MD5?

1 respuestas

strumento software di verifica dell'integrità di un file

### come avresti potuto disegnarlo in maniera diversa questo modello logico se avessi avuto un db a documento?

1 respuestas

esempio DB a documento...

### How would you handle pressure?

1 respuestas

Understand why the interviewer is asking the question.

### Difference between public and private subnet.

1 respuestas

Described all the things to him.

### OOP Question, data structure, SQL(Joins), coding question, add two number(numbers in the string type)

1 respuestas

Left joins, right joins some sort of

Viendo 1-10 de 88 preguntas de entrevista