i
TO THE NEW
Filter interviews by
I was interviewed in Dec 2020.
Round duration - 60 minutes
Round difficulty - Medium
Timing: 1:00 PM
Environment: Online (Webcam + Mic on)
The interviewer was friendly, collaborative and to the point.
Given an array of integers ARR
with size N
, where exactly two elements appear only once and all others appear exactly twice, identify and return the two u...
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Given a string 'S' of words, the goal is to determine the frequency of each word in the string. Consider a word as a sequence of one or more non-space characters. The string can h...
Steps:
Round duration - 40 minutes
Round difficulty - Easy
Timing (In Morning)
Environment (Same as Technical Interview)
Tip 1 : For DS and Algorithms, keep practicing every day on Leetcode, HackerEarth, and make a habit of participating in contests.
Tip 2 : Projects are vital in interviews, have at least 3 projects on Resume, in the field/profile which you're applying for.
Tip 3 : Give Mock Interviews with your friends and keep noting down your drawbacks and work on them.
Tip 4 : Try writing and explaining code to yourself on Google Doc or WordPad etc. as you might not get to code on a IDE.
Tip 1 : Resume should be short and keep it under 1 page.
Tip 2 : Include skills that you're 100% confident in.
Tip 3 : Highlight your internships and projects section appropriately
Top trending discussions
Java has two types of beans: stateful and stateless beans.
Stateful beans maintain conversational state with the client, while stateless beans do not.
Stateful beans are typically used for long-running conversations, while stateless beans are used for short-lived operations.
Examples of stateful beans include session beans, while examples of stateless beans include message-driven beans.
Use a sorting algorithm like bubble sort or quicksort to arrange elements in ascending order.
Use a sorting algorithm like bubble sort, quicksort, or merge sort to rearrange elements in ascending order.
For example, you can implement bubble sort to compare adjacent elements and swap them if they are in the wrong order.
Another example is using quicksort to divide the array into smaller subarrays and recursively sort them.
Iterate through the array to find the second greatest number.
Iterate through the array and keep track of the greatest and second greatest numbers.
Compare each element with the current greatest and second greatest numbers.
Update the second greatest number if a new number is found that is greater than the current second greatest but less than the greatest.
I applied via Company Website and was interviewed before Sep 2022. There were 5 interview rounds.
Aptitude + Technical
5 problem statements and need to write code in any language
Senior Software Engineer
596
salaries
| ₹9 L/yr - ₹27.5 L/yr |
Software Engineer
570
salaries
| ₹3.5 L/yr - ₹13.8 L/yr |
Associate Technical Leader
209
salaries
| ₹13.5 L/yr - ₹35.4 L/yr |
Senior Quality Engineer
167
salaries
| ₹7 L/yr - ₹22.5 L/yr |
Devops Engineer
157
salaries
| ₹4.5 L/yr - ₹14.5 L/yr |
TCS
Infosys
Wipro
HCLTech