Two trains, each moving at 20 miles per hour towards each other, are initially 60 miles apart. A bee starts at the front of one train, flies to the other train, then back to the first train, and so on. If the bee always flies at 30 miles per hour, how far does the bee fly before the trains collide?
given : [126,125,67,28, 658] expected: [9, 8, 13, 10, 19] without using a 2 loops
Write a program takes in a string and a delimiter, and uses that delimiter to split a string and then will reverse the characters in every word (or jumble of characters between the delimiters), stuffing them back into a string when finished. ('The dog walks' becomes..... 'ehT god sklaw')
Why is a manhole cover round?
finding a missing number in a continuous number sequence.
Create monolithic sublists from an array of integers ,in increasing order for example [1,2,4,7,5,6,3,2] will give [[1,2,4,7][5,6],[3],[2]]
Given any number of arrays containing numbers, write a function which finds the numbers that appear in exactly two arrays. arrays = [ [6, 2, 2, 0, 4], [5, 0, 2, 6, 7, 1], [6, 7, 9, 9], ] find_in_two(arrays) should return [2, 0, 7]
input log = [ { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 5}, { 'user': 'A', 'page': 2}, { 'user': 'A', 'page': 1}, { 'user': 'B', 'page': 2}, { 'user': 'C', 'page': 7}, { 'user': 'C', 'page': 3}, { 'user': 'A', 'page': 3}, { 'user': 'C', 'page': 1}, ] please implement discover_site_map(log) discover_site_map returns a representation of the links between pages, using whatever data structure you think is suitable: 1 -> 2, 3 2 -> 1 3 -> 1 5 -> 2 7 -> 3
What can you do to a method in a parent class so that it's not overriden by a method in child class with same name?
Why Syntel ?
Viewing 1001 - 1010 interview questions