Salesforce Softwaretest Engineer Interview Questions and Answers

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

Leetcode hard 2 questions cat chicken problem

Q1. Leet code hard level questions
Add your answer

Leetcode hard lld questions and mr round

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

That was very basic round and it was so easy

Two question are given one from LinkedList and second was from Dynamic Programming

A standardized assessment that measures a person's skills, cognitive abilities, and potential to perform in a specific role.

Q1. Technical interview questions at Automatic Data Processing (ADP) may cover topics such as programming, databases, and software development.
Add your answer
Q2. They may also ask about problem-solving and how you approach challenging tasks.
Add your answer
Q3. Emphasize a structured method that involves clearly defining the issue, gathering relevant information, brainstorming potential solutions, evaluating options carefully, implementing the chosen solution, an...read more
Add your answer
Q4. Data structures, algorithms, SQL querying, object-oriented programming principles, software development lifecycle, database concepts (relational vs. NoSQL), coding challenges in relevant languages (like Py...read more
Add your answer

Q1. May ask about your background, skills, and how you handle challenges
Add your answer
Q2. Background questions Tell me about yourself, What are your career goals, What are your strengths and weaknesses, What do you know about ADP, and Why do you want to work at ADP.
Add your answer

Written test on DSA - 3 questions on hackerrank

F2F interview on DSA + automation

Q1. DSA algorithms, trees, tries, linked list
Add your answer
Q2. Questions on graphs
Add your answer
Q3. Question on dynamic programming
Add your answer

Data structures and algorithms. Leet code hard level

On leetcode based prblm there are questions asked

Q1. What are trees and binary search
Ans. 
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...read more
Answered by AI
Add your answer
Q2. What are graphs
Ans. 
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.
Answered by AI
Add your answer

Projects and dsa based round is this

Q1. This is very tough rounf
Add your answer

Q1. This is also very tough
Add your answer

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