Here comes the solutions of various levels of the game "Hacked". Its available in Android Play Store- The first coding game on smart phones.
Solutions for various levels and corresponding sub levels are given below which can be referred if needed. Go, enjoy the game.
THE HACKPAD
Increment me
input + 1
Positive
input > 0;
Absolute
if input < 0 {
return -input;
}
return input;
Absolute 2
abs(input);
HIGH SCHOOL HACK
Power
while var_a < input {
var_b = var_b + input;
var_a++;
}
return var_b;
Power 2
pow(input,2);
Length
foreach var_a in input{
var_b++;
}
return var_b;
Push it
var_a = [];
while var_b < input {
var_a.push(var_b);
var_b++;
}
return var_a;
JAIL BREAK
Max
foreach var_a in input{
if var_a > var_b {
var_b = var_a;
}
}
return var_b;
Max 2
foreach var_a in input{
var_b = max(var_b,var_a);
}
return var_b;
This is Odd
while input > 1 {
input = input - 2;
}
return input;
A man, a plan, a canal, panama
foreach var_a in input{
if var_a != input.pop{
return false;
}
}
return true;
CHEATCODE
Bringing come order
while var_a <input.length {
var_b = var_a + 1;
while var_b <input.length {
if input[var_b] <input [var_a] {
var_c = input[var_b];
input[var_b] =input[var_a];
input[var_a] = var_c;
}
var_b++;
}
var_a++;
}
return input;
Missing numbers
var_a = [];
foreach var_b ininput.sort {
while var_b != var_c {
var_a.push(var_c++);
}
var_c++;
}
return var_a;
Anagrams
var_a = "";
foreach var_b in input{
if var_a != var_b.sort&& var_a != "" {
return false;
}
var_a = var_b;
}
return true;
CORRUPTED
110101110101000101
var_a = input.length-1;
while var_a > -1 {
var_b = var_b +input[var_a]* pow(2,input.length - var_a - 1);
var_a--;
}
return var_b;
Prime
if input == 1 {
return false;
}
var_a = 2;
while var_a < input {
if mod(input, var_a) == 0 {
return false;
}
var_a++;
}
return true;
Number in order
while var_a <input.length - 1 {
if input[var_a] >input[var + 1] {
return false;
}
var_a++;
}
return true;
CYBER ATTACK
Complete
while var_a < input.length {
var_b = var_a;
while var_b != input[var_a] {
input.insert(var_a++, var_b++);
}
return input;
}
Match
if input[0] == ")" {
return false;
}
foreach var_a in input{
if var_a == "(" {
var_b++;
}
else {
var_b--;
}
}
return var_b == 0;
Rotate
return input.push(input.remove(0));
NUCLEAR PLANT
Add one
while var_a<input.length{
input [var_a]=input [var_a]+1;
}
return input
Positivity
var_b = [];
foreach var_a in input{
var_b.push(var_a > -1);
}
Neareat to [0,0]
function f1: var_a {
return var_a[0] + 1 *var_a[1] + 1;
}
foreach var_a in input{
if var_b == 0 || var_b> f1(var_a) {
var_c = var_a;
var_b = f1(var_a);
}
}
return var_c;
KILLER ROBOT
Addition
function f1: var_a {
foreach var_b in var_a {
var_c = var_c * 10 + var_b;
}
return var_c;
}
var_b = f1(input[0]) + f1(input[1]);
var_a = [];
var_c = var_b / 10;
if var_c > 0 {
var_a.push(var_c);
}
var_a.push(mod(var_b, 10));
Match2
var_a = [];
foreach var_b in input{
if var_b == "(" || var_b == "[" {
var_a.push(var_b);
}
else {
if var_a.length == 0 {
return false;
}
var_c = var_a.pop;
if var_c == "(" && var_b != ")" {
return false;
}
if var_c == "[" && var_b != "]" {
return false;
}
}
}
return var_a.length == 0;
SKYNET
Tree
function f1: var_a,var_b {
if var_b.is_list {
while var_b.length > 0 {
f1(var_a,var_b.remove(0));
}
}
else {
var_a.push(var_b);
}
return var_a;
}
f1([], input);
RETIREMENT
Draw
draw(input [0], input[1]);
Comments
Post a Comment