Longest Substring Without Repeating Characters

Open
#243 0 comments 3 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
2/5
Estimated time
1-3 hours
Newbie friendliness
55/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
python
Domain
backend

Research direction

Open the linked longest-substring-without-repeating-characters directory and read the linked LeetCode problem and Algodale explanation first. Add the Python solution in that directory, then verify that it solves the stated problem and matches the repository's existing structure.

Written by the indexing model from the issue text.

Description

problem
Dominant language
Python
Stars
156
Forks
359
Avg merge
1d 16h
Merged PRs (30d)
38

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from DaleStudy/leetcode-study

All issues in DaleStudy/leetcode-study

Similar issues

More Python issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.