The first coding question was to determine whether a list of integers with size N, contains all the numbers from one to N.
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
Pregunta n.º 1: ¿Qué tipos de claves existen en SQL y cuándo las usarías?
Pregunta n.º 2: ¿Qué tipos de normalización existen en SQL y cuándo los usas?
Pregunta n.º 3: ¿Con qué lenguajes de programación estás familiarizado?
710,433 programador sql interview questions shared by candidates
1. In an array provide pairs of numbers that add to a particular value 2. In fibonacci series provide sum of all even numbers
Find the last element of a linked list.
Coding Challenge 3) You are given a linkedlist with next and arbitary pointers. Create a new linkedlist similar to the given linkedlist. You need to create a code for deep copy of a linkedlist.
Easy quant and java questions
implement a O(1) min function for Stack
Giving a windows size K and an array of size N, find the minimum of each window as it slides through the array.
* You have a data structure of integers, which can be negative, zero, or positive, and you need to support an API with two public methods, insert(int) and getmedian(). Describe a data structure you would use to support this API and describe the running time of the two methods. * Imagine you're writing a function that takes an array of integers and an integer and it needs to return true if any pair in the array sum to the 2nd argument. The array can have negative numbers, zero, or positive numbers. Describe how you would design this function and what its running time would be. I ran through the trivial n^2 solution, then modified it to an nlogn and finally to a linear solution.
How would you implement a stack with the additional operation of getMin?
Given a stream of integers of unknown (possibly large) length, how would you pick one at random? Now prove its random.
Viewing 391 - 400 interview questions