To the Top
File:  root - text - article - 2020 - 01 - shifted-string.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 592 Views, 20840 Search Bots | 79 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Apple:

You are given two strings, A and B. Return whether A can be shifted some number of times to get B.

Eg. A = abcde, B = cdeab should return true because A can be shifted 3 times to the right to get B. A = abc and B= acb should return false.


def is_shifted(a, b):
# Fill this in.

print is_shifted('abcde', 'cdeab')
# True
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 592 Views, 20840 Search Bots | 79 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Deepest Node in a Binary Tree
  2. Daily Interview Problem: Running Median
  3. 56 Bytes
  4. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  5. Daily Interview Problem:Create a balanced binary search tree
  6. Daily Interview Question: Longest Sequence with Two Unique Numbers
  7. [Daily Problem] Validate Balanced Parentheses
  8. A trick for getting good at coding interviews FASTER
  9. Find Pythagorean Triplets
  10. Fix Brackets

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />