Circular Array Rotation || Hackerrank Solution || Java || Hindi

#Hackerrank #hacker #hackers #hackerstayaway

Hackerrank Circular Array Rotation Problem Solution in Java
This is a Hackerrank Problem Solving series

HackeRrank Quention Link :-

Sari videos dekhne ke liye yaha click karen :-

In this video, we will solve a problem from HackeRrank in java

Please subscribe my channel and hit the bell icon so you will be notified when I will upload more videos on YouTube

Please Like Share and Subscribe.

Thank You...

[ApproachwithHimanshu]

You must stick in one approach properly

[shoe_space]

I have solved this question in big(0) n time complexity but the only drawback is that my one test case failed to see the code below sir
int n1 = queries.size();
List<Integer> newlist= new ArrayList<>();
for(int j=0;j<n1;j++){
int carry= queries.get(j)-k;
if(carry<0){

}
else{
newlist.add(a.get(carry));
}
}
return newlist;