CareerCup

public static long[] GetTheArray(int num)
        {
            if (num == 0)
                return null;
            
            long[] result;

            if (num == 1)
            {
                result = new long[1];
                result[0] = 1;
                return result;
            }

            int multiplier = 2;
            result = new long[num / 2];
            result[0] = 1;

            for (int i = 1; i < num; i++)
            {
                int prev = (int)result[i - 1];
                int next = prev * multiplier;

                if (next <= num)
                {
                    result[i] = next;
                }
                else
                {
                    break;
                }
            }
            return result;
        }

-------------------------------------------------------------------------------------
Questions:
1. How do I reduce the result array size? I took an initial array size of num /2 since it will never exceed the num /2 size. But how do we optimize it more?
2. Is this function thread safe if multiple users access this function at the same time?

while( true ){
if( (i & ~( k-1 )) > 0){
System.out.println(" " + k);
}
if( k>i)
break;

k=k<<1;


}

where i is the input.

int k = 0;
while( 1 << k < num)
 print(1<<k);
 k++;

int power = Math.floor(log(num)/log(2));
long numbers[power+1];
for (int i=0; i<=power; i++){
   numbers[i] = Math.pow(2,i);
}

IEnumerable<int> Gen()
{
int n = 1;
yield return n;
while(true)
{
yield return (n *= 2);
}
}

void main()
{
int limit = 300;
var answer = Gen().Where(n => n < limit).ToArray();
}

void printsquare(int num)
{
assert(num >= 0);
int shift = 0;
while(num)
{
printf("%d\n",1 << shift);
num = num >> 1;
shift++;
}

}

int num=1;


  while( num <= LIMIT )
   {
        print( num );
        num<<=1;
   }

static int[] container;
static void Main(string[] args)
{
int i = 2, k =0;
int num =300;
container = new int[30];
container[k++] = i;
while (true)
{
i = i << 1;
if (i < num)
{
container[k++] = i;
}
else
{
break;
}
}
for (int j = 0; j < k; j++)
{
Console.WriteLine(container[j]);
}
Console.ReadKey();

int i=300;
	int ii=1;

	while(i)
	{
		cout<<ii<<endl;
		ii=ii*2;
		i=i>>1;
	}

#include<stdio.h>

int main()
{
int num = 256;
int res = 1;

while(res <= num)
{
printf("%d ", res);
res = res << 1;
}
}

basically u cant able to reurn the whole array in c
like int[]func(int,int) is invalid in c in java we can retun this so i think indirectly interviewerv want to check that knowledge of interviwee
otherwise the question is relly simple and not the level of amazon.com