This time I helped a classmate with tutoring throughout the process. Salesforce OA, 2 questions in 90 minutes were successfully passed with full marks. I specially compiled the real interview experience to share with everyone. As the world's top CRM company, Salesforce's technical interviews have always been very valuable. Their OA is usually 2 algorithm questions + 90 minutes, and the difficulty is stable at the LeetCode Medium level. This time, the complete questions + problem-solving ideas are sorted out. Students who are planning to invest in Salesforce or similar large companies can focus on it.
Salesforce OA coding 1
Given a set of different measurements taken at different times, find the smallest possible absolute difference between any two measurements.
Print all pairs of measurements with this minimum difference, in ascending order:
- Each pair of inner elements is ordered ascendingly (for example, if
A < b, then outputA b) - All pairs are sorted by the first element in ascending order, and then by the second element in ascending order.
Example:
Enter:[-1, 3, 6, -5, 0]
The minimum absolute difference is 3, the satisfied pair has (3,6) And (0,3)
Output:
Plaintext
0 3
3 6Problem-solving ideas
The essence is sorting + greedy: sort the array first, because the minimum absolute difference must appear between adjacent elements, first traverse it to find the global minimum difference, and then traverse it again to collect all pairs of adjacent numbers whose difference is equal to the minimum value, and output them in order. The time complexity is O(n log n).
Salesforce OA coding 2
Implement a prototype service to control the spread of malware in the network.
There are in the network G_nodes Nodes and G_edges Bidirectional edge, No. I Edge connection G_from[i] And G_to[i].
Some nodes have been infected by malware:
Malware[i] = 1Represents nodeIInfectedMalware[i] = 0Represents nodeINot infected
Propagation rules: Any infected node will infect all directly connected uninfected nodes, and this process continues until no new nodes are infected.
Task: Exactly 1 node must be removed from the network such that the total number of nodes eventually infected is minimized.
- If multiple nodes are removed and the same minimum number of infections is obtained, the node with the smallest number is returned.
Example:
Initial infection node:[3,5]
Return:3
If you remove a node 3, ultimately only nodes 4,5 Infected, with the lowest number of infections
Problem-solving ideas
This question is about the connected components of the graph: first use DFS or union lookup to find all connected components, and count the size of each component and the number of infected nodes; only when there is exactly 1 infected node in a certain component, removing it can prevent the entire component from being infected (the gain is the size of the component), otherwise the spread cannot be prevented; finally, among all the saveable nodes, select the one that can reduce the infection the most, and if there is a tie, return the one with the smallest number.
Finally, I would like to say to the students who are preparing for OA:
If you also encounter HackerRank, Codesignal, and OA on these platforms and feel a little nervous, or if you don’t have enough time and your ideas are stuck, you can consider asking programhelp for help. We are a team of North American CS experts that provide OA ghostwriting We provide real-time coaching and secure remote assistance to ensure that all test cases pass 100%. There is no charge for failure, and the process is more secure. I have helped many students handle OA issues from major companies such as Salesforce, Google, Meta, and Amazon before, and all of them were successfully won.
If necessary, please feel free to contact us. I wish everyone a stable OA!
