Filter interviews by
Oops concept in framework refers to using object-oriented programming principles like inheritance, encapsulation, and polymorphism.
Inheritance: Allows reusing code from parent classes in child classes.
Encapsulation: Bundling data and methods that operate on the data into a single unit.
Polymorphism: Ability to present the same interface for different data types.
Example: Creating base class for common functionalities and
JavaScript is used in QA automation testing for handling dynamic elements, performing validations, and interacting with APIs.
JavaScript is used to handle dynamic elements on a webpage that cannot be easily accessed using web element methods.
JavaScript can be used to perform validations and assertions on the webpage, such as checking for the presence of certain elements or text.
JavaScript is also commonly used to intera...
I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 4 interview rounds.
I applied via Walk-in and was interviewed in Aug 2022. There were 3 interview rounds.
Anything can ask from selenium
posted on 13 Apr 2023
I applied via Approached by Company and was interviewed before Apr 2022. There were 3 interview rounds.
I applied via LinkedIn and was interviewed before Feb 2023. There was 1 interview round.
I applied via Naukri.com and was interviewed before Oct 2022. There were 5 interview rounds.
I don't remember what they gave
Java program about selenium web driver previous experience and project
I applied via Company Website and was interviewed before Feb 2021. There were 3 interview rounds.
TNQT: TCS National Qualifier Test
I applied via Campus Placement and was interviewed before Jul 2020. There were 3 interview rounds.
I was interviewed before Nov 2020.
Round duration - 360 minutes
Round difficulty - Medium
They give you 6 hr. For 6 question but the good part is that you need to complete atleast 1 question and you are good to go.
Round will be cleared only after attempting one question and rest of the questions are for improving your rank.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the problem statement.
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...
The task is to determine the minimum number of platforms needed at a railway station based on arrival and departure times of trains.
Sort the arrival and departure times in ascending order.
Use two pointers to keep track of overlapping schedules.
Increment platform count when a new train arrives before the previous one departs.
You are given a matrix of 'N' rows and 'M' columns and a non-negative integer 'K'. Determine the minimum possible sum of all elements in each submatrix after performing at m...
Given a matrix and a non-negative integer K, find the minimum possible sum of all elements in each submatrix after performing at most K decrements.
Iterate through all submatrices and find the minimum possible sum after performing decrements
Keep track of the number of decrements performed on each element
Use dynamic programming to optimize the solution
Ensure not to decrease any number below 0
Return the minimum possible s
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
Sort the array of chocolates packets.
Use sliding window technique to find the minimum difference between the largest and smallest packets distributed to students.
Consider edge cases like when number of students is equal to number of packets.
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Calculate total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and find prime numbers in each part.
Identify prime groups where prime numbers occur at the same position in different parts.
Count the total instances of equivalent prime groups.
Ensure each hour in a prime group is in a different part of the day.
Given a matrix named UNIVERSE
with 3 rows and 'N' columns, filled with characters {#, *, .}, where:
The task is to identify constellations shaped like vowels within a matrix filled with characters {#, *, .}.
Iterate through the matrix to find 3x3 constellations shaped like vowels.
Check for vowels 'A', 'E', 'I', 'O', 'U' in each 3x3 constellation.
Print the vowels found in each constellation for each test case.
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : learn basics
Tip 2 : learn any oops language and practice.
Tip 3 : code as much as you can.
Tip 1 : short and precise. Upto the point.
Tip 2 : keep few things aside from resume
based on 1 interview
Interview experience
Operations Executive
228
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
100
salaries
| ₹0 L/yr - ₹0 L/yr |
MIS Executive
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Shift Incharge
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Delhivery
BlackBuck
Shadowfax Technologies
Ecom Express