Items are pushed onto a stack, and therefore may be accessed in a last-in-first-out (LIFO) manner. How might you access these items in a first-in-first-out (FIFO) manner?
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
An array has negative and positive numbers. Separate the numbers such that negative numbers are at the beginning and positive numbers at the end without changing the order. You cannot sort it. Explain with O(1) space
We're playing a game of Russian Roulette. I take 2 consecutive bullets out of the 6 bullet revolver and spin the chamber. I go first and shoot the bullet at my head, which misses. I then pass the gun to you, where you have the option of spinning the chamber, or shooting. Which would you do to maximize your probability of not dieing?
Write a code to convert an ASCII representation of a positive integer to it's numeric value.
Say you use SVN for source control..you have several revisions of a file...R1, r2, r3..etc..Someone checked in a bug and the revision became bad..need t find the first bad revision..gave a function findBadRevision(int goodRevision, int badRevision) so for e.g the revisions were GGBB and function passes in 0,4 so the first bad revision is 2. There exists a function boolean hasBug(int revision) which will tell us if a certain revision has a bug. can assume good revision < bad revision
O(n) time O(1) space to print link list reversely.
One question 3 of the interviewers asked me was "What was the most difficult thing you had to deal with.".
1. Give you a data structure Seq class Sqe { int value; Seq nex; } and give you two Seq object seq., seq., compare two objects, return true if there is only one difference or no difference, false if more than two differences. 2. Giving a array which has zero and no-zero elements, move all zero elements to the end and no-zero elements to the begin.
Given a string 12345 and a alphabet to number mapping like a =1, b =2.., y=25, z=26 write a code to find number of possible alphabet strings from the given string. E.x. string 12345 has possible alphabet strings as {lcde,awde, abcde}.
How do you find sequences of consequtive integers in a list that add to a particular number.
Viewing 481 - 490 interview questions