Skip to contentSkip to footer

Programador Sql Interview Questions

Salaries
Interviews

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

u have 10 red socks and 10 blue in ur cupboard .you have to take 1 pair of socks but ur room is completely dark.how many minimum no. of socks required to take so that u ll be sure to get atleast a pair of same coloured socks?
avatar

Software Engineer

Interviewed at e-con Systems

3.8★
Mar 4, 2017

u have 10 red socks and 10 blue in ur cupboard .you have to take 1 pair of socks but ur room is completely dark.how many minimum no. of socks required to take so that u ll be sure to get atleast a pair of same coloured socks?

Coding challenge: 1. You are given a matrix of Ys and Ns where a Y at (i,j) denotes that persons i and j are friends. Friendships are transitive, so if A is a friend of B is a friend of C, then A is in the same a friend circle as C even if A doesn't know C directly. How many friend circles are there? It's really a disjoint sets problem. 2. You are given a list of strings. Removing a letter from any string yields a different string that may or may not exist in the list as an independent entity. This is one link of a "string chain". Find the longest chain in the array. Solved with a hashtable. Interview day: 1. Code a function that matches regular expressions with targets. There is a DP and a recursive solution. 2. Test it extensively in a main. Write a function to autogenerate test cases. 3. Code a postfix notation calculator. Doable with a stack. Now, what if you wanted to support arbitrary operations on some variable number of preceding numbers? How does the code change? 4. You are given a tree in the form of a list of (value, parentndx, intree) tuples, where intree is a boolean denoting whether the node is in the tree, and parentndx is the location in the list of the parent node of this node. The root's parent is -1. Write a function remove(ndx) that removes the node at that ndx and all its children in O(n). It requires caching which nodes have been visited and a recursive function that checks whether a node in the list should be removed (terminates on parentndx==-1 || ndx or when it finds a cached node that was already removed and visited). 5. You are given two infinite streams of data, where each datum has fields (timestamp, value). The streams have a single function take() that pops the oldest thing off and returns it or "blocks" until something arrives in the queue for it to return. Data might arrive much later than its timestamp. You are given a function output(a,b), which takes two values, one from each stream, and computes something. You want to call output() on all (a,b) pairs that have timestamps less than some given interval apart, and you want to do this as soon as any data that completes such a pair arrives. Construct pseudocode that will do this. The answer involves two threads that each manage a list of numbers pulled off their stream, pull a number from the other thread's list, try to match it against everything, and then carefully discard data when appropriate. 6. You are managing a webservice and get a complaint about the page loading slowly. What is a possible cause of the problem? How would you check that? Okay, say that's not the problem. What else could it be?
avatar

Software Engineer

Interviewed at Two Sigma

3.9★
Feb 23, 2017

Coding challenge: 1. You are given a matrix of Ys and Ns where a Y at (i,j) denotes that persons i and j are friends. Friendships are transitive, so if A is a friend of B is a friend of C, then A is in the same a friend circle as C even if A doesn't know C directly. How many friend circles are there? It's really a disjoint sets problem. 2. You are given a list of strings. Removing a letter from any string yields a different string that may or may not exist in the list as an independent entity. This is one link of a "string chain". Find the longest chain in the array. Solved with a hashtable. Interview day: 1. Code a function that matches regular expressions with targets. There is a DP and a recursive solution. 2. Test it extensively in a main. Write a function to autogenerate test cases. 3. Code a postfix notation calculator. Doable with a stack. Now, what if you wanted to support arbitrary operations on some variable number of preceding numbers? How does the code change? 4. You are given a tree in the form of a list of (value, parentndx, intree) tuples, where intree is a boolean denoting whether the node is in the tree, and parentndx is the location in the list of the parent node of this node. The root's parent is -1. Write a function remove(ndx) that removes the node at that ndx and all its children in O(n). It requires caching which nodes have been visited and a recursive function that checks whether a node in the list should be removed (terminates on parentndx==-1 || ndx or when it finds a cached node that was already removed and visited). 5. You are given two infinite streams of data, where each datum has fields (timestamp, value). The streams have a single function take() that pops the oldest thing off and returns it or "blocks" until something arrives in the queue for it to return. Data might arrive much later than its timestamp. You are given a function output(a,b), which takes two values, one from each stream, and computes something. You want to call output() on all (a,b) pairs that have timestamps less than some given interval apart, and you want to do this as soon as any data that completes such a pair arrives. Construct pseudocode that will do this. The answer involves two threads that each manage a list of numbers pulled off their stream, pull a number from the other thread's list, try to match it against everything, and then carefully discard data when appropriate. 6. You are managing a webservice and get a complaint about the page loading slowly. What is a possible cause of the problem? How would you check that? Okay, say that's not the problem. What else could it be?

It's the first OA coding sample of Google. The coding question is: Given a zero-indexed array A of N integers, return any of the indexes P of the element, which left sums of its left elements and right elements are equal. Sum of zero element is assumed to be equal to 0. This can happen if P = 0 or if P = N-1.For example, A = {-1, 3, -4, 5, 1, -6, 2, 1}, indexes 1, 3, and 7 are valid outputs.
avatar

Software Engineer

Interviewed at Google

4.4★
Jun 23, 2016

It's the first OA coding sample of Google. The coding question is: Given a zero-indexed array A of N integers, return any of the indexes P of the element, which left sums of its left elements and right elements are equal. Sum of zero element is assumed to be equal to 0. This can happen if P = 0 or if P = N-1.For example, A = {-1, 3, -4, 5, 1, -6, 2, 1}, indexes 1, 3, and 7 are valid outputs.

Viewing 721 - 730 interview questions

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