i-exceed technology solutions Software Engineer II Interview Questions and Answers

First round was screening of resume and few basic coding questions

In second round there is 3 panels at same day for 3 hours one after one all there round are technical and coding interviews level is hard one after another round. Situational questions and current project details in deep. Be prepare for coding.

Q1. Normal discussion in HR Round about company details and salary discussions.
Add your answer

Q1. Reverse the LL in k groups
Ans. 
Reverse the linked list in groups of k
• Iterate through the linked list in groups of k

• Reverse each group of k nodes

• Connect the reversed groups to form the final linked list
Answered by AI
Add your answer

Q1. Java related questions -> Hashing/Threads/Collections and Exception Handling
Add your answer

Q1. Leadership questions.. the manager was so rude, he wont let u answer completely, always interrupts in between your answer, he was in a mood to scold the interviewee as if he owns the company. Worst Manager...read more
Add your answer

Q1. What are software development design patterns? Can you explain singleton design pattern and code an example to show that?
Ans. 
Software development design patterns are reusable solutions to common problems encountered in software design.
• Design patterns help in creating maintainable, scalable, and efficient software.

• Singleton design pattern ensures a class has only one instance and provides a global point of access to it.

• Example: Implementing a singleton class in Java -

• public class Singleton { private static Singleton instance; private Singleto...read more
Answered by AI
Add your answer
Q2. Can you develop and simple API app to show its running and anyone request sending to it?
Add your answer
Q3. What kind of databases you’ve worked on? And explain what is DML!
Ans. 
I have worked on relational databases like MySQL and PostgreSQL. DML stands for Data Manipulation Language.
• Worked on MySQL and PostgreSQL databases

• Familiar with writing SQL queries for data manipulation

• DML stands for Data Manipulation Language
Answered by AI
Add your answer
Q4. When we work with micro services , what is your experience which becomes challenge?
Ans. 
One challenge when working with microservices is managing communication between services.
• Ensuring proper service discovery and registration

• Handling network latency and failures

• Implementing effective monitoring and logging

• Maintaining consistency and data integrity across services
Answered by AI
Add your answer

Q1. What are the types of deployments?
Ans. 
Types of deployments include blue-green, canary, rolling, and immutable.
• Blue-green deployment involves running two identical production environments and switching between them.

• Canary deployment gradually rolls out changes to a small subset of users before deploying to the entire infrastructure.

• Rolling deployment updates a few instances at a time, ensuring continuous availability.

• Immutable deployment creates new instanc
Answered by AI
Add your answer
Q2. What is Blue Green Deployment ?
Ans. 
Blue Green Deployment is a software release strategy that reduces downtime and risk by running two identical production environments.
• In Blue Green Deployment, one environment (blue) is live and serving production traffic while the other (green) is idle and ready to be switched to at any time.

• This strategy allows for zero downtime deployments, as the switch between blue and green environments can be done seamlessly.

• Blue...read more
Answered by AI
Add your answer
Q3. I was asked travelling salesman problem to solve.!
Add your answer

Q1. Tell me what you liked in last 2 rounds!
Ans. 
I enjoyed the challenging technical questions and the opportunity to showcase my problem-solving skills.
• Challenging technical questions

• Opportunity to showcase problem-solving skills
Answered by AI
Add your answer
Q2. Explain me the best project as per you which you worked upon and features of it.
Ans. 
Developed a web-based project management tool for tracking tasks and deadlines.
• Implemented user authentication and authorization using JWT tokens

• Integrated real-time chat feature using WebSockets

• Utilized React for front-end and Node.js for back-end development
Answered by AI
Add your answer
Q3. Some RegEx related questions were asked.
Add your answer
Q4. How vector databases work?
Ans. 
Vector databases store data in a vector format, allowing for efficient querying and analysis of high-dimensional data.
• Vector databases use vectors to represent data points in a multi-dimensional space.

• They are commonly used in machine learning and data science applications for tasks like similarity search and clustering.

• Examples of vector databases include Faiss, Annoy, and Milvus.
Answered by AI
Add your answer
Q5. If I give you a coding problem to solve in the language you don’t know, can you solve it, when you’re allowed to refer Google search?
Ans. 
Yes, I can solve a coding problem in a language I don't know with Google search.
• Utilize Google search to understand syntax and concepts in the unfamiliar language

• Break down the problem into smaller parts and search for solutions to each part

• Refer to online resources, forums, and documentation for guidance

• Practice writing and testing code snippets in the new language before attempting the full solution
Answered by AI
Add your answer
Q6. How you can parse location and shop name from a card transaction string?
Ans. 
Use regex to extract location and shop name from transaction string.
• Use regular expressions to match patterns for location and shop name.

• Look for keywords like 'at', 'from', 'in' to identify location.

• Consider variations in transaction strings and account for them in regex patterns.

• Example: 'Spent $50 at Starbucks Coffee' -> Location: Starbucks Coffee, Shop Name: Starbucks Coffee
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

test timing: 7-8 pm
2 programming questions
webcam proctored

Q1. 
Minimum Cost to Reach End Problem
You are provided with an array ARR of integers of size 'N' and an integer 'K'. The goal is to move from the starting index to the end of the array with the minimum possib...read more
Ans. 
Find minimum cost to reach end of array by jumping with constraints
• Use dynamic programming to keep track of minimum cost at each index

• Iterate through the array and update the minimum cost based on reachable indices within K steps

• Calculate cost to jump from current index to reachable indices and update minimum cost accordingly
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Palindrome String Validation
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
Note:
The string 'S' should be evaluated in a case...read more
Ans. 
The task is to check whether a given string is a palindrome or not, considering only alphabets and numbers and ignoring symbols and whitespaces.
• Convert the string to lowercase and remove all symbols and whitespaces.

• Reverse the modified string and compare it with the original string.

• If they are equal, then the string is a palindrome.

• If not, then the string is not a palindrome.
Answered by AI
Add your answer
Q2. 
Square Root (Integral) Problem Statement
Given a number N, calculate its square root and output the integer part only.
Example:
Input:
18
Output:
4
Explanation:
The square root of 18 is approximate...read more
Ans. 
The task is to find the integral part of the square root of a given number.
• Use the built-in square root function to find the square root of the number.

• Convert the result to an integer by rounding down or using the floor function.

• Print the integer part of the square root as the output.
Answered by AI
Add your answer
Q3. 
Min Steps to One Using Dynamic Programming
Given a positive integer N, your task is to determine the minimum number of steps required to reduce N to 1.
Allowed Operations:
1) Subtract 1 from it: n = n -...read more
Ans. 
The task is to find the minimum number of steps required to reduce a positive integer to 1 using three given operations.
• Use dynamic programming to solve the problem efficiently.

• Create an array to store the minimum steps required for each number from 1 to N.

• Iterate from 2 to N and calculate the minimum steps for each number based on the three operations.

• Return the minimum steps for N.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

They started Fundamentals of OOP- Inheritance, Polymorphism

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Ans. 
The maximum sum of any contiguous subarray in an array is found using Kadane's algorithm in O(N) time.
• Initialize two variables, maxSum and currentSum, both set to the first element of the array.

• Iterate through the array from the second element.

• For each element, update currentSum by adding the element to it.

• If currentSum becomes negative, reset it to 0.

• If currentSum is greater than maxSum, update maxSum.

• After iterating ...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Some people had two HR interviews but I only had one and interview went up till 11:30 pm and you get only 5-10 minutes to prepare for HR on Zoom