(public).sospep.events ~ view task ~ CREATE-article-tech-interview-problem-questions

<h1 style="text-align: center;">CREATE-article# #</h1>
<h2>[previously]</h2>
<ol>
<li>[2017-01-dd][00:00] NEW task IN ?</li>
<ol>
<li>] # # - CREATE-article# #&nbsp;</li>
</ol>
<li>[00:00] NEW article IN&nbsp;</li>
<ol>
<li>] # # -&nbsp;</li>
</ol></ol>
<h2>[currently]</h2>
<ol>
<li>] &nbsp;</li>
</ol>
<h2>[next]</h2>
<ol>
<li>]</li>
</ol>
&nbsp;
PRB - 00n -
 REF = https://www.youtube.com/watch?v=lD-LuK_VGZI
Array [, 1,2, 3, 4,5,7,9,33,-5,] Find 2 numbers that when multiplied together will equal 20 &gt; 1] Figure it out solution to problem on &ldquo;paper&rdquo; before coding, ex SOL 1
- look at first number in array
- determine the 'multiplier' that firstNumber would need to get to desired sum
- search balance of array for matchingNumber
- if matchingNumber found, return pair()
- else moveNextNumber, repeat process
&nbsp;ex SOL 2, larger array of numbers
- put each uniqe nu
&gt; 2] translat into data structures and algorithms
------------
description: function that takes array of numbers and returns 2 elements that will multiply to twenty
takes:array of numbers
returns: 2 numbers
&nbsp;
function returnTwoNumbersThatMultipliedEqualTwenty(arrayNumbers){
for ( i =0,i&lt; arrayNumbers.length, i++){ &nbsp;&nbsp;
&nbsp; firstNumber = arrayNumbers[0];
&nbsp; matchNumber = firstNumber / 20;
&nbsp;for (j = i+1, J &lt; arrayNumbers.length, j++){
&nbsp;&nbsp;&nbsp;&nbsp; if (arrayNumbers[j] === matchNumber){
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; matched = [];
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; matched.push(firstNumber);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; matched.push(matchNumber);
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; return matched;
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; }
&nbsp;&nbsp;&nbsp;&nbsp; /*else{
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; j++;
&nbsp;&nbsp;&nbsp; }*/
&nbsp;&nbsp; }
}
} // END function
&nbsp;
<hr />
&nbsp;
&nbsp;
pRB - 002 - twenty five horses
REF = https://www.youtube.com/watch?v=i-xqRDwpilM
&nbsp;
my solution on Paper ( before watching video)
- 25 totalHorses / 5 maxHorsesPerRace = 5 races, produce 5 raceWinners
- totalRaces = 5
- 5 raceWinners&gt; race &gt; move winner into fastest5Set[], remove from winnnerSet, note originating set , remove all winners from originating sets
- totalRaces = 6
- race 5 sets of 4 horses &gt; move winners into winnersSet[]
- totalRaces = 11
- race set of remaining 4 horses from winnerRound1.set &gt; move winner into winnersSet[]
- totalRaces = 7
- race winnersSet[] &gt; move winner into fiveFastestSet[] as #2 of 5, note originating set, remove winner from winnersSet, from originating set
- race originatingSet of winner ( ex set3)
- totalRaces = 8 
- move winner into winnersSet, remove from originating set
- race winnersSet[] &gt; move winner into fiveFastestSet[] as #3 of 5, note originating set, remove winner from winnersSet, from originating set
- totalRaces = 9
- repeat 2 more times for&nbsp; total of 11 races

~ view task ~ TaskGroup] CD-input-Q FROM [ Plan] planning IN [ calendars] technology-developer-software