Filter interviews by
Calculate the median from a continuous stream of numbers efficiently.
Use two heaps: a max-heap for the lower half and a min-heap for the upper half.
Insert numbers into the appropriate heap based on their value.
Balance the heaps to ensure their sizes differ by at most one.
The median is the root of the max-heap if it has more elements, or the average of both roots if they are equal in size.
Example: Stream = [1, 5, 2...
Merge overlapping intervals into a single interval for efficient representation.
Sort intervals by their start time. Example: [[1,3], [2,6], [8,10], [15,18]] becomes [[1,3], [2,6], [8,10], [15,18]].
Initialize a merged list with the first interval. Merged: [[1,3]].
Iterate through sorted intervals and merge if they overlap. Example: [2,6] overlaps with [1,3], so merge to [1,6].
If no overlap, add the current interval ...
Detecting a cycle in a graph using depth-first search or Floyd's cycle detection algorithm.
Use depth-first search to detect a cycle in a graph by keeping track of visited nodes and checking for back edges.
Alternatively, use Floyd's cycle detection algorithm for detecting a cycle in a linked list or graph.
Example: For a graph with nodes A, B, C, D and edges (A->B, B->C, C->D, D->A), a cycle is detected when visitin...
Find the longest increasing subsequence in an array.
Use dynamic programming to solve this problem.
Iterate through the array and keep track of the longest increasing subsequence ending at each index.
Return the maximum length found.
What people are saying about Google
Software testing is the process of evaluating a software application to ensure it meets specified requirements and functions correctly.
Identifying defects or bugs in the software
Verifying that the software meets functional and non-functional requirements
Ensuring the software is user-friendly and meets user expectations
Types of testing include unit testing, integration testing, system testing, and acceptance testin...
Max sub array refers to the contiguous subarray within an array that has the largest sum of elements.
Max sub array problem is a common algorithmic problem in computer science.
It involves finding the subarray with the largest sum of elements.
Example: Given array [1, -2, 3, 4, -1, 2, 1, -5, 4], the max sub array is [3, 4, -1, 2, 1] with a sum of 9.
Program to mirror the pixel in a screen matrix of 24 bit pixels
Create a 2D array to represent the screen matrix of pixels
Iterate through each row and swap the pixels from left to right
Ensure to handle the 24 bit pixels properly for mirroring
Example: [[255, 0, 0], [0, 255, 0], [0, 0, 255]] -> [[0, 0, 255], [0, 255, 0], [255, 0, 0]]
Graphs are data structures that consist of nodes (vertices) connected by edges (links).
Graphs can be directed or undirected.
Nodes can have attributes or properties.
Edges can have weights or labels.
Examples of graphs include social networks, road networks, and organizational hierarchies.
I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.
It was good , there was merge intervals questions , and 1 hard questions
Merge overlapping intervals into a single interval for efficient representation.
Sort intervals by their start time. Example: [[1,3], [2,6], [8,10], [15,18]] becomes [[1,3], [2,6], [8,10], [15,18]].
Initialize a merged list with the first interval. Merged: [[1,3]].
Iterate through sorted intervals and merge if they overlap. Example: [2,6] overlaps with [1,3], so merge to [1,6].
If no overlap, add the current interval to me...
On leetcode based prblm there are questions asked
Trees are hierarchical data structures with nodes connected by edges. Binary search is a search algorithm that finds the position of a target value within a sorted array.
Trees are made up of nodes connected by edges, with a root node at the top and leaf nodes at the bottom.
Binary search is a divide and conquer algorithm that compares the target value to the middle element of a sorted array.
Binary search is efficient fo...
Graphs are data structures that consist of nodes (vertices) connected by edges (links).
Graphs can be directed or undirected.
Nodes can have attributes or properties.
Edges can have weights or labels.
Examples of graphs include social networks, road networks, and organizational hierarchies.
Projects and dsa based round is this
Find the longest increasing subsequence in an array.
Use dynamic programming to solve this problem.
Iterate through the array and keep track of the longest increasing subsequence ending at each index.
Return the maximum length found.
Detecting a cycle in a graph using depth-first search or Floyd's cycle detection algorithm.
Use depth-first search to detect a cycle in a graph by keeping track of visited nodes and checking for back edges.
Alternatively, use Floyd's cycle detection algorithm for detecting a cycle in a linked list or graph.
Example: For a graph with nodes A, B, C, D and edges (A->B, B->C, C->D, D->A), a cycle is detected when visiting nod...
I applied via Naukri.com and was interviewed in Oct 2024. There were 2 interview rounds.
That was very basic round and it was so easy
Two question are given one from LinkedList and second was from Dynamic Programming
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
Mostly questions come from DP,Graphs
I am a dedicated Software Test Engineer with 5 years of experience in manual and automated testing.
5 years of experience in software testing
Proficient in manual and automated testing
Strong attention to detail and problem-solving skills
I am interested in the company's innovative approach to software testing and their commitment to quality assurance.
I am impressed by the company's track record of delivering high-quality software products.
I am excited about the opportunity to work with cutting-edge technologies and tools in software testing.
I appreciate the company's focus on continuous learning and professional development for its employees.
I appeared for an interview in Dec 2024, where I was asked the following questions.
Calculate the median from a continuous stream of numbers efficiently.
Use two heaps: a max-heap for the lower half and a min-heap for the upper half.
Insert numbers into the appropriate heap based on their value.
Balance the heaps to ensure their sizes differ by at most one.
The median is the root of the max-heap if it has more elements, or the average of both roots if they are equal in size.
Example: Stream = [1, 5, 2, 8]....
I applied via Naukri.com
50 questions and 1 hour time
3 questions and 40 min time
Software testing is the process of evaluating a software application to ensure it meets specified requirements and functions correctly.
Identifying defects or bugs in the software
Verifying that the software meets functional and non-functional requirements
Ensuring the software is user-friendly and meets user expectations
Types of testing include unit testing, integration testing, system testing, and acceptance testing
I applied via AmbitionBox and was interviewed in Aug 2023. There were 3 interview rounds.
Data structures and algorithms. Leet code hard level
I applied via Job Fair and was interviewed in Mar 2024. There was 1 interview round.
I was too stressed, task about stack
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
I find the role of a Software Test Engineer crucial for ensuring software quality and user satisfaction through systematic testing.
Quality Assurance: Ensures that software meets specified requirements and is free of defects, e.g., testing a banking application for transaction accuracy.
User Experience: Helps improve user satisfaction by identifying usability issues, e.g., testing an e-commerce site for ease of navigatio...
I am highly interested in this job as it aligns with my passion for quality assurance and software development.
I have a strong background in software testing, having worked on various projects that required meticulous attention to detail.
I enjoy problem-solving and find satisfaction in identifying bugs and improving software quality.
I am eager to learn new testing tools and methodologies to enhance my skills and contri...
The duration of Google Softwaretest Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 20 interview experiences
Difficulty level
Duration
based on 28 reviews
Rating in categories
Software Engineer
3k
salaries
| ₹32.5 L/yr - ₹80 L/yr |
Software Developer
2k
salaries
| ₹35.4 L/yr - ₹73.1 L/yr |
Senior Software Engineer
1.1k
salaries
| ₹20.8 L/yr - ₹82.1 L/yr |
Sde1
378
salaries
| ₹34.2 L/yr - ₹64 L/yr |
Data Analyst
363
salaries
| ₹16.1 L/yr - ₹35 L/yr |
Yahoo
Amazon
Microsoft Corporation