What was my role in the project.
Software Specialist Interview Questions
1,464 software specialist interview questions shared by candidates
Find the maximum subarray sum(kadane" algo)
Longest Common Subsequence Level Order Traversal
Basic sql questions and database questions, like what do you understand by database abstraction , some theoritical dsa questions
do you know DSA? Rate it.
Interview Questions: 1.Write one sql query which describes all my knowledge of sql. 2.What is the latest react version am i using it in my final year project? What is package.json? Difference between package.json and package-lock.json? 3.How to reset the cookie from the backend? 4. When we do npm start, and if we are making any changes then how does that directly reflect on localhost without restarting the server? 5.What is indexing? Write a query for index. 6.Dsa question: An array was given and i need to return the array which contain the count of those element which are occuring more than 1. Example: {1, 2,2,2,3,3,4,4,4,4,4} Ans: {1, (2, 3), (3,2 ), (4, 5)} They also asked me to show my code on laptop and also asked from my app.jsx file that what is Layout called in that file?
The interview process is very easy and smooth, in my case they asked reverse a linked list and print Fibonacci series using DP and then they asked questions from my resume and project.
You are given three integers X, Y and Z and two arrays A and B both of length N. You are also given an integer sum which is initially equal to 0. You must perform N operations and in each ith operation you must do only one of the following: 1. 2. 3. Subtract B[i] from sum. Decrease both of X and Y by 1, then add A[i] * X * Y *Z to sum. Decrease both of Y and Z by 1, then add A[i] * X * Y *Z to sum. However, after each operation, X, Y and Z must all remain greater than or equal to 0. Find the maximum sum you can obtain after performing all operations. Sample Input: 2 1 2 2 0 0 10 5 Sample output: 0 Explanation: Here, N = 2, X = 1, Y = 2, Z = 2 A = [0, 0] B = [10, 5] It is given that in starting, sum = 0 operation 1: Apply type 2 operation (i.e. Decrease both of X and Y by 1, then add A[1]*X*Y*Z to sum) X = 0, Y = 1, Z = 2 sum = sum + 0*0*1*2 = 0 operation 2: Apply type 3 operation (i.e. Decrease both of Y and Z by 1, then add A[2]*X*Y*Z to sum) X = 0, Y = 0, Z = 1 sum = sum + 0*0*0*1 = 0 Hence, answer is the final value of sum i.e. sum = 0.
How excited are you to join Infosys?
two dsa ques :- chocolate problem and one more dp ques
Viewing 661 - 670 interview questions