/* * Suppose we have a sorted array in ascending order, with no duplicates: * * {1, 2, 3, 4, 5, 6, 7} * * Somehow an unknown amount of numbers at the beginning are shifted to the end, * creating an array that looks like: * 0 1 2 3 4 5 6 * {3, 4, 5, 6, 7, 1, 2} * * Let us call the new array a shifted cyclic array. * * Now, given a Shifted Cyclic Array int a[], and its length n (> 0), write a function * to find the smallest number in the array. */
# n=3 * * * @ * @ * @ * * * #n=5 * * * @ * * * @ * * * @ * * * @ * * * @ * * * somewhat similar to these !
Giving an array of numbers and an int, return true if is there any pair of numbers inside the array that summed is equal to the input int, otherwise return false.
Given a race track with 5 lanes, 25 bunnies, and no timer, how many races are required to find the top 3 fastest bunnies?
Met twee tabellen gebruikers(id, naam, achternaam..) and Reservaties(id, gebruiker_id, ...) maak een SQL-onderzoek en selecteer welke gebruikers geen reservaties hebben gemaakt met JOINS
How immediately you can join
Make recipe APIs for HelloFresh
There was written test which included 60 aptitude questions and 20 technical questions. In interview, below were the questions I remember : for input : 3 5 4 1 2, below is the output -*--- -**-- ***-- ***-* ***** Write program for it
Basic questions about family, education, projects, placement. And a little discussion on the answers of sql and java programs that were given in the previous round.
Write Logic for below scenario with minimal loops * * * * * * * * * * * * * * * * * * * * *
Viewing 211 - 220 interview questions