Hardest Coding question asked to me in the entire process. Given an Array of digits 1-9, 0 excluding and a number N Find how many numbers can be formed such that it is less than or equals to N. Digits can be repeated. Eg: Arr - {1,4,9} N - 10 Ans - 3 since (1, 4, 9) Arr - {1,3,4,5} N - 100 Ans - (1,3,4,5,11,13,14,15,33 ............. )
In GD the quest was to choose between smart work and hard work
Ha 100 piani e 2 arance. Vuole scoprire con il minor costo qual è il primo piano del palazzo dal quale le arance cominciano a rompersi se lanciate da quella altezza.
C programming: fairly easy pointers and allocation stuff Low-lvl programming: Hamming distance, floating point
Maximum sum subarray problem on leetcode
How to control the process of finding and fixing bugs
¿Diferencia entre structs y clases?
where do you see yourself in 5years...
Name one good and bad experience you had in your college.
Different data structures
Viewing 491 - 500 interview questions