Tesla Software Engineer Phone Screen Questions

first interview after academia, recruiter said they asked applicable questions(sounds like leetcode style still). curious what topics to prep and how to best prep within 1 week? thanks so much!

This post was last edited by Anonymous on 2025-09-23 23:36. This position was offered by their sourcer; it's for the software group in the production department that monitors battery status within the

how do i prepare for a TESLA software engineering phone screen interview. I did lots of LC for FAANG company, is it gonna be same or do i need to study something else? can someone share their intervie

Location - Fremont, CA Round 1 : Phone Screen https://leetcode.com/problems/longest-substring-without-repeating-characters/description/ **On-Site** **Round 2 :Coding 1 1. https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/ 2. https://leetcode.com/problems/top-k-frequent-elements/ Round 3 : Coding 2 1. https://leetcode.com/problems/top-k-frequent-elements/description/ 2. // Given an input string s and a pattern p, implement regular...

About I am a new grad from a small school in Canada. I applied online and interviewed on-site at Tesla\'s Palo Alto office in early October 2022. Phone Screens Phone Screen 1 (45...

I had my phone screen today with Tesla for SWE position, I was asked to implement PriorityExpirationCache with LRU 1 If an expired item is available. Remove it. If multiple...

## Problem You have a battery with capacity `C` kWh. Given hourly electricity prices for the next `T` hours, decide when to charge (buy energy at current price) and when to discharge (sell energy at current price). You can charge or discharge at most `R` kWh per hour. Maximize total profit. ```python def max_battery_profit( prices: list[float], # prices[t] = price per kWh at hour t capacity: float, # max energy stored rate: float # max charge/discharge per hour ) -> float: # Return maximum profit (revenue from discharging - cost of charging) pass ``` **Example:** ``` prices = [10, 20, 15, 30, 5, 25] capacity = 2.0, rate = 1.0 # Charge 1 kWh at t=0 (cost 10), discharge at t=3 (revenue 30) # Charge 1 kWh at t=4 (cost 5), discharge at t=5 (revenue 25) Output: 40.0 # profit = (30-10) + (25-5) ``` ## Follow-ups 1. Is a greedy approach correct here, or do you need DP? Give a counterexample for greedy if it fails. 2. Write the DP recurrence: `dp[t][charge_level]` = max profit through hour `t` with `charge_level` kWh stored. 3. If you can also pay a degradation cost per charge/discharge cycle, how does the model change? 4. How would you solve this if prices are not known in advance (online algorithm)?

## Problem Merge or process overlapping battery discharge intervals to compute total energy used. ## Likely LeetCode equivalent Similar to LC 56 Merge Intervals. ## Tags heap, intervals, tesla

## Problem Schedule GPU tasks across available workers to minimize total completion time or idle time. ## Likely LeetCode equivalent Similar to LC 1834 Single-Threaded CPU. ## Tags greedy, scheduling, tesla, heap