File: root - text - article - 2019 - 10 - daily-problem-longest-substring-without-repating-characters.txt
Tags: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | English | Home Page | Category: Computing | 567 Views, 24098 Search Bots | 81 Words
| Browse | Archive
Tags: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | English | Home Page | Category: Computing | 567 Views, 24098 Search Bots | 81 Words
| Browse | Archive
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?
Tags: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | English | Home Page | Cateogry: Computing | 567 Views, 24098 Search Bots | 81 Words 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?
Related Articles
- Spreadsheet Columns
- Daily Interview Problem: Minimum Removals for Valid Parenthesis
- Find the non-duplicate number
- Floor and Ceiling of a Binary Search Tree
- [Daily Problem] Remove k-th Last Element From Linked List
- Algorithm Interview: Make the Largest Number
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Daily Interview Problem: Spiral Traversal of Grid
- Binary Tree Level with Minimum Sum
- Daily Interview Problem: Count Number of Unival Subtrees
©2006~2024 SteakOverCooked - 0.00854 Seconds(s) - 2341.234 KB/s - 36 Online Memory: 494.15 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="index, 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 !