Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

Given a singly linked list, The task is to rotate the linked list counter-clockwise by k nodes.Examples:Input: linked list = 10-&gt;20-&gt;30-&gt;40-&gt;50-&gt;60, k = 4 Output: 50-&gt;60-&gt;10-&gt;20-&gt;30-&gt;40.&nbsp; Explanation: k is smaller than the count of nodes in a linked list so (k+1 )th node i.e. 50 becomes the head node and 60’s next points to 10Input: linked list = 30-&gt;40-&gt;50-&gt;60, k = 2 Output: 50-&gt;60-&gt;30-&gt;40.Approach: Below is the idea to solve the problem:To rotate the linked list, we need to change the next pointer of kth node to NULL, the next pointer of the last node should point to the previous head node, and finally, change the head to (k+1)th node. So we need to get hold of three nodes: kth node, (k+1)th node, and last node.&nbsp; Traverse the list from the beginning and stop at kth node. store k’s next in a tem pointer and point k’s next to NULL then start traversing from tem and keep traversing till the end and point end node’s next to start node and make tem as the new head.Related Article : <a href="https://www.geeksforgeeks.org/rotate-a-linked-list/">https://www.geeksforgeeks.org/rotate-a-linked-list/</a>

Rotate a Linked List

In this video, we will see the Java Program to Check if Strings are Rotations of each other or not.&nbsp; Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.&nbsp; Rules for String Rotations:&nbsp; Rule 1: Number of characters in both the strings must be equal.&nbsp; Rule 2: All characters must be the same.&nbsp; Rule 3: Rotated around one of the characters. i.e str2 must be a substring of the str1 concatenated with str1.&nbsp; Algorithm:&nbsp; 1. First we create a temp string and store the concatenation of str1 to str1 in the temp string.i.e temp = str1.str1&nbsp; 2. If str2 is a substring of temp then str1 and str2 are rotations of each other.&nbsp; Example:&nbsp; str1 = "abcd"&nbsp; str2 = "efgh"&nbsp; temp = str1.str1 = "abcdabcd"&nbsp; str2 = bcda&nbsp; Output: Yes Since str2 is a substring of temp, str1 and str2 are rotations of each other.&nbsp; Here we use the string Concat method to check if Strings are Rotations of each other or not. Java Program to Check if strings are rotation of each other or not: <a href="https://www.geeksforgeeks.org/java-program-to-check-if-strings-are-rotations-of-each-other-or-not/">https://www.geeksforgeeks.org/java-program-to-check-if-strings-are-rotations-of-each-other-or-not/</a>

Java Program to Check if Strings are Rotations of each other or not

Array rotation involves shifting elements in an array to the left or right by a specified number of positions and is widely used in coding interviews and practical applications like circular buffers, game logic, and data manipulation. Key methods include using an auxiliary array, the reversal algorithm, cyclic replacements, and the juggling algorithm, each offering varying time and space complexities. While the auxiliary array method is straightforward and runs in O(n) time, it requires O(n) space. The reversal and juggling algorithms, operating in O(n) time and O(1) space, are more efficient for memory-constrained scenarios. Practical implementations in Python, Java, and C++ demonstrate how these methods can be applied effectively.Understanding array rotation sharpens algorithmic skills and helps in solving complex problems. Testing for edge cases like rotating by zero or array length ensures robustness. Whether for competitive programming or real-world tasks, mastering array rotation equips you with versatile techniques for efficient data manipulation.&nbsp; For more details, please go through - <a href="https://request.geeksforgeeks.org/?p=980614">Rotate an Array – Clockwise or Right</a>

Left Rotation by d Places

Given a string s1 and a string s2, write a snippet to say whether s2 is a rotation of s1?&nbsp; (eg given s1 = ABCD and s2 = CDAB, return true, given s1 = ABCD, and s2 = ACBD , return false)Algorithm: areRotations(str1, str2)&nbsp; &nbsp;1. Create a temp string and store concatenation of str1 to &nbsp; &nbsp; &nbsp; str1 in temp. &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;temp = str1.str1 &nbsp; &nbsp;2. If str2 is a substring of temp then str1 and str2 are&nbsp; &nbsp; &nbsp; &nbsp; rotations of each other.&nbsp; &nbsp;Example: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; str1 = "ABACD" &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; str2 = "CDABA"&nbsp; &nbsp; temp = str1.str1 = "ABACDABACD" &nbsp; &nbsp; Since str2 is a substring of temp, str1 and str2 are&nbsp; &nbsp; &nbsp; rotations of each other.A Program to check if strings are rotations of each other or not: <a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/">https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/</a>

A Program to check if strings are rotations of each other or not

Embark on a journey through string manipulation and algorithmic analysis with this insightful guide from GeeksforGeeks. In this illuminating article, you'll explore the task of determining if one string can be obtained by rotating another string by two places—an essential problem in string processing with applications in text comparison, cryptography, and algorithmic design.Discover the principles behind string rotation and comparison techniques, and learn strategies for efficiently checking if one string can be obtained by rotating another string by two places. Whether you're a programmer optimizing algorithms or a data scientist analyzing text data, mastering the art of string manipulation is crucial for solving a wide range of computational challenges.Prepare to delve into the world of string algorithms and algorithmic strategies as you explore detailed explanations and practical examples provided in the article. Unlock the mysteries of string rotation detection by delving into the accompanying guide on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/check-string-can-obtained-rotating-another-string-2-places/">https://www.geeksforgeeks.org/check-string-can-obtained-rotating-another-string-2-places/</a>

Check if string is rotated by two places | DSA Problem

Embark on a journey through string manipulation and algorithmic analysis with this insightful guide from GeeksforGeeks. In this illuminating article, you'll explore the task of determining if two strings are rotations of each other—an essential problem in string processing with applications in text comparison, pattern recognition, and algorithmic design.Discover the principles behind string rotation and comparison techniques, and learn strategies for efficiently checking if strings are rotations of each other. Whether you're a programmer optimizing algorithms or a data scientist analyzing text data, mastering the art of string manipulation is crucial for solving a wide range of computational challenges.Prepare to delve into the world of string algorithms and algorithmic strategies as you explore detailed explanations and practical examples provided in the article. Unlock the mysteries of string rotation detection by delving into the accompanying guide on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/">https://www.geeksforgeeks.org/a-program-to-check-if-strings-are-rotations-of-each-other/</a>

Check if strings are rotations of each other or not | DSA Problem

In this video, we will write a C program for printing 180-degree rotation of a simple pyramid.&nbsp; To print a simple pyramid, you should rotate the object 90 degrees along the y axis. This way, the pyramid will look like a regular triangle. Example: Input: n= 3 Output =&nbsp; * ** *** Here we see 3 different approaches for printing a 180-degree rotation of a pyramid. 1. Using Nested for loop: First for loop is used to identify the number of rows and the second for loop is used to identify the number of columns. Here the values will be changed according to the first for loop. If j is greater than I then it will print the output otherwise print the space. 2. Using Nested While Loop: The while loops check the condition until the condition is false. If the condition is true then enters into a loop and executes the statements. 3. Using Recursion and a for loop: Here we call a recursion function with three parameters n, space, and an asterisk. After printing a simple pyramid with the help of for loop. The time complexity will be high and space complexity will be low in the first 2 approaches, But the opposite (time complexity low and space complexity high) will happen in Approach-3. C Program For Printing 180 Degree Rotation of Simple Half Left Pyramid <a href="https://www.geeksforgeeks.org/c-program-for-printing-180-degree-rotation-of-simple-half-left-pyramid/">https://www.geeksforgeeks.org/c-program-for-printing-180-degree-rotation-of-simple-half-left-pyramid/</a>

C Program For Printing 180 Degree Rotation of Simple Pyramid

In this video, we will see C++ Program to generate all rotations of a given string. Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.&nbsp; So, in given string S we will print all the possible rotated strings. Examples:&nbsp; Input : S = "geeks" Output :&nbsp; geeks eeksg eksge ksgee sgeek Input : S = "abc"&nbsp; Output :&nbsp; abc bca cab Here we will see three different approaches for the same: 1. Using the Iterative method(for loop) 2. Using Concatenate string method 3. Using substr() The idea is to run a loop from i = 0 to n – 1, i.e for each point of rotation, copy the second part of the string in the temporary string and then copy the first part of the original string to the temporary string. In the next method, we do str. str where . is the concatenation operator. Now we traverse the concatenated string from 0 to n – 1 and print all substrings of size n. In another method, we use the string Concat method to check all rotations of the string. Program to generate rotations of given string: <a href="https://www.geeksforgeeks.org/generate-rotations-given-string/">https://www.geeksforgeeks.org/generate-rotations-given-string/</a>

C++ Program to Generate all Rotations of a given String

Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.&nbsp; In left rotation, the bits that fall off at left end are put back at right end.&nbsp; In right rotation, the bits that fall off at right end are put back at left end.Example:&nbsp; Let n is stored using 8 bits. Left rotation of n = 11100101 by 3 makes n = 00101111 (Left shifted by 3 and first 3 bits are put back in last ). If n is stored using 16 bits or 32 bits then left rotation of n (000…11100101) becomes 00..0011100101000.&nbsp; Right rotation of n = 11100101 by 3 makes n = 10111100 (Right shifted by 3 and last 3 bits are put back in first ) if n is stored using 8 bits. If n is stored using 16 bits or 32 bits then right rotation of n (000…11100101) by 3 becomes 101000..0011100.&nbsp;&nbsp;Rotate bits of a number : <a href="https://www.geeksforgeeks.org/rotate-bits-of-an-integer/">https://www.geeksforgeeks.org/rotate-bits-of-an-integer/</a>

Rotate bits of a number

Consider an array arr of distinct numbers sorted in increasing order. Given that this array has been rotated (clockwise) k number of times. Given such an array, find the value of k.Examples: &nbsp;Input: arr[] = {15, 18, 2, 3, 6, 12} Output: 2 Explanation: Initial array must be {2, 3, 6, 12, 15, 18}. We get the given array after rotating the initial array twice.Find the Rotation Count in Rotated Sorted array : <a href="https://www.geeksforgeeks.org/find-rotation-count-rotated-sorted-array/">https://www.geeksforgeeks.org/find-rotation-count-rotated-sorted-array/</a>

Find the Rotation Count in Rotated Sorted array