Code Hunt Solutions 2

2.01 - int [] a = new int [n];
for(int i = 0; i < n; i++){
a [i] = i;
}
return a;
2.02 -  int [] a = new int [n];
for(int i = 0; i < n; i++){
a [i] = i*n;
}

return a;
2.03 -  int [] a = new int [n];
  for(int i = 0; i < n; i++){
  a [i] = i*i;
  }

  return a;
2.04 - int result = 0;
foreach(var i in v){
result += i;
}

return result;
2.05 - int r = 0;
for(int i = 0; i < n; i++)
r += (i*i);

return r;
2.06 -  int count = 0;
foreach(char c in s){
if (c == 'a'){
count++;
}
}
return count;
2.07 - int r = 0;
foreach(char x in string s){
r++;
}
return r;

Code Hunt Solutions 1

1.01 - -x
1.02 - x-2
1.03 - x*x
1.04 - x*3
1.05 - x/3
1.06 - 8 / (x*2)
1.07 - x-y
1.08 - y*2 + x
1.09 - x*y
1.10 - (y/3) + x
1.11 - x/y
1.12 - x%3
1.13 - x%3 + 1
1.14 - 10%x
1.15 - (x+y+z) /3