Notes/C++/Java/Python codes in Step 3.1 of [ Ссылка ]

Left Rotate array by 1 place: [ Ссылка ]
Left Rotate array by D places: [ Ссылка ]
Right Rotate array by d places: [ Ссылка ]
Move zeros to End: [ Ссылка ]
Linear Search: [ Ссылка ]
Union of two sorted Arrays: [ Ссылка ]
The intersection of two sorted arrays: [ Ссылка ]

Problem links
Left Rotate array by 1 place: [ Ссылка ]
Left Rotate array by K places: [ Ссылка ]
Move zeros to End: [ Ссылка ]
Linear Search: [ Ссылка ]
Union of two sorted Arrays: [ Ссылка ]
Intersection of two sorted arrays: [ Ссылка ]

We have solved the above problems, and we have gone from brute force and ended with the most optimal solution.

Full Course: [ Ссылка ]

You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: [ Ссылка ]

0:00 Introduction of course
01:01 Left rotate an Array by 1 Place
07:17 Code-compiler (Left rotate an Array by 1 Place)
08:05 Left rotate an Array by D Places
20:18 Code-compiler (Left rotate an Array by D Places )
27:13 Move zeroes to end
40:30 Code-compiler (Move zeroes to end )
41:05 Linear search
42:43 Code-compiler (Linear search )
43:04 Union of two sorted array
53:33 Code-compiler (Union of two sorted array)
59:05 Intersection of two sorted array
1:09:30 Code-compiler (Intersection of two sorted array)

свернуть