Software development is an in-demand career path, and it's also a job that can provide opportunities for high earnings and professional fulfillment. When interviewing for software developer positions, you'll likely face questions about your hard and soft skills and how you manage projects efficiently.
Short coding : 1. They gave an array A with N elements we need to find if addition of two elements in the array will be the element K Ex: I/P: a[5]={7,3,2,6,4,} K=10; Op:7+3=10 6+4=10 2. Two sorted array a[],b[] will be given we need to merge the array without temporary array. 3. An array arr[] with elements are given we need to sort the odd number in descending on left side and the even numbers in ascending on the right side of the array Ex: I/P: arr[5]={7,4,3,5,2} O/P:7 5 3 2 4
You are given an array of integers, a1, that have sequential integers 1 through n. ( { 1,2,3,4,5 } or { 1,2,3 } or any other array) You are also given an array of integers, a2, that also have numbers 1 through n, but are not in sequential order and are missing one of the numbers between 1 and n. Find the missing number in a2. Did you check for special cases? Can you do this in O(n) runtime?
Swap two variables without using a temp.
Jim has 42 cents and has 8 coins, and Jack has 56 cents and has 6 coins. Which has more nickels than the other?
Puzzle1 - Given 8 coins, and the fact that one of the coins is heavier than the other, how many times(min) do you need to use a beam balance to figure out which is the anomalous coin? After I answered this, he made it little tougher. Given 9 coins and one anomalous coin(maybe heavier or lighter), figure out which coin it is and whether heavier or lighter. What is the min no of comparisons? This is where i took a while to answer.
Why Accenture?
1. Given a string, find the smallest window with greatest no. of distinct characters 2. k sorted array. 3. longest distance between a node and its ancestor.
You have words separated by white spaces. You need to reverse their order in place.
After i got selected they are demanding money.
Given a list of integers A and an integer k, return the number of unique pairs of integers in A that sum to k. For example, if A=[1 2 5 5 10 8 2] and k=10, the answer is 2, arrived as 5+5 or 2+8. There were 15 tests for this question, with at least the last two timing out, given that the implementation was not as efficient as possible.
Viewing 91 - 100 interview questions