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.
1.Given two words find if they contains the same letters , if one letters occurs multiple times in word then second word also should have the number same number of times. eg: little and title are different, das and sad are equals. 2. Rearrange all the letter of a word in ascending order while removing the duplicate letters. eg:- letter should be printed elrt.
What is the angle between the two arms of the clock at 2:40?
Ios related question multi thread etc
Sort a array, [W B W B B W W B ] === [W W W W B B B B ]
1. IsAnagram 2. Count unique substring of length k
Write a function that returns true when number of things (N) can be precisely divided into boxes of 6, 9 and 20 => N = 6x + 9y + 20z
There are n pots with different # gold coins in them. Two players play a game, where each player can select a pot at either ends. maximize the gold
You are given an array that represents bills in certain currency (For example 1, 2, 5, 10) and an amount, for example 17. You should output the number of possible combinations of bills that sum to the given amount. For example, {10, 5, 2} is valid combination, {10, 5, 1 ,1} also. I did not ask questions like does the order of bills matter, i.e. is {10, 5, 2} same as {2, 10, 5}.
what's wrong with the following code : <template type T > T accumulate ( vector<T> in) { T total = in[0]; for (int i =0; i < in.length() ; i++) { total = total + in[i]; } return T }
Given n numbers (P1,P2,P3,.....Pn). Divide them in m contiguous partitions such that the sum of the maximum is minimum. For e.g. (5,1,4,2,3) and m =2 then (5,1)(4,2,3)
Viewing 341 - 350 interview questions