Programador Sql Interview Questions

Programador Sql Interview Questions

SQL son las siglas de Structured Query Language (lenguaje de consulta estructurado) y un programador SQL es la persona encargada de crear bases de datos SQL y las aplicaciones que funcionan con ellas. Por lo general, utilizan tablas de diseño y recursos de almacenamiento para mayor estabilidad, fiabilidad y rendimiento. En una entrevista para un puesto de programador SQL, pueden hacerte preguntas sobre tus conocimientos de programación y habilidades de resolución de problemas.

Preguntas de entrevista más frecuentes para programador/a SQL y cómo responderlas

Question 1

Pregunta n.º 1: ¿Qué tipos de claves existen en SQL y cuándo las usarías?

How to answer
Respuesta recomendada: Esta pregunta te permite mostrar tus conocimientos de SQL. Explica los tipos más comunes de claves en SQL e indica cómo pueden identificar filas y columnas en las tablas. Las claves funcionan como identificadores únicos, lo que permite que los usuarios recuperen los datos con facilidad.
Question 2

Pregunta n.º 2: ¿Qué tipos de normalización existen en SQL y cuándo los usas?

How to answer
Respuesta recomendada: La normalización en SQL suele utilizarse para organizar datos y reducir redundancias. Puedes demostrar tu experiencia explicando los métodos de normalización que más usas. Por ejemplo, muchos programadores dividen una tabla grande en varias más pequeñas para facilitar la lectura.
Question 3

Pregunta n.º 3: ¿Con qué lenguajes de programación estás familiarizado?

How to answer
Respuesta recomendada: Muchos desarrolladores usan además JavaScript, HTML, Python, PL/SQL y otros lenguajes. Enumera los lenguajes que conoces y explica cómo los has usado en tu empleo anterior. Además, menciona los títulos de programación que posees.

710,934 programador sql interview questions shared by candidates

Populate an array of numbers from 1 to N (inclusive). Given two numbers, p and q , if a number in the array is divisible by p print OUT, if a number is divisible by q print THINK. If number is divisible by both p and q, print OUTTHINK. Otherwise, print the number.
avatar

Entry-Level Software Developer

Interviewed at IBM

3.9
Oct 2, 2017

Populate an array of numbers from 1 to N (inclusive). Given two numbers, p and q , if a number in the array is divisible by p print OUT, if a number is divisible by q print THINK. If number is divisible by both p and q, print OUTTHINK. Otherwise, print the number.

Suppose there is a rectangular map where you can only travel up or right to go from a start location in the bottom left corner to the top right corner, and each move is discrete. Write a program that prints all possible solutions to get from the start to finish.
avatar

Financial Software Developer Intern

Interviewed at Bloomberg

4
Mar 5, 2010

Suppose there is a rectangular map where you can only travel up or right to go from a start location in the bottom left corner to the top right corner, and each move is discrete. Write a program that prints all possible solutions to get from the start to finish.

phone numbers: provided a phone number (654-876-0987), return all possible strings that the phone number could represent if 2 -> {A, B, C}, 3 -> {D, E, F}, and so on common substring: find the biggest common substring in 2 strings, "abcdef" "gbcdh" would return "bcd"
avatar

Software Engineer Intern

Interviewed at Meta

3.5
Oct 11, 2012

phone numbers: provided a phone number (654-876-0987), return all possible strings that the phone number could represent if 2 -> {A, B, C}, 3 -> {D, E, F}, and so on common substring: find the biggest common substring in 2 strings, "abcdef" "gbcdh" would return "bcd"

Write a function to determine if a bin tree is a valid BST. I wrote a fully working solution in 3-5 minutes. It was also the most optimal but maybe because she needed to kill time, she asked me to rewrite it in what she thought was optimal (her reasoning didn't make much sense). Then she asked me for time and space requirements of the solutions. I said O(n) for both which is correct but she insisted that the space requirement was O(logn) which is wrong.
avatar

Software Engineer Intern

Interviewed at Meta

3.5
Jan 15, 2013

Write a function to determine if a bin tree is a valid BST. I wrote a fully working solution in 3-5 minutes. It was also the most optimal but maybe because she needed to kill time, she asked me to rewrite it in what she thought was optimal (her reasoning didn't make much sense). Then she asked me for time and space requirements of the solutions. I said O(n) for both which is correct but she insisted that the space requirement was O(logn) which is wrong.

Viewing 801 - 810 interview questions

Glassdoor has 710,934 interview questions and reports from Programador sql interviews. Prepare for your interview. Get hired. Love your job.