Faster and better experience!
Filter interviews by
In Selenium, element refers to a single web element while elements refer to a collection of web elements. Basic SQL query retrieves data from a database. ACID properties ensure database transactions are reliable.
Element in Selenium refers to a single web element like a button or input field
Elements in Selenium refer to a collection of web elements, like a list of links or buttons
Basic SQL query retrieves data from a da...
Element is a singular object, while elements refer to multiple objects.
Element is a single item in a collection or array.
Elements are multiple items in a collection or array.
Example: 'apple' is an element in the array ['apple', 'banana', 'orange'].
Example: 'banana' and 'orange' are elements in the same array.
Boundary Value Analysis (BVA) is a testing technique used to identify errors at boundaries of input ranges.
BVA involves testing at the boundaries of valid and invalid input ranges
It helps in identifying errors that occur at the edges of input values
Examples include testing a login form with minimum and maximum character limits for password
BVA is used to ensure that the software behaves correctly at the boundaries of in
ACID properties in SQL refer to a set of properties that ensure database transactions are processed reliably.
ACID stands for Atomicity, Consistency, Isolation, and Durability
Atomicity ensures that either all operations in a transaction are completed successfully or none are
Consistency ensures that the database remains in a consistent state before and after the transaction
Isolation ensures that multiple transactions can...
Schema testing focuses on the structure of the database, while database testing focuses on the data within the database.
Schema testing ensures that the database tables, columns, relationships, and constraints are correctly defined.
Database testing involves verifying the data stored in the database, such as data integrity, accuracy, and consistency.
Schema testing is more focused on the design and structure of the databa...
I applied via Company Website and was interviewed in Apr 2024. There were 2 interview rounds.
Writing test cases, basic sql
I applied via Naukri.com and was interviewed in Jan 2022. There were 4 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Jul 2023. There was 1 interview round.
Hacker rank based test
ZocDoc interview questions for popular designations
I applied via Referral and was interviewed in Jan 2021. There were 4 interview rounds.
Our company's revenue model is based on subscription fees and advertising revenue.
Subscription fees from users who want access to premium features
Advertising revenue from companies who want to reach our user base
Possible revenue from partnerships and collaborations
Revenue may also come from data analysis and insights
Examples: Spotify, YouTube, LinkedIn
Top trending discussions
I applied via Naukri.com and was interviewed before May 2020. There was 1 interview round.
I applied via Indeed and was interviewed before Aug 2023. There were 3 interview rounds.
Smog testing is a process to measure the amount of pollutants emitted by vehicles to ensure they meet environmental standards.
Smog testing is also known as emissions testing or vehicle inspection.
It is typically required by law to ensure vehicles are not emitting excessive pollutants into the air.
The testing process usually involves measuring the levels of pollutants such as carbon monoxide, hydrocarbons, and nitrogen ...
SDLC lifecycle is the process of planning, creating, testing, and deploying software.
SDLC stands for Software Development Life Cycle
It includes phases like planning, analysis, design, implementation, testing, and maintenance
Each phase has specific goals and deliverables
Examples of SDLC models include Waterfall, Agile, and DevOps
Married with two children, currently working as a QA Engineer.
Married with two children
Currently working as a QA Engineer
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Queue can be implemented using two stacks by maintaining the order of elements in the stacks.
Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the
Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.
Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...
Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.
Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle
Given three sorted arrays, find common elements.
Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array
Check if a number is a power of 2 or not.
A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
based on 3 interviews
Interview experience
Senior Associate
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Consultant
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead Operations
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Practo
Lybrate
Portea Medical
PharmEasy