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.
how would you design how a cellphone implements its contact list when you press a certain letter. For example, If you press M it will tell you all the names starting with M. then if you press MI it will tell you all names starting from MI and so forth....
We have a log file, can grow pretty big. Each line is a trace-log, and the first field is the RequestID. We need to scan the file, and print all the logs for requests which resulted in error .. 001 <timestamp> BEGIN 001 <timestamp> fetched from db 001 <timestamp> some processing .. 002 <timestamp> BEGIN .. 002 <timestamp> fetched from db 001 <timestamp> returned success 003 <timestamp> BEGIN 001 <timestamp> END 003 <timestamp> some work 002 <timestamp> ERROR 003 <timestamp> some other work
Given a set of points (x,y) and an integer "n", return n number of points which are close to the origin
Given 2 numbers. Find if they are consecutive grey code sequences
Reverse an integer without using string operations.
I got questions like "Given a dictionary of words, how do you calculate the anagrams for a new word".
given non-zero number array A, create array B where B[i] = product of all elements in A except A[i].
First explain what a tree, then binary tree, then a binary search tree is. Now implement a function that verifies whether a binary tree is a valid binary search tree.
Write a code for determining the given integer is palindrome in binaries.
Given an array A of n integers, in sorted order, and an integer x. design an O(n)-time complexity algorithm to determine whether there are 2 integers in A whose sum is exactly x.
Viewing 831 - 840 interview questions