/* Solution's explaination : Understand the question from the post link given in the comment or in HTML tab. Assume 6 teams : a b c d e f so team1 = a; thus making two arrays and a temp variable with whom team1 will play b --- temp variable f a c e d thus Round 1 : a - b c - f d - e now making rotating the outer ring i.e making left array down and right array up ... c b a d f e thus Round 2 : a - c b - d e - f thus now rotating again.. d c a e b f thus Round 3 : a - d e - c f - b and so on...... problem solved !👍 Known bug : repeats after 8. */ alert('Assignment Link :\nhttps://www.sololearn.com/post/116821/?ref=app \n\n My solution\'s explaination in js tab.'); "use strict" window.onload = function () { document.getElementById("entry").style.width="86vw"; document.getElementById("input").style.opacity="1"; } var output,team_num,showOutput; function team() { team_num = document.getElementById("input").value; output = ""; showOutput = document.getElementById("output"); var err = document.getElementById("errorMsg"); err.innerText="" ; if(team_num.length == 0 || team_num.match(/[^0-9]/i)){ err.innerText = "Enter a number !" showOutput.innerHTML = `

Coding challenge :
Given N teams. N should be even. They should play against each other in N-1 rounds.
Build the pairs for each round.

The algorithm is the following: Place T1 in the middle of a circle and T2... TN around it.

In Round i T1 plays against Ti+1. The other pairs are built by those teams which have the same distance to Ti+1.

`; }else{ let teamName = document.getElementById("team_name"); let sec = document.getElementById("section"); teamName.style.visibility = "visible"; sec.innerHTML = "" ; if(team_num%2 == 1){ team_num++; } for(let i=0;i

"; res += t1 + " v\/s " + temp + "
"; for(let i=0;i"; } let a = team_r[0]; team_r = mov_up(team_r); team_r[team_r.length-1] = team_l[team_l.length-1]; team_l = mov_down(team_l); team_l[0] = temp; temp = a; output +="

" + res; } // console.log(team_r); showOutput.innerHTML = output; } //to move an aray forward const mov_down = (arr) =>{ for(let i=arr.length-1;i!=0;i--){ arr[i] = arr[i-1]; } return arr; } //to move an array backward const mov_up = (arr) =>{ for(let i=0;i

Tournament Wizard