Skip to contentSkip to footer

Software Engineer 1 Interview Questions

Salaries
Interviews

3,923 software engineer 1 interview questions shared by candidates

Got rejected in first round itself. Round 1:- Problem solving round You should be strong in DSA. Q1. Find the center element in linked list Q2. Explain HashMap Programs:- All these program questions they asked are from GeeksforGeeks P1:- A number will be given example 74. you have to find the prime numbers which produces that number when you add them. 3+71 = 74. P2:-Given an array and a value, find if there is a triplet in array whose sum is equal to the given value. If there is such a triplet present in array, then print the triplet and return true. Else return false. Input: array = {12, 3, 4, 1, 6, 9}, sum = 24; Output: 12, 3, 9 Explanation: There is a triplet (12, 3 and 9) present in the array whose sum is 24. Input: array = {1, 2, 3, 4, 5}, sum = 9 Output: 5, 3, 1 Explanation: There is a triplet (5, 3 and 1) present in the array whose sum is 9. P3:Given an array of distinct integers and a sum value. Find count of triplets with sum smaller than given sum value. The expected Time Complexity is O(n2). Input : arr[] = {-2, 0, 1, 3} sum = 2. Output : 2 Explanation : Below are triplets with sum less than 2 (-2, 0, 1) and (-2, 0, 3) Input : arr[] = {5, 1, 3, 4, 7} sum = 12. Output : 4 Explanation : Below are triplets with sum less than 12 (1, 3, 4), (1, 3, 5), (1, 3, 7) and (1, 4, 5)
avatar

SDET 1

Interviewed at ACKO General Insurance

3.2★
Oct 21, 2021

Got rejected in first round itself. Round 1:- Problem solving round You should be strong in DSA. Q1. Find the center element in linked list Q2. Explain HashMap Programs:- All these program questions they asked are from GeeksforGeeks P1:- A number will be given example 74. you have to find the prime numbers which produces that number when you add them. 3+71 = 74. P2:-Given an array and a value, find if there is a triplet in array whose sum is equal to the given value. If there is such a triplet present in array, then print the triplet and return true. Else return false. Input: array = {12, 3, 4, 1, 6, 9}, sum = 24; Output: 12, 3, 9 Explanation: There is a triplet (12, 3 and 9) present in the array whose sum is 24. Input: array = {1, 2, 3, 4, 5}, sum = 9 Output: 5, 3, 1 Explanation: There is a triplet (5, 3 and 1) present in the array whose sum is 9. P3:Given an array of distinct integers and a sum value. Find count of triplets with sum smaller than given sum value. The expected Time Complexity is O(n2). Input : arr[] = {-2, 0, 1, 3} sum = 2. Output : 2 Explanation : Below are triplets with sum less than 2 (-2, 0, 1) and (-2, 0, 3) Input : arr[] = {5, 1, 3, 4, 7} sum = 12. Output : 4 Explanation : Below are triplets with sum less than 12 (1, 3, 4), (1, 3, 5), (1, 3, 7) and (1, 4, 5)

Viewing 3231 - 3240 interview questions

Glassdoor has 3,923 interview questions and reports from Software engineer 1 interviews. Prepare for your interview. Get hired. Love your job.