文件: root - text - article - 2019 - 10 - daily-problem-longest-substring-without-repating-characters.txt
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 312 次阅读, 20691 次搜索 | 81 个单词
| 浏览 | 博客存档
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 312 次阅读, 20691 次搜索 | 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, | 英文 | 主页 | 类别: 计算机科学 | 312 次阅读, 20691 次搜索 | 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?
猜您喜欢...
- Spreadsheet Columns
- Algorithm Interview Question: Max and Min with Limited Comparisons
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Making a Height Balanced Binary Search Tree
- [Daily Problem] Angles of a Clock
- Batch Programming in XP
- Algorithm Interview: Longest Consecutive Sequence
- Number of Ways to Climb Stairs
- Daily Interview Problem: Maximum Profit From Stocks
- Autorun.inf Virus Protection
©2006~2024 牛排过熟 - 0.0131 秒 - 4117.185 KB/s - 19 在线 内存: 531.55 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。