• 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

Linked List V/S Binary Search Tree

Get K Max and Delete K Max in stream of incoming integers

Serialise Deserialise N-ary Tree

The Magic HackerEarth Nirvana solutions Hiring Challenge

SAP Off Campus Hiring_ March 2015 Computer Skills

How Radix sort works

SAP Hiring Off-Campus General Aptitude

Python String and numbers

Printing each word reverse in string

Edit Distance ( Dynamic Programming )

ADOBE Aptitude C Language Test

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

Length of the longest substring without repeating characters

Find min element in Sorted Rotated Array (Without Duplicates)

Find two non repeating elements in an array of repeating elements

Subset Sum Problem Dynamic programming

Code Chef PRGIFT Solution

Convert number to words java

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Regular Expression Matching

Find if a binary tree is height balanced ?

Wrong Directions given find minimum moves so that he can reach to the destination

FizzBuzz Solution C C++

LeetCode: Container With Most Water

C Program for TAIL command of UNIX

Adobe Interview Questions 8 month Exp

Urban Ladder Written Test.

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

Binary Tree in Java

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Copyright © 2026 · Genesis Framework · WordPress · Log in