Java Program to left rotate the elements of an array

[@srivardhankandike4514]

Great Explanation Bhaii!!!!!! Keep Updating with Array problesm

[@shawkishor]

Time complexity is O(n*n). If u want O(n) use reverse logic.

[@sangramswain8949]

Great explanation, thanks brother for make the code easy

[@richardbaba1298]

Thank you for helping me preparing for my exam!

[@CodeWithMurad]

Welcome do subscribe my channel and keep supporting:)
For any query or help do contact me
[e-mail]

[@richardbaba1298]

@@CodeWithMurad Done :) If you could make a video on Bag in java, that would be great!

[@CodeWithMurad]

@@richardbaba1298 actually as of now I'm working on another video soon I'll make video on this:)

[@inksquare5033]

Great bro!!! the way u explained the concept was very good and i hope u make videos on oops and other concepts like in Java.

[@CodeWithMurad]

Thanks brother. Yaah I'll definitely gonna make more videos...
Keep supporting.. ❤💯

[@inksquare5033]

@@CodeWithMurad Sure bro👍💯

[@KHSHotaShorts]

amazing brother

[@manojkandelkar4237]

very nicely explained

[@CodeWithMurad]

Thank You❤️

[@suiiiiii5798]

Thankss

[@mahalakshmi8527]

Thank you brother

[@samee.62]

Great

[@govindarajut1289]

great

[@skstatus4638]

Thanks you sir

[@mtrgaming1217]

Nice

[@amitkumar-s9q4f]

Time complexity: 0(n) , Space Complexity: 0(1)
class Solution {
void reverse(int arr[],int start, int end){
int i = start,j = end;
while(i

[@karthikeyenguruswamy3554]

It is correct solution but it does not pass the time complexity test case

[@gowthambhat1498]

time complexity is heigher

[@sameerfaridi2]

sound?

[@anandreddy.k9679]

not a good one