Feed
Pro
Search

Author

Write
Drafts

Bug0 - The AI-native e2e QA regression testing Bug0 Browsers - Cloud Chromium on demand, per-minute, live preview Passmark - The open-source AI framework for regression testing Hackathons Changelog Brand @hashnode on X Hashnode on LinkedIn Support - hello+support@hashnode.com Code of Conduct Terms Privacy Sitemap
Sign in

Search Hashnode

Search posts, tags, users, and pages

Discussion on "Juggling Algorithm for Array Rotation." | Hashnode

FeedDiscussion

Sai Laasya Vabilisetty

Java Developer | Machine Learning| Tech Blogger

Sep 17, 2020

Juggling Algorithm for Array Rotation.

Hello Everyone!💚 This article is everything you need to know about array rotation. Array Rotation is one of the most important concepts, used in a wide range of problems which includes shifting of elements. CONTENTS What is array rotation? Some of ...

laasyasettyblog.hashnode.dev5 min read

#programming #2articles1week #blogging #coding #data-structures

Responses(6)

Tharun Reddy

#123tharun

Sep 22, 2021

Sai Laasya Vabilisetty

Thank you for the great explanation. Consider an array [1,2,3] which needs to be rotated right by 3. In this case k=4 and k is going to be 3-4 i.e n-k. Does n-k work in all the cases?

Shashank Pal

Nothing

Aug 21, 2021

This is a shitty explanation, it explains how to memorize the algorithm. Instead of explaining why it even does that. Why do we use gcd.

Teja Gowtham

coding

Jan 25, 2021

Hi laasya, great explanation. Can you give little more intuition into why GCD times? how exactly GCD justifies it..

Jatin Rao

Front End Web Developer

Sep 19, 2020

Awesome Article Laasya! Thanks for sharing 😀