Find a cycle in an array: You are given an integer array of size N. Every element of the array is greater than or equal to 0. Starting from arr[startIndex], follow each element to the index it points to. Continue to do this until you find a cycle. Return the length of the cycle. If no cycle is found return -1 Examples: countLengthOfCycle([1, 0], 1) == 2 , countLengthOfCycle([1, 2, 0], 0) == 3
Implement an intersection method for two lists. After showing a brute force method, I was asked to improve upon the method and analyze time complexity for both algorithms.
As part of the assignment, I implemented and automated a daily email service that sends the latest XKCD comic to all subscribed users.
If a clock has 360 degrees and its 3:15 how many degrees are between the minute and the hour hand.
Newton's Third Law
There were a couple of difficult situational questions but due to the nature of the questions it would be very easy to identify me if I were to post them here.
Solve: char a=(0x04|0x0B&0x02|0x08);
What do you know about Scientific Games?
What does this mean: #define X 10?
What is array? What is map?
Viewing 151 - 160 interview questions