How would you implement a sparse array (key could be any integer, but only a few would be used) with limited memory.
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?
711,030 programador sql interview questions shared by candidates
Extract the N largest floating point numbers from a large file of floating point numbers.
Given an array of integers, all but one of which appears an even number of times, find the one integer which appears an odd number of times. Upon completion, asked to improve the algorithm in terms of both time and space, eventually asked to do it in O(n) time and constant space.
2. You have an array (size is not known) and whose elements are having the values from 0-> 99. Find out the three largest elements in that array and return those.
Find the numbers in an array that appear an odd number of times.
Given the word "HEAD" and the word "TAIL," write code and/or describe using computer science algorithms how you would transform from the word HEAD to the word TAIL. Each change must be by only one letter, you cannot change the letter in a given position twice, and each new word must be a valid word.
Given an integer array which consists of numbers from 1 to N with 1 number missing find the missing number. What will you do if 2 numbers are missing?
Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.
Implement a Queue using 2 Stacks
Given an integer, re-arrange the integer such that first and last digit will be at first and second, second and second last digit will be at third and fourth position from left of the re-arranges integer and so on. Example: Input -> 12345678, Output -> 18273645 Input -> 1234567, Output -> 1726354
Viewing 1101 - 1110 interview questions