Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8886223
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 14, 20262026-06-14T21:30:22+00:00 2026-06-14T21:30:22+00:00

If not, then a canonical name for a function? ‘Cycle’ makes sense to me,

  • 0

If not, then a canonical name for a function? ‘Cycle’ makes sense to me, but that’s taken.

The example in the header is written for clarity and brevity. Real cases I’m working with have a lot of repetition.
(e.g., I want [1, 1, 0, 0, 0, 2, 1] to “match” [0, 0, 2, 1, 1, 1, 0])

This type of thing is obscuring my algorithm and filling my code with otherwise useless repetition.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-14T21:30:23+00:00Added an answer on June 14, 2026 at 9:30 pm

    You can get the cycles of the list with:

    def cycles(a):
        return [ a[i:] + a[:i] for i in range(len(a)) ]
    

    You can then check if b is a cycle of a with:

    b in cycles(a)
    

    If the length of the list is long, or if want to make multiple comparison to the same cycles, it may be beneficial (performance wise) to embed the results in a set.

    set_cycles = set(cycles(a))
    b in set_cycles
    

    You can prevent necessarily constructing all the cycles by embedding the equality check in the list and using any:

    any( b == a[i:]+a[:i] for i in range(len(a)))
    

    You could also achieve this effect by turning the cycles function into a generator.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a method that looks for the word 'not' and then a word
I believe the below css is considered css3 if not then, it's not but
While setting the Canonical tag, i found out that i am not getting all
Does each of java API function map to java native method? If not then
Is better to use the below statement Convert.ToInt32(0 + stringValue) If not then why?
Is it part of Asp.Net MVC 2.0. If not then does Asp.Net MVC 2.0
Also I would like to ask if my app is not running then can
procedure MyProc(Eval: Boolean); begin if not Eval then Exit; /* do stuff */ /*
1.Need 10 digit mobile No(working) 2.Can be start 0-9(working) 3.not more then 10 digit(not
select p.partnerid, sum(case when c.amount is not null then c.amount else 0 end) as

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.