文件: root - text - article - 2019 - 10 - daily-problem-longest-substring-without-repating-characters.txt
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 231 次阅读, 18150 次搜索 | 81 个单词
| 浏览 | 博客存档
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 231 次阅读, 18150 次搜索 | 81 个单词
| 浏览 | 博客存档
This problem was recently asked by Microsoft:
Given a string, find the length of the longest substring without repeating characters.
Here is an example solution in Python language. (Any language is OK to use in an interview, though we'd recommend Python as a generalist language utilized by companies like Google, Facebook, Netflix, Dropbox, Pinterest, Uber, etc.,)
Can you find a solution in linear time?
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 231 次阅读, 18150 次搜索 | 81 个单词 Given a string, find the length of the longest substring without repeating characters.
Here is an example solution in Python language. (Any language is OK to use in an interview, though we'd recommend Python as a generalist language utilized by companies like Google, Facebook, Netflix, Dropbox, Pinterest, Uber, etc.,)
class Solution:
def lengthOfLongestSubstring(self, s):
# Fill this in.
print Solution().lengthOfLongestSubstring('abrkaabcdefghijjxxx')
# 10
Can you find a solution in linear time?
猜您喜欢...
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Patterns for breaking down questions you haven
- Reverse a Directed Graph
- Skip the readings, focus on problems. And use all the hints!
- Daily Interview Problem: Running Median
- [Daily Problem] Validate Balanced Parentheses
- Daily Interview Problem: Room scheduling
- Daily Interview Question: Find Cycles in a Graph
- Algorithm Interview: String Compression
- Algorithm Interview: Level Order Traversal of Binary Tree
©2006~2024 牛排过熟 - 0.07419 秒 - 246.303 KB/s - 20 在线 内存: 492.48 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。