Code Hunt Solutions

The Code Hunt Solutions you Need

Saturday, November 29, 2014

Things were moved. Go find it.
Also, things were fixed so check that out too.

Subscribe to: Posts (Atom)

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 ...
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(in...
Code Hunt Solutions 3

3.01 - int r = 1; for(int i = 0; i < power; i++){ r = r *number; } return r; 3.02 - int r = 1; for(int a = i; a ...
Code Hunt Solutions 8

8.01- public static int Factorial(int x) { if (x == 1) return 1; return x*Factorial(x-1); } public static int Puzzle(int i, int j) { ...
Code Hunt Solutions 6

6.01- return false; 6.02 - string r = ""; for(int i = 0; i < s.Length ;i++){ if (i % 2 == 0){ r += s.Substring(i, ...
Layout Change

Things were moved. Go find it. Also, things were fixed so check that out too.
Code Hunt Solutions 5

5.01 - if (s.Length <= 3){ return "short"; } if (s.Length >= 4 && s.Length <= 7){ return ...
Code Hunt Solutions 7

7.01 - return two+three+one+one+three+two; 7.02 - return s.Substring(0, s.Length/2); 7.03 - return a.Replace(b,c); 7.04 - string w = ...
Code Hunt Solutions 4

4.01 - if (x == true || y == true){ return true; } return false; 4.02 - if(x == false || y == false){ return false; } r...

Name

Email *

Message *

Awesome Inc. theme. Powered by Blogger.