#84 GFG POTD, Rotate Bits solution | Puneet Kumar IIITD

#podt #gfg #geeksforgeeks #code #coding #problemsolving #podtgfg #gfgpotd #gfgpotd #gfgpotdtoday #potdgfgtoday #gfgpotdgfg #gfgproblems #gfgproblem #gfgtoday #geeksforgeekspotd #geekforgeeks #gfgcode #gfgcertificate #gfgdsa #gfgcontest #gfgjobathon #gfghakathon #gfgjobfair #gfgalgorithms #gfgdsa @puneetkumariiitd #code #programming #algorithm #datastructures #shorts #puneetiiit #iiitdelhi #graph #linkedlist #linkedlists #graph #bst #binarysearchtree #binarytree

Rotate Bits approach
Rotate Bits gfg potd

today's gfg potd solution link :

gfg potd link :

tree binary tree binary search tree
gfg hard problem easy solution
gfg hard potd solution in java hindi explanation
Longest K unique characters substring gfg potd
gfg problem Longest K unique characters substring solution in java cpp
find Longest K unique characters substring gfg potd solution
Longest K unique characters substring

gfg potd
gfg
potd gfg
gfg potd today
gfg potd yesterday
gfg potd tomorrow
potd gfg potd
gfg potd gfg

how to solve problem of the day geeks for geeks
gfg potd todays problem solution explanation hindi
solution of gfg todays problem
soluton of potd gfg
solution of problem of the day gfg
problem of the day geeks for geeks solution of todays problem
today potd gfg problem solution hindi
today gfg potd problem solution explained in java programming language
gfg potd problem solution in java programming language explained hindi
gfg potd solution today in hindi

solve today potd gfg problem
challenge me at gfg potd
solve potd gfg
gfg potd today
today gfg potd
gfg potd problems solutions
gfg potd hard
gfg potd easy
gfg potd hard problem
gfg potd medium problem
gfg potd easy problem
geeks for geeks problem of the day easy problem
geeks for geeks problem of the day medium problem
geeks for geeks problem of the day hard problem

code language used java
code explained in java
code writing in java
know more about java
java code gfg potd solution
java c++ python gfg potd solution
python potd gfg solution
java easy code potd gfg

---------------------------------------------------------------------------------------
geeks for geeks podt Rotate Bits
Rotate Bits
gfg podt solution Rotate Bits
geeks for geeks problem of the day solution with explanation
Rotate Bits algorithms
Rotate Bits gfg potd
Rotate Bits gfg problem of the day
Rotate Bits gfg
Rotate Bits potd geeks for geeks
Rotate Bits problem of the day gfg
Rotate Bits algorithm
Rotate Bits algorithms solution
Rotate Bits problem potd today
Rotate Bits java code full explanation
how to solve Rotate Bits
String problems and Queue linked list binary tree
String character queue array

How to use Level Order Traversal
The graph Data structure in Hindi
Spiral Level Order Traversal
Use of Tree Data structure in real Life
question asked in Google
Level order traversal in spiral form
off-campus placement
how to learn to code for beginners
Rotate Bits

geeks for geeks podt Rotate Bits
Rotate Bits
gfg podt solution Rotate Bits
geeks for geeks problem of the day solution with explanation
hot to find Rotate Bits
how to sovle Rotate Bits gfg potd
how to do Rotate Bits gfg problem of the day
how to approach Rotate Bits gfg
approach Rotate Bits potd geeks for geeks
find Rotate Bits problem of the day gfg
solve Rotate Bits algorithm
gfg potd Rotate Bits algorithms solution
Rotate Bits problem potd today
Rotate Bits java code full explanation
how to solve Rotate Bits
String problems and Queue linked list binary tree
String character queue array
-----------------------------------------------------------------------------------
problem description :
Given an integer N and an integer D, rotate the binary representation of the integer N by D digits to the left as well as right and return the results in their decimal representation after each of the rotation.
Note: Integer N is stored using 16 bits. i.e. 12 will be stored as 0000000000001100.

Your Task:
You don't need to read input or print anything. Your task is to complete the function rotate() which takes the integer N and integer D as inputs and returns an array of size 2 where arr[0] = Decimal value after left rotation and arr[1] = Decimal value after right rotation.

Expected Time Complexity: O(1).
Expected Auxiliary Space: O(1).
-------------------------------------------------------------------------------------

[mohd.shaqibanwar]

explanation is quite elaborated and easy. keep it up bro!!!

[nidhimishra]

Was quite difficult to understand , then i saw video twice and everything got clear !

[sarthakgupta]

understandable solution provided, thanks. I have got my gfg tshirt sir, thank you for guiding me whenever I wasn't able to come up with the solution, thanks.

[shubhankarsharma]

Sir how did u learn this technic of solving this. I couldn't look for this way of solving at all. What is this topic name related to?

[dayashankarlakhotia]

class solution {
Array List <interger >rotate (int n, int d){
Array <List <interger >res=new Array list <>();
d=d%16;
int left
int right
res.add(left);
res.add(right);
return res;
}
};

[sachindwivedi]

can we use short data type in java (which is a 16-bit data type) and later we can convert back to int. Yeah! this code is good independent of language.

[utkarshbajpayee]

code men 0 se and krke remaining 16 bit kaise ignore kr rhe h jaisa starting men explain kiya tha please explain..