To the Top
File:  root - text - article - 2019 - 12 - longest-substring-with-k-distinct-characters.txt.txt
Tags: 每日算法题, Longest Substring With K Distinct Characters算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 451 Views, 22676 Search Bots | 94 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Amazon:

You are given a string s, and an integer k. Return the length of the longest substring in s that contains at most k distinct characters.

For instance, given the string:
aabcdefff and k = 3, then the longest substring with 3 distinct characters would be defff. The answer should be 5.

Here's a starting point:


def longest_substring_with_k_distinct_characters(s, k):
# Fill this in.

print longest_substring_with_k_distinct_characters('aabcdefff', 3)
# 5 (because 'defff' has length 5 with 3 characters)
Tags: 每日算法题, Longest Substring With K Distinct Characters算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 451 Views, 22676 Search Bots | 94 Words Subscribe to Feed Burner

Related Articles

  1. Floor and Ceiling of a Binary Search Tree
  2. A trick for getting good at coding interviews FASTER
  3. [Daily Problem] Witness of The Tall People
  4. [Daily Problem] Add two numbers as a linked list
  5. Daily Interview Question: Create a Simple Calculator
  6. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  7. Skip the readings, focus on problems. And use all the hints!
  8. Compare Version Numbers
  9. Longest Substring Without Repeating Characters
  10. Consecutive Ones

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />