Intuit Interview Question for Senior Software Development Engineers


Country: United States
Interview Type: In-Person




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

Arrays.binarySearch(int[] a, int key);
Returns index if exists or -1 otherwise

- venkat2023 October 15, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

Note 2 - should not use any pre-defined methods in java. Write the pseudo code

- sambasivareddy.s October 15, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

Is the array sorted?

- siva October 16, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
1
of 1 vote

public class Driver
{
	public int findnumber(int[] arr , int i)
	{
		int key = 5;
		if(arr[i] == key)
		{
			return i; 
		}
		else
		{
			return findnumber(arr,i+1);
		}
	}
	public static void Main()
	{
		int[] arr = {1,2,5,8,9,10};
		Driver d = new Driver();
		Console.WriteLine(d.findnumber(arr,0));
	}

}

- Ak2711 September 28, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Dumbo solution : Wrap the array into a map, and then do this :

// ZoomBA
// preprocessing 
m = dict ( arr ) -> { [ $.item, $.index ] } 
// subsequently 
idx = item @ m ? m[item] : -1

- NoOne October 16, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Could you please write code in java? Note - we should not use any in-built collection or data structure.

- sambasivareddy.s October 19, 2016 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

int[] intArray={1,2,1};
int num1 = intArray[0];
int num2 = intArray[1];
int num3 = intArray[2];
//to find index of 1
if(num1==1){
System.out.println(0);
}
if(num2==1){
System.out.println(1);
}
if(num3==1){
System.out.println(2);
}

This is basic java without for loop and inbuilt functions..

- Someone January 13, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

int[] intArray = {1,2,2};
int numToFind = 2;
int num1 = intArray[0];
int num2 = intArray[1];
int num3 = intArray[2];
if(num1==numToFind){
System.out.println(0);
}
if(num2==numToFind){
System.out.println(1);
}
if(num3==numToFind){
System.out.println(2);
}else
System.out.println(-1);

- Someone January 13, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Here is the code for you:

import java.util.Arrays;


/**
 * Created by rajive.pai on 2/22/2017.
 */
public class FindIndex {


    public static void main(String args[]){

        Integer[] arr = {12,3,4,55,2,333,566};
        System.out.println(index(arr , 333));


    }

    public static Integer index(Integer[] a, Integer n){

        return Arrays.asList(a).indexOf(n);

    }
}

- Anonymous February 21, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Here is the code for you:

import java.util.Arrays;


/**
 * Created by rajive.pai on 2/22/2017.
 */
public class FindIndex {


    public static void main(String args[]){

        Integer[] arr = {12,3,4,55,2,333,566};
        System.out.println(index(arr , 333));


    }

    public static Integer index(Integer[] a, Integer n){

        return Arrays.asList(a).indexOf(n);

    }
}

- Rajive Pai February 21, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

Here is the code for you:

import java.util.Arrays;


/**
 * Created by rajive.pai on 2/22/2017.
 */
public class FindIndex {


    public static void main(String args[]){

        Integer[] arr = {12,3,4,55,2,333,566};
        System.out.println(index(arr , 333));


    }

    public static Integer index(Integer[] a, Integer n){

        return Arrays.asList(a).indexOf(n);

    }
}

- rajivmailing February 21, 2017 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 votes

public class IntArrayIndex {
	public static void main(String[] args) {
		int[] arr = { 20, 30, 40 };

		// find index for 30
		int returnVal = index(arr, arr.length, 30);
		System.out.println(returnVal);
	}

	public static int index(int[] arr, int n, int value) {
		if (arr[n - 1] == value) {
			return n;
		}
		return index(arr, n - 1, value);
	}
}

- Mac September 03, 2019 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 votes

public class IntArrayIndex {
	public static void main(String[] args) {
		int[] arr = { 20, 30, 40 };

		// find index for 30
		int returnVal = index(arr, arr.length, 30);
		System.out.println(returnVal);
	}

	public static int index(int[] arr, int n, int value) {
		if (arr[n - 1] == value) {
			return n;
		}
		return index(arr, n - 1, value);
	}
}

- Mac September 03, 2019 | Flag
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class IntArrayIndex {
public static void main(String[] args) {
int[] arr = { 20, 30, 40 };

// find index for 30
int returnVal = index(arr, arr.length, 30);
System.out.println(returnVal);
}

public static int index(int[] arr, int n, int value) {
if (arr[n - 1] == value) {
return n;
}
return index(arr, n - 1, value);
}
}

- Mac September 03, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class IntArrayIndex {
	public static void main(String[] args) {
		int[] arr = { 20, 30, 40 };

		// find index for 30
		int returnVal = index(arr, arr.length, 30);
		System.out.println(returnVal);
	}

	public static int index(int[] arr, int n, int value) {
		if (arr[n - 1] == value) {
			return n;
		}
		return index(arr, n - 1, value);
	}
}

- Mac September 03, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class IntArrayIndex {
	public static void main(String[] args) {
		int[] arr = { 20, 30, 40 };

		// find index for 30
		int returnVal = index(arr, arr.length, 30);
		System.out.println(returnVal);
	}

	public static int index(int[] arr, int n, int value) {
		if (arr[n - 1] == value) {
			return n;
		}
		return index(arr, n - 1, value);
	}
}

- Mac September 03, 2019 | Flag Reply
Comment hidden because of low score. Click to expand.
0
of 0 vote

public class IntArrayIndex {
	public static void main(String[] args) {
		int[] arr = { 20, 30, 40 };

		// find index for 30
		int returnVal = index(arr, arr.length, 30);
		System.out.println(returnVal);
	}

	public static int index(int[] arr, int n, int value) {
		if (arr[n - 1] == value) {
			return n;
		}
		return index(arr, n - 1, value);
	}

}

- Mac September 03, 2019 | Flag Reply


Add a Comment
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.

Learn More

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.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More