Tip 1 : Solve quality questions of DSA.
Tip 2 : Prepare well for Aptitude Test, if you're not confident of clearing it without any Preparation. (I applied Off-Campus & didn't prepared, because I had good command over Aptitude, so no preparation was needed. But I have seen students getting out in First Round itself for Aptitude even in On-Campus Placements)
Tip 3 : Focus on Computer Science Fundamentals - OS, Networking & DBMS.
Tip 1 : Only write skills & projects you are confident, on Resume, and be prepared for cross questions on anthing mentioned in Resume.
Tip 2 : Make a clear & concise ATS free resume.
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.
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.



Given 'ARR' = [1, 10, 5, 2, 8, 1 ] , answer is "ODD".
Here the maximum difference is between 10 and 1, 10 - 1 = 9
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, second HR & other likely be some Technical Developer). Also, This is a Face-to-Face Video Call Interview.
Firstly I Introduced myself then the three 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 DBMS, OOPS questions. That's it for Technical Part.
Tip: Other Technical questions may be asked (depends on candidate-to-candidate basis).
Then the HR asked some cultural fit questions & about relocation preferences.
In the End, I asked what its like in day to day work of ASE at Accenture.
What is a cursor?
What are ACID properties?
What is inheritance and its types?
What is data abstraction?
Why do you want to work for our company?
What are your relocation preferences?

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: