## Twitter Interview Question for Interns

Country: United States

Comment hidden because of low score. Click to expand.
0
of 0 vote

I assume by "less than k value" you mean "less than or equal", due to your given outputs.

Anyways, here goes:

``````import java.util.*;

public class Test1{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
System.out.println("Length: ");
int len = in.nextInt();
int[] a = new int[len];
for(int i = 0; i<len; i++){
System.out.println("Element " + i + ": ");
a[i] = in.nextInt();
}
System.out.println("Max sum: ");
System.out.println(maximumLength(a,in.nextInt()));
}

public static int maximumLength(int[]a, int k){
PriorityQueue<Integer> heap = new PriorityQueue<Integer>();
for(int item: a){
}
int sum = 0;
int numElements = 0;
while(sum <= k && !heap.isEmpty()){
int item = heap.poll();
System.out.println("Polled " + item);
if(sum + item <= k){
sum+= item;
numElements++;
}
else{
break;
}
}
return numElements;
}
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````import java.util.*;

public class Test1{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
System.out.println("Length: ");
int len = in.nextInt();
int[] a = new int[len];
for(int i = 0; i<len; i++){
System.out.println("Element " + i + ": ");
a[i] = in.nextInt();
}
System.out.println("Max sum: ");
System.out.println(maximumLength(a,in.nextInt()));
}

public static int maximumLength(int[]a, int k){
PriorityQueue<Integer> heap = new PriorityQueue<Integer>();
for(int item: a){
}
int sum = 0;
int numElements = 0;
while(sum <= k && !heap.isEmpty()){
int item = heap.poll();
System.out.println("Polled " + item);
if(sum + item <= k){
sum+= item;
numElements++;
}
else{
break;
}
}
return numElements;
}
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````static int maximumLength(int[] a, int k) {
int sum = 0;
for(int i=0; i<a.size(); ++i) {
if (sum+a[i] < k) {
sum +=a[i];
}
}
return sum;
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

``````static int maximumLength(int[] a, int k) {
int sum = 0;
for(int i = 0; i < sizeof(a)/sizeof(a[i]); ++i)  {
if (sum + a[i] < k)  {
sum += a[i];
}
}
return sum;
}``````

Comment hidden because of low score. Click to expand.
0
of 0 vote

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.