HackerRank - Left Rotation | Full Solution and Examples | Study Algorithms

Given an array of integers, you need to perform a left rotation on the array 'k' number of times. This video explains you what is rotation and how can you go about solving the problem. This is a very important interview question and the video shows 2 ways to solve it. Watch the video to know more.

00:00 - Intro
01:14 - Problem Statement and sample test cases
04:46 - Brute Force solution
06:53 - Method 1
09:23 - Method 2
12:31 - Final thoughts

? The problem description and solution is available at: https://studyalgorithms.com/array/hackerrank---left-rotation/

? Links I talk about in the video
Brute Force Algorithmic Paradigm: https://youtu.be/kdTpUjd71G8
Problem on HackerRank: https://www.hackerrank.com/challenges/array-left-rotation/problem
Code on Github: https://github.com/nikoo28/java-solutions/blob/master/src/main/java/hackerrank/datastructures/arrays/LeftRotation.java
TestCases on Github: https://github.com/nikoo28/java-solutions/blob/master/src/test/java/hackerrank/datastructures/arrays/LeftRotationTest.java

? To see more videos like this, you can show your support on: https://www.buymeacoffee.com/studyalgorithms

? Get Social ?
Follow on Facebook at: https://www.facebook.com/studyalgos
Follow on Twitter at: https://www.twitter.com/studyalgorithms
Follow on Tumblr at: https://studyalgos.tumblr.com/
Subscribe to RSS feeds: https://studyalgorithms.com/feed/

#hackerrank #programming #tutorial