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 | 318 Views, 21209 Search Bots | 81 Words
| Browse | Archive
Tags: 微软, 面试题, 最长子字符串, Microsoft, interview questions, daily problems, longest substring, | English | Home Page | Category: Computing | 318 Views, 21209 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 | 318 Views, 21209 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
- Algorithm Interview Question: Nth Fibonacci Number
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Algorithm Interview: String Compression
- Find Missing Numbers in an Array
- Algorithm Interview: Permutations of numbers
- Find the non-duplicate number
- Daily Interview Problem: Minimum Removals for Valid Parenthesis
- Daily Interview Question: Edit Distance
- Daily Interview Puzzle: Intersection of Linked Lists
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
©2006~2024 SteakOverCooked - 0.01333 Seconds(s) - 1384.727 KB/s - 31 Online Memory: 495.53 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 !