Code Room
CodingEasy
Question
Given a list of integers nums, return the second largest distinct value. If there is no second distinct value (the list is empty or every element is equal), return None. Example: [3, 1, 3, 2] has distinct values {1,2,3}, so the answer is 2.
Implement
second_largest(nums: list[int]) → int | NoneExamples
in
[[3,1,3,2]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.