1. Given an unlimited stream of characters, that can only be read one character at a time, using a specific function (e.g. getChar()), and a list of patterns (e.g. "cat", "dog", "man"), write an algorithm to find all the occurrences of the patterns in the stream. 2. Perform a "test run" of the algorithm in order to assess strong points, weak points and, eventually bugs. 3. Give an estimate of the temporal complexity of the proposed algorithm (e.g. O(x))
Graduate Developer Interview Questions
2,022 graduate developer interview questions shared by candidates
Given a list of words, group them by anagrams of each other.
Tell me about a situtation when you had conflict with colleague and you had to work with him, how to you handled conflict?
Given the list of hotels and list of keywords and multiple reviews for multiple hotels, sort hotels by number of keywords in their combined reviews
What do you know about capgemini What have capgemini done differently to their competitors
What is your strongest programming language? How do you solve problems when you're completely stuck and Stackoverflow can't help? For one of your projects, what have you done to ensure backend API calls are completed in a time efficient manner?
Java related interview questions and relevant background questions.
Implement a hash table.
Produce pseudo-code for a blackjack style game, and optimize it so that a computer has a higher than 50% chance of winning.
Blackjack question. Design a protocol to solve communication problems in an imaginary world
Viewing 1631 - 1640 interview questions