Programming Interview Questions

3

of 3 votes

3
Answers
A soccer league has n matches with A,B,C teams with number of goals scored by each team in each match.If a team wins against another team ,It gets 3 points and lost team gets 0 point.If a tie ,both team gets 1 point.Now how do you frame the ranking of teams.

1) All teams played n matches.
2) A team 1 match,B Team 2 matches, 3 team 3 matches.Like wise it goes.

They looked for coding and data structure techniques.
- sriramMS in United States | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm Data Structures
0

of 2 votes

12
Answers
A log file which has user details(user ID,timestamp) and pages visited in a particular day by that user.The next day -the same kind of log file gets generated.How do you find the probability of users who logged in consecutive days out of the second day - logged in users? The question is simple,but they look for the efficient data structure and time complexity.
- sriramMS in United States | Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm Application / UI Design Arrays Assembly Automata Behavioral Bit Manipulation Brain Teasers C C# C++ Cache Coding Data Mining Data Structures

Page:

1

Comment hidden because of low score. Click to expand.

0

of 0 vote

@bhargav : In that case you can use Arraylist

- sriramMS December 24, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

0

of 0 vote

Its a great and simple idea.
you can use Hashmap to save frequency of page sequence with this idea.That gives o(1) for lookup

@perlscar:User info not needed as per the question

- sriramMS December 20, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

1

of 1 vote

use GSP Algorithm.

Its a datamining technique to find sequential patterns.

set limit to 3

- sriramMS December 19, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

0

of 0 vote

The idea is great,and feasible too.But do yout hink that it will sum up values of each row's next path value.?

You could return the sum by
b[i][j]+= max(a[i+1][j-1],a[i+1][j] , a[i+1][j+1] );

was wondering..

- sriramMS December 19, 2012 | Flag Reply

Comment hidden because of low score. Click to expand.

0

of 0 vote

use BST for looking up the value of input.
get the pointer to that node.
pass the pointer as root node to minimum value function of BST.
minimum value function must use node->left recursively to find min value
return output

- sriramMS December 19, 2012 | Flag Reply

Page:

1

10
Rep
DarshWilliams, abc at 8x8

Exceptionally dedicated and professional Academic Advisor with a superb record of student support and satisfaction. Read about dua to put ...
0
Rep
angeljperez232, Animator at ADP

Hello,I am a Marketing Manager. And I have 2+ experience in Marketing Manager.I like to read about vashikaran ...
0
Rep
RutviLopez, abc at A9

I have demonstrated skills in written communication with multiple award winning pieces and a strong willingness to revise and edit ...
0
Rep
MiaDavis, abc at 8x8

I have excellent communication skills that allow me to effectively lead my team and convey my ideas to them so ...
0
Rep
EmilRuiz, Data Engineer at Apple

Emil , an Experienced producer has been producing top-rated shows for five years running. Excels at defining and expanding target audience ...
0
Rep
MaryMartinez, Jr. Software Engineer at Automated Traders Desk

I am Mary, a knowledgeable sports official skilled at maintaining a safe environment for both players and observers, inspecting the ...
0
Rep
RoseLeen, abc at 8x8

I am a strongly seasoned and handworking entry level graphic designer with extraordinary creative thinking and project design abilities. I ...
0
Rep
PrishaDavin, abc at 8x8

I promote and provide extraordinary internal external guest services, answer questions, offer information, and provide assistance in a courteous manner ...
0
Rep
jd5636176, Area Sales Manager at Achieve Internet

I am currently in the tool and die maker in Titania to start my career. I work from engineering drawings ...

CareerCup

sriramMS

Books

Videos

Resume Review

Mock Interviews