• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

December 14, 2014 by Dhaval Dave

Consider above question with specific input.
Consider a series in which 8 teams are participating. Each team plays twice with all other teams.
4 of them will go to the semi final.
Minimum and Maximum how many matches should a team win, so that it will ensure that it will go to semi finals ?


Solution :
Lets consider that with each win , team gets 1 point.
8 teams play match against each other so 56 matches, so series consist of 56 points

Lets distribute and find minimum and maximum..
Say Teams are T1,T2….T7,T8.

To calculate Maximum points that a team can win and qualify for finals, lets best case consider scenario.

T8 wins all games and gets 14 points.
T7 wins all against T0 to T6 looses against T8 only, so T1 has 12 points
like wise …
T6 : 10
T5 : 8
T4 : 6
T3 : 4 (Won against T1,T0)
T2 : 2 (Won just against T1)
T1 : 0 (Lost all matches)

So Maximum a team can have is 14 points
If N teams are participating : TN team wins all 2*(n-1) games so 2*(n-1) points.
Where 2 is number of time each team plays against other team.

To Calculate Minimum points…Lets  consider worst case scenario

redistributing above mentioned points

T8 : 10
T7 : 10
T6 : 10
T5 : 10
T4 : 10
T3 : 4
T2 : 2
T1 : 0
This is most worst case that can happen but as in semifinals only 4 team goes,
minimum can be 11 points as follows

T8 : 11
T7 : 11
T6 : 11
T5 : 11
T4 : 6
T3 : 4
T2 : 2
T1 : 0

So Minimum is 11, so that a team will surely go into semifinals….

Now lets consider scenario where with minimum points a team qualified for semis.

T8 : 14
T7 : 13
T6 : 12
T5 : 5
T4 : 3
T3 : 3
T2 : 3
T1 : 3

Here Team 5, could get just 5 but could qualify for Semis.

Comment for any other options..

Question was asked in Kony Labs Interview for SDE-I.

Similar Articles

Filed Under: Adobe Interview Questions, Interview Questions, problem Tagged With: Puzzle

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Implement a generic binary search algorithm for Integer Double String etc

Advanced SQL Injection

Amazon Interview Experience – SDE Chennai

Length of the longest substring without repeating characters

Given Set of words or A String find whether chain is possible from these words or not

FizzBuzz Solution C C++

Print vertical sum of all the axis in the given binary tree

Find loop in Singly linked list

Flipkart Set 1 On Campus with Answers

Trapping Rain Water

ADOBE Aptitude C Language Test

Code Chef PRGIFT Solution

Find Percentage of Words matching in Two Strings

LeetCode : Word Search

Templates in C++

Interfaces in C++ (Abstract Classes in C++)

Level order traversal in Spiral form

flattens 2 D linked list to a single sorted link list

Best Java Book | Top Java Programming Book for Beginners

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Knight Tour Problem (Graph – Breadth First Search)

Difference between a LinkedList and a Binary Search Tree BST

Find min element in Sorted Rotated Array (With Duplicates)

Mirror of Tree

Stock Buy Sell to Maximize Profit

Given a string, find the first character which is non-repetitive

BFS (Breath First Search)

Binary Tree in Java

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Copyright © 2026 · Genesis Framework · WordPress · Log in