mock test

Author: prabaprakash

Mock Test/1.md

@@ -0,0 +1,32 @@
+// IMPORT LIBRARY PACKAGES NEEDED BY YOUR PROGRAM
+// SOME FUNCTIONALITY WITHIN A PACKAGE MAY BE RESTRICTED
+// DEFINE ANY FUNCTION NEEDED
+// FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED
+```
+function cellCompete(states, days)
+{
+   let ar = []
+   while(days--){
+   for(var i=0;i<states.length;i++){
+       if(i===0){
+           a=0;
+       }else{
+            a=states[i-1];
+       }
+       if(i===states.length -1){
+           b=0;
+       }else{
+           b=states[i+1];
+       }
+       ar[i] = a ^ b;
+   }
+ states = ar;
+ ar = [];
+   }
+   return states;
+  
+}
+```
+// Eight houses, represented as cells, are arranged in a straight line. Each day every cell competes with its adjacent cells (neighbors). An integer value of 1 represents an active cell and a value of 0 represents an inactive cell. If the neighbors on both the sides of a cell are either active or inactive, the cell becomes inactive on the next day; otherwise the cell becomes active. The two cells on each end have a single adjacent cell, so assume that the unoccupied space on the opposite side is an inactive cell. Even after updating the cell state, consider its previous state when updating the state of other cells. The state information of all cells should be updated simultaneously.
+
+<div ng-if="data.isUserTestCase === 0" ng-bind-html="data.testCases.content" class="ng-binding ng-scope"><b>Testcase 1:</b><br><b>Input:</b><br><pre>[1, 0, 0, 0, 0, 1, 0, 0], 1</pre><br><b>Expected Return Value:</b><br><pre>0 1 0 0 1 0 1 0</pre><br><hr><b>Testcase 2:</b><br><b>Input:</b><br><pre>[1, 1, 1, 0, 1, 1, 1, 1], 2</pre><br><b>Expected Return Value:</b><br><pre>0 0 0 0 0 1 1 0</pre></div>

Mock Test/2.md

@@ -0,0 +1,32 @@
+
+// IMPORT LIBRARY PACKAGES NEEDED BY YOUR PROGRAM
+// SOME FUNCTIONALITY WITHIN A PACKAGE MAY BE RESTRICTED
+// DEFINE ANY FUNCTION NEEDED
+// FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED
+```
+function gcd(a,b) {
+    if(b === 0) {
+     return a;
+     }
+    return gcd(b, a%b)
+  }
+  function generalizedGCD(num, arr)
+  {
+     let f = arr[num-1];
+     
+     for(let i=num-2;i>=0;i--) {
+         f = gcd(f,arr[i]);
+     }
+  return f;
+  }
+  // FUNCTION SIGNATURE ENDS
+```
+<div class="tabData" ng-show="data.currentTab == 0">
+            <span ng-bind-html="data.directions" class="direction_light_automata ng-binding"><p>The current selected programming language is <strong>JavaScript</strong>. We emphasize the submission of a fully working code over partially correct but efficient code. Once Test is <strong>submitted</strong>, you cannot review this problem again. You can use <em>console.log</em> to debug your code. We use <strong>NodeJS 10.13</strong> to evaluate your code.</p></span>
+            <br><br>
+            <div compile="data.questionStatement"><p class="ng-scope">The greatest common divisor (GCD), also called highest common factor (HCF) of N numbers is the largest positive integer that divides all numbers without giving a remainder.<br><br>Write an algorithm to determine the GCD of N positive integers.</p><p class="ng-scope"><strong>Input</strong><br>The input to the function/method consists of two arguments -&nbsp;<br><em>num</em>, an integer representing the number of positive integers (N).&nbsp;<br><em>arr</em>, a list of positive integers.</p>
+<p class="ng-scope"><strong>Output</strong><br>Return an integer representing the GCD of the given positive integers.<br><em><br></em><strong>Example<br></strong><span style="font-weight: 400;">Input:<br></span><em><span style="font-weight: 400;">num</span></em><span style="font-weight: 400;">&nbsp;= 5&nbsp;<br></span><em><span style="font-weight: 400;">arr = </span></em><span style="font-weight: 400;">[2, 4, 6, 8, 10]</span></p>
+<p class="ng-scope"><span style="font-weight: 400;">Output:<br></span>2</p>
+<p class="ng-scope"><span style="font-weight: 400;">Explanation:<br></span>The largest positive integer that divides all the positive integers 2, 4, 6, 8, 10 without a remainder is 2. <br>So, the output is 2.</p></div>
+            <!-- ngIf: data.externalUrl -->
+        </div>