i
Filter interviews by
Regression testing is the process of retesting a software application to ensure that new code changes have not adversely affected existing functionality.
Regression testing is performed after code changes to verify that the existing features still work correctly.
It helps in identifying any defects introduced by new code changes.
Automated testing tools are often used for regression testing to save time and effort.
Regress...
Test cases for signal testing
Test the strength of the signal in different locations
Test the signal quality during peak hours
Test the signal stability during a phone call or data transfer
Top trending discussions
String manipulation problems involve modifying or analyzing strings of characters.
Use built-in string methods like substring, replace, and split.
Regular expressions can be powerful tools for pattern matching and manipulation.
Be mindful of edge cases like empty strings and null values.
Consider the time and space complexity of your solution.
Practice with coding challenges on websites like LeetCode and HackerRank.
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
posted on 28 Mar 2024
I applied via Approached by Company and was interviewed before Mar 2023. There was 1 interview round.
Implemented a predictive ML model for customer churn prediction in a telecom company.
Used logistic regression algorithm for classification
Performed feature engineering to extract relevant customer data
Evaluated model performance using metrics like accuracy, precision, recall
posted on 4 May 2024
Python coding medium question
What is the difference between a HashMap and a ConcurrentHashMap?
I appeared for an interview before Dec 2020.
Round duration - 120 minutes
Round difficulty - Easy
After round 1 there was a break of 15 mins and the coding round started.
We had a choice to attempt the exam in R language & SQL or python & sql
I chose python and sql
It had 8 questions 4 python and 4 sql
Given two strings, S
and T
with respective lengths M
and N
, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...
The task is to find the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of longest common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For strings 'abcde' and 'ace', the longest common subsequence is 'ace' with leng
Round duration - 15 minutes
Round difficulty - Medium
The interview was mostly analytical based and how you approach the round a few technical questions in dbms and oops were also asked.
Round duration - 20 Minutes
Round difficulty - Medium
Similar to first round
For Shortlists after elimination from first round.
You are a cab driver with a car that initially has 'C' empty seats. The car moves in a straight line towards the forward direction only. Your job is to determine if it is poss...
Determine if it is possible to accommodate all passenger trips within a car's capacity without exceeding it at any point.
Iterate through each trip and keep track of the total number of passengers in the car at each point.
Check if the total number of passengers exceeds the car capacity at any point.
Return 'True' if all trips can be accommodated within the car capacity, otherwise return 'False'.
Round duration - 20 minutes
Round difficulty - Easy
After two technical round interviews, the last round was a hr interview. The whole process can take up one whole day or more and your interview can be at any time
My process started at 5 pm and ended at 10:30 pm
All the interviewers were very friendly no pressure.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Time complexity can be optimized to O(N) using dynamic programming.
Example: For N = 5, the 5th Fibonacci number is 5.
Tip 1 : Be fast ans accurate on your aptitude amd verbal tests.
Tip 2 : In coding round, depending on the difficulty of the questions the time in which you complete solving them should decrease .If almost everyone can solve them timming comes in to the equation for shortlisting
Tip 3 : While submitting your resume, please be honest about the projects you have done and do not bluff about it because in the interview when you ate drilled abt it, they can catch you easily.
Tip 4 : be confident and answer every question to the best of your ability and if u don't know something, tell them you don't know abt it .
Tip 1 : Research the company and put the most revalent projects and skills that the company os looking for specifically
Tip 2 : Do not bluff or lie on your resume. It show's during the interview.
posted on 22 Sep 2023
Coding testing with 15 questions MCQ based
I applied via Company Website and was interviewed before Aug 2023. There were 3 interview rounds.
Count frequency of characters in a given string.
Iterate through each character in the string
Use a hashmap to store the count of each character
Return the hashmap with character frequencies
based on 1 interview
Interview experience
Senior Associate
433
salaries
| ₹5.7 L/yr - ₹21.1 L/yr |
Deputy Manager
112
salaries
| ₹6 L/yr - ₹16 L/yr |
Graduate Engineer Trainee (Get)
100
salaries
| ₹5.2 L/yr - ₹7.7 L/yr |
Associate
84
salaries
| ₹3.8 L/yr - ₹14.5 L/yr |
Lead
77
salaries
| ₹12 L/yr - ₹33 L/yr |
Oyo Rooms
Udaan
Ekart Logistics
Thomson Reuters