Como se preparar para entrevistas na Salesforce

+15

Tell me about a time you had a conflict with a coworker. How did you resolve it?

+6

Tell me about a conflict you had at work.

The interviewer focused on a conflict that comes from different perspectives or ideas on how to execute a certain task.

+2

Design Uber

Design a ride-sharing service like Uber that allows users to request rides, matches them with nearby drivers, handles real-time tracking, and processes payments.

+1

Leetcode 124. Binary Tree Maximum Path Sum

Find the maximum sum of any non-empty connected path in a binary tree (nodes used at most once), where the path can start and end at any nodes and node values may be negative. You must account for single-node paths when all values are negative.

+1

Design LeetCode

Design an online coding judge system for programming competitions where users can submit solutions, view real-time leaderboards, and participate in timed contests with automatic code evaluation.

Leetcode 2050. Parallel Courses III

Given a DAG of course prerequisites where each course has a duration and any number of courses can run in parallel once prerequisites are satisfied, compute the minimum time to finish all courses. This is the classic longest-path/critical-path problem on a node-weighted DAG — compute each course's earliest completion time as max(completion times of prerequisites) + its duration.

Leetcode 460. LFU Cache

Implement an LFU cache with O(1) average-time get and put operations that evicts the least-frequently-used key when capacity is exceeded, breaking ties by least-recently-used. The cache must update a key's frequency (and recency) on both get and put, and support inserting and updating values.

Leetcode 1209. Remove All Adjacent Duplicates in String II

Given a string s and integer k, repeatedly remove any run of k equal adjacent characters until no more removals are possible and return the final string. The core challenge is to handle cascading deletions efficiently by tracking consecutive character counts (often via a stack of character-count pairs) rather than rescanning the string.

Describe a time when you needed to influence a peer who had a differing opinion about a shared goal.

Tell me how you helped someone in your team to get better at some task

Leetcode 215. Kth Largest Element in an Array

Return the k-th largest element (by sorted order, not distinct) from an unsorted array. For inputs up to ~1e5 elements, solve it faster than full sorting using selection techniques (e.g., Quickselect) or a size-k min-heap.

Tell me about a time you had to pivot mid-project.

Leetcode 490. The Maze

Given a grid maze where a ball, once rolled, continues in a direction until it hits a wall, determine whether the ball can reach and stop exactly at the destination. Core challenge: treat the cells where the ball stops as graph nodes and use graph search (BFS/DFS) over those stopping positions rather than step-by-step moves.

Design a 911 Call Center

Design a 911 call center system that efficiently routes emergency calls to appropriate regional police stations and schedules employees into operational slots. Focus on high-level architecture, load distribution strategies, and routing algorithms rather than detailed APIs or data models.

Design a fast food restaurant chain management system

Design a system for a global fast food restaurant chain that manages location-based menus with different items and pricing, and displays visually appealing menus on in-store panels.

Leetcode 1836. Remove Duplicates From an Unsorted Linked List

Leetcode 730. Count Different Palindromic Subsequences

Count the number of distinct non-empty palindromic subsequences in a string (n ≤ 1000, alphabet {a,b,c,d}), returning the result modulo 1e9+7. The core challenge is using interval dynamic programming with careful deduplication of subsequences to avoid overcounting repeated characters.

Leetcode 142. Linked List Cycle II

Design an analytics dashboard for an AI chat app

Design an analytics dashboard system for an AI chat application similar to ChatGPT that allows Product, Engineering, and Support teams to monitor system health, user behavior, and business performance in near real-time.

Leetcode 1375. Number of Times Binary String Is Prefix-Aligned

Given a permutation flips describing the order in which bits in an all-zero length-n binary string are turned to 1, count how many steps i produce a prefix-aligned string (positions 1..i all ones and the rest zeros). Equivalently, count the moments when the maximum index flipped so far equals the current step i.

Leetcode 83. Remove Duplicates from Sorted List

Leetcode 2380. Time Needed to Rearrange a Binary String

Given a binary string where every second all occurrences of "01" simultaneously become "10", determine how many seconds until no "01" remains; the core challenge is modeling the parallel, cascading swaps to compute how far ones must move past zeros (can be solved in O(n)).