Software Engineer · Full Journey · Coding

Google — Software Engineer ❌ Failed

Level: Intern

Round: Full Journey · Type: Coding · Difficulty: 7/10 · Duration: 120 min · Interviewer: Neutral

Topics: Arrays, Hash Maps, Heaps

Location: San Francisco Bay Area

Interview date: 2026-02-01

Got offer: False

Summary

Coding Round I

You are given an array tasks, where each task is represented by two integers:

• start: the start time of the task in minutes
• duration: the number of minutes the task runs

Each task runs continuously once it starts, and a server can process only one task at a time.

Time is measured in minutes within a 24-hour cycle (from 0 to 1439). If start + duration exceeds 1440, the task continues into the next day.

Return the minimum number of servers required to run all tasks without any overlap on the same server.

Example

python tasks = [ (23 * 60, 60), # 23:00 – 00:00 (0, 30), # 00:00 – 00:30 (23 * 60, 30) # 23:00 – 23:30 ] Output: 2

---

Coding Round 2

You are given an integer array nums. The array may contain duplicate values and negative numbers.

You must remove exactly one element from the array (i.e., delete one index). After the removal, the relative order of the remaining elements must be preserved.

A pivot index is an index p such that the sum of elements strictly to the left of p is equal to the sum of elements strictly to the right of p.

Task

Return true if there exists some way to remove exactly one element so that the resulting array contains at least one pivot index. Otherwise, return false.

Example

text nums = [2, 1, 3, 1, 2]

Possible removals:

• Remove 3 (index 2) → [2, 1, 1, 2]
• Remove 1 (index 1) → [2, 3, 1, 2]

(These examples illustrate the operation format only; they do not necessarily produce a valid pivot.)

Notes

• You must remove exactly one element.
• The pivot index must exist after the removal.
• Left and right sums do not include the pivot element itself.

Details

Practice leetcode questions to get familar with algorithm questions, but dont' get too obsessed with leetcode google tags, google has a fair large pool of interview techinical questions :)

LeetCode similar: Leetcode 253