Echo India Managed Services Software Engineer Interview Questions and Answers

If you are a fresher , then this is for you else almost no coding test for experienced candidates.

Q1. Javascript basics, Angular react general questions depends upon profile.
Add your answer

Q1. They asked general questions related to some hectic situation faced in previous company / project..
Add your answer

Q1. Testing process and java code
Add your answer
Q2. Python machine learning questions
Add your answer

Java and python test was there

2 sum program from Geeks for Geeks

Q1. Ruby basics Eigen class Callbacks
Add your answer
Q2. Lazy and Eagar loading N+1 problem
Ans. 
Lazy loading delays loading of related data until it is specifically requested, while eager loading loads all related data upfront. N+1 problem occurs when lazy loading results in multiple additional queries being made.
• Lazy loading is used to improve performance by only loading related data when needed

• Eager loading loads all related data upfront to reduce the number of queries made

• N+1 problem occurs in lazy loading whe...read more
Answered by AI
Add your answer
Q3. Puzzles
Add your answer

Q1. AWS basics with CI/CD
Add your answer
Q2. Deployment to AWS
Add your answer

Q1. Basic introduction and salary discussion
Add your answer

Nothing

Q1. Python Sql Linux CLI
Add your answer

Q1. General discussions on learning
Add your answer

Questions based or percentage, profit loss, ratio

Q1. Explain about stacks
Ans. 
Stacks are a data structure that follows the Last In First Out (LIFO) principle.
• Elements are added and removed from the top of the stack

• Common operations include push (add element) and pop (remove element)

• Stacks can be implemented using arrays or linked lists

• Examples of stack usage include function call stack and undo/redo functionality in text editors
Answered by AI
Add your answer
Q2. To find middle number in the linked list
Ans. 
To find the middle number in a linked list.
• Traverse the linked list using two pointers, one moving twice as fast as the other.

• When the fast pointer reaches the end, the slow pointer will be at the middle node.

• If the linked list has even number of nodes, there will be two middle nodes. Return either one.
Answered by AI
Add your answer

Q1. Introduction , hobbies, goals
Add your answer
Q2. Strength, weakness, short term and long term goals
Add your answer

2 medium hard level questions. We just have to code and explain it. Platform doesn't have compilers.

Q1. Given an array Reverse array
Ans. 
Reverse array of strings
• Iterate through the array and swap elements from start to end

• Use two pointers, one at the beginning and one at the end, and swap elements until they meet
Answered by AI
Add your answer
Q2. Giaven a string Reverse string
Ans. 
Reverse a given string
• Use built-in functions like reverse() or loop through the string in reverse order

• Create a new string and append characters from the original string in reverse order

• Convert the string to an array of characters, reverse the array, and then join it back into a string
Answered by AI
Add your answer
Q3. Given array find sum of all elements
Ans. 
Calculate sum of all elements in a given array of strings
• Iterate through the array and convert each element to integer before adding to sum

• Handle edge cases like empty array or non-numeric elements

• Return the final sum after iterating through all elements
Answered by AI
Add your answer

Good Knowledge of DSA is required