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 | 530 Views, 23976 Search Bots | 94 Words
| Browse | Archive
Tags: 每日算法题, Longest Substring With K Distinct Characters算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 530 Views, 23976 Search Bots | 94 Words
| 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:
Tags: 每日算法题, Longest Substring With K Distinct Characters算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 530 Views, 23976 Search Bots | 94 Words 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)
Related Articles
- CPU Utilization
- Algorithm Interview Question: Symmetric k-ary Tree
- Design Tic-Tac-Toe
- Find Missing Numbers in an Array
- Algorithm Interview: Permutations of numbers
- Daily Interview Problem: Buddy Strings
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Non-decreasing Array with Single Modification
- Fibonacci coding
- Algorithm Interview: Determine If Linked List is Palindrome
©2006~2024 SteakOverCooked - 0.00708 Seconds(s) - 2676.924 KB/s - 37 Online Memory: 493.19 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !