Yahoo Softwaretest Engineer Interview Questions, Process, and Tips

Online test on hacker rank . difficult level

Assignmemt on sorting array

Q1. Describe binary tree
Ans. 
A binary tree is a hierarchical data structure in which each node has at most two children.
• Consists of nodes connected by edges

• Each node can have at most two children, referred to as left child and right child

• The left child is smaller than the parent node, while the right child is greater

• Used for efficient searching, sorting, and organizing data
Answered by AI
View 1 more answer
Q2. How to validate ip addres?
Ans. 
To validate an IP address, check if it consists of four numbers separated by periods, each number being between 0 and 255.
• Split the IP address string by periods to get an array of four numbers

• Check if the array length is 4

• Loop through each number in the array and check if it is between 0 and 255

• If any number is outside the valid range, the IP address is invalid
Answered by AI
View 1 more answer

Q1. Write a program to mirror the pixel in a screen matrix of 24 bit pixels
Ans. 
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]]
Answered by AI
Add your answer

3 rounds of coding problems in c++ from various disciplines some relatively easy and some hard

You better prepare for dynamic programming

Q1. Dynamic programming langeuage
Add your answer
Q2. What is the max sub array?
Ans. 
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.
Answered by AI
Add your answer

Leetcode hard 2 questions cat chicken problem

Q1. Leet code hard level questions
Add your answer

Leetcode hard lld questions and mr round

Q1. Dp questions - longest increasing subsequence
Ans. 
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.
Answered by AI
Add your answer
Q2. Grapg question - detect a cycle
Ans. 
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...read more
Answered by AI
Add your answer

DSA Based questions were asked

Q1. About Relocation
Add your answer

DSA, puzzles, DBMS, OD, and networking