Stealth Interview
  • Features
  • Pricing
  • Blog
  • Login
  • Sign up

Leetcode #1667: Fix Names in a Table

In this guide, we solve Leetcode #1667 Fix Names in a Table in Python and focus on the core idea that makes the solution efficient.

You will see the intuition, the step-by-step method, and a clean Python implementation you can use in interviews.

Leetcode

Problem Statement

Table: Users +----------------+---------+ | Column Name | Type | +----------------+---------+ | user_id | int | | name | varchar | +----------------+---------+ user_id is the primary key (column with unique values) for this table. This table contains the ID and the name of the user.

Quick Facts

  • Difficulty: Easy
  • Premium: No
  • Tags: Database

Intuition

The task is relational in nature, which maps cleanly to DataFrame operations in Python.

By treating tables as DataFrames, joins and group-bys become concise and readable.

Approach

Load the inputs as DataFrames and apply the appropriate merge, filter, or group-by.

Select or rename the columns to match the required output.

Steps:

  • Load inputs as DataFrames.
  • Apply merge/groupby/filter operations.
  • Select the output columns.

Example

+----------------+---------+ | Column Name | Type | +----------------+---------+ | user_id | int | | name | varchar | +----------------+---------+ user_id is the primary key (column with unique values) for this table. This table contains the ID and the name of the user. The name consists of only lowercase and uppercase characters.

Python Solution

import duckdb import pandas as pd def solution(users: pd.DataFrame) -> pd.DataFrame: con = duckdb.connect() con.register("Users", users) return con.execute("""SELECT user_id, CONCAT(UPPER(LEFT(name, 1)), LOWER(SUBSTRING(name, 2))) AS name FROM users ORDER BY user_id;""").df()

Complexity

The time complexity is O(n log n) (typical). The space complexity is O(n).

Edge Cases and Pitfalls

Watch for boundary values, empty inputs, and duplicate values where applicable. If the problem involves ordering or constraints, confirm the invariant is preserved at every step.

Summary

This Python solution focuses on the essential structure of the problem and keeps the implementation interview-friendly while meeting the constraints.


Ace your next coding interview

We're here to help you ace your next coding interview.

Subscribe
Stealth Interview
© 2026 Stealth Interview®Stealth Interview is a registered trademark. All rights reserved.
Product
  • Blog
  • Pricing
Company
  • Terms of Service
  • Privacy Policy