文件: root - text - article - 2019 - 10 - daily-problem-longest-substring-without-repating-characters.txt
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 544 次阅读, 22953 次搜索 | 81 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | 英文 | 主页 | 类别: 计算机科学 | 544 次阅读, 22953 次搜索 | 81 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
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, | 英文 | 主页 | 类别: 计算机科学 | 544 次阅读, 22953 次搜索 | 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?
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- ImageMagick Vulnerabilities - CVE-2016–3714
- Daily Interview Problem: Reverse Words in a String
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Kaprekar
- Find the non-duplicate number
- Algorithm Interview: Level Order Traversal of Binary Tree
- Daily Interview Problem: Deepest Node in a Binary Tree
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
- Daily Interview Problem: 3 Sum
©2006~2024 牛排过熟 - 0.0085 秒 - 2341.314 KB/s - 29 在线
内存: 495.49 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="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。