Tip 1 : Keep on Practice What I learn every Day
Tip 2 : Take possible amount of practice test to keep up the time
Tip 3 : Strong determination and Focus
Tip 1 : Simple and clear and particularly only true stuffs.
Tip 2 : Looks to be more professional
It is an elimination Round consisting of 90 MCQ questions to be completed in 90 minutes. You must meet sectional & sub-sectional cut off to proceed ahead in the recruitment process.
Once you clear this you will be directed to Technical coding duration of 45 minutes 2 problems.
Questions were mainly from topics -
1. Numerical Ability
2. Logical Reasoning
3. English Ability
1. Pseudo Code
2. Common Applications & MS Office
3. Fundamentals of Networking
4. DBMS
5. Operating Systems
Overall Test Environment was good, It is a proctored Assessment. Also, you cannot switch sections, you have to attempt sections in the given order itself.



Postfix notation is a method of writing mathematical expressions in which operators are placed after the operands. For example, "a b +" represents the addition of a and b.
Prefix notation is a method of writing mathematical expressions in which operators are placed before the operands. For example, "+ a b" represents the addition of a and b.
Expression contains lowercase English letters, ‘+’, ‘-’, ‘*’, and ‘/’.
Input: abc*+
Output: +a*bc
Explanation:
For the given postfix expression, infix expression is a+b*c. And it's corresponding prefix expression is +a*bc.
We can use stack for this problem. Below can be the implementation steps
1. Read the Post-fix expression from left to right
2. If the symbol is an operand, then push it onto the Stack
3. If the symbol is an operator, then pop two operands from the Stack
4. Create a string by concatenating the two operands and the operator before them.
5. Push the resultant string back to Stack
6. Repeat the above steps until end of Post-fix expression.



1 2 3 4
5 6 7 8
1 9 2 3
In this example, the maximum value is 8 (mat[2][1]-mat[0][0]).
My Approach
We can Traverse the array & store the index of each element in a list (This is done to handle duplicates).
Then we can Sort the array.
After sorting, traverse the array & keep track of the maximum difference of i & j.
For j consider the last index from the list of possible index of the element & for i consider the first index from the list.
Keep updating the max difference till the end of the array.
Communication Skills, Sentence mastery, Vocabulary related Questions.
It's not only a HR round, but include technical questions as well. There were 3 Interviewers in the Penal (One Technical Manager, Technical Developer). Also, This is a Face-to-Face Video Call Interview.
Firstly I Introduced myself then the two Interviewer's Introduced themselves.
Then we had deep discussion on projects, skills, that I mentioned in resume with the Interviewer. They asked some questions related to Projects, Tech Stack used in the project and all.
Then the second Interviewer asked 2-3 SQL, OOPS questions. That's it for Technical Part.
Tip: Other Technical questions may be asked (depends on candidate-to-candidate basis).
Tip: The other person asked questions related to the project done during your college and few question related to my core.
In the End, I asked what its like in day to day work of ASE at Accenture. I only remember some of the questions.
What is inheritance and its types?
What is data abstraction?
Related to the core project
Microprocessor and micro controller differences
Which is best over head transmission wires or underground transmission wires

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: