How hard is LeetCode 2881. Create a New Column?

LeetCode 2881. Create a New Column is rated Easy on LeetCode.

What is the time complexity of LeetCode 2881. Create a New Column?

The Python solution on this page runs in O(1).

What is the space complexity of LeetCode 2881. Create a New Column?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 2881. Create a New Column cover?

LeetCode 2881. Create a New Column is tagged Pandas on LeetCode.

EasyNo. 2881

Create a New Column — LeetCode 2881 Python Solution

Topics: Pandas
Reading time: 2 min
Source: leetcode.com

Table schema

SQLTable schema

DataFrame employees +-------------+--------+ | Column Name | Type. | +-------------+--------+ | name | object | | salary | int.

Example

SQLExample

DataFrame employees
+-------------+--------+
| Column Name | Type.  |
+-------------+--------+
| name        | object |
| salary      | int.   |
+-------------+--------+

Python solution

PythonSolution

import pandas as pd


def createBonusColumn(employees: pd.DataFrame) -> pd.DataFrame:
    employees['bonus'] = employees['salary'] * 2
    return employees

Complexity

Time: O(1)
Space · auxiliary: O(1)

Related problems
No.	Problem	Difficulty
2877	Create a DataFrame from List	Easy
2874	Maximum Value of an Ordered Triplet II	Medium
2873	Maximum Value of an Ordered Triplet I	Easy
0057	Insert Interval	Medium
0192	Word Frequency	Medium
0193	Valid Phone Numbers	Easy

Frequently asked questions

How hard is LeetCode 2881. Create a New Column?: LeetCode 2881. Create a New Column is rated Easy on LeetCode.
What is the time complexity of LeetCode 2881. Create a New Column?: The Python solution on this page runs in O(1).
What is the space complexity of LeetCode 2881. Create a New Column?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2881. Create a New Column cover?: LeetCode 2881. Create a New Column is tagged Pandas on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Download for Mac Download for Windows

Free to download. Check it runs on your machine, then pick a plan.

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 Terra

Transcribing...

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

Primary display

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

Table schema

Example

Python solution

Complexity

Related problems

Frequently asked questions

Stuck on problems like this in a live interview?

Approach

Approach

Approach