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
Why is a manhole cover round?
Why should we hire you?
1.add only even number from given array 2.unique character string 3.decimal to binary conversion 4.palindrome string
1. Reverse character array without affecting special character in single loop. 2. given 2 character array S1 , S2 and 1 empty array S3. Populate S 3by interleaving character from S1 and S2
Russian roulette brain teaser: Interviewer takes an imaginary revolver gun with 6 empty chambers, and loads 2 adjacent chambers with bullets. Interviewer has the first turn: rolls the cylinder, puts it to his head, and pulls the trigger... no shot. The lucky interviewer passes the gun to you and gives you two options before you put the gun to your head and pull the trigger: (a) to roll the cylinder again or (b) not to roll the cylinder Which option would you choose?
4.Write a C/C++ program to print the pattern for the given value N. For example N=5 55555 45555 43555 43255 43215 54321
Populate an array of numbers from 1 to N (inclusive). Given two numbers, p and q , if a number in the array is divisible by p print OUT, if a number is divisible by q print THINK. If number is divisible by both p and q, print OUTTHINK. Otherwise, print the number.
It takes 15 minutes to fill a tank from a tap and 40 minutes to enpty it from the sink . If both are open how long will it take to fill the tank . Capacity of tank is 400 gallons
Suppose there is a rectangular map where you can only travel up or right to go from a start location in the bottom left corner to the top right corner, and each move is discrete. Write a program that prints all possible solutions to get from the start to finish.
Viewing 71 - 80 interview questions