ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
I solved this question using the sliding windows algorithm 🎉
Yes... You can share your logic also
@@anandtech-tamil3593 private static void rearrangeAndFindSubArrays(int[] bigArray, int[] smallArray) { Arrays.sort(smallArray); int bigSize = bigArray.length; int smallSize = smallArray.length; boolean subArrayFound = false; for (int i = 0; i
Bro.. For every window. We need to check whether it is present in small array.. Apdidhane bro...
@@challengemania4447 yes , have to sort the subarray and small array and compare
Can you share the all questions ⁉️
Kindly check my community tap
Thank you @@anandtech-tamil3593
I got interview call from zoho for backend developer role 2nd round how to prepare for interview
Nice, all the best,,, focus on dsa... Mudinja 2nd round question share pannuga. 1st round epo attend pannega?
I solved this question using the sliding windows algorithm 🎉
Yes... You can share your logic also
@@anandtech-tamil3593
private static void rearrangeAndFindSubArrays(int[] bigArray, int[] smallArray) {
Arrays.sort(smallArray);
int bigSize = bigArray.length;
int smallSize = smallArray.length;
boolean subArrayFound = false;
for (int i = 0; i
@@anandtech-tamil3593
private static void rearrangeAndFindSubArrays(int[] bigArray, int[] smallArray) {
Arrays.sort(smallArray);
int bigSize = bigArray.length;
int smallSize = smallArray.length;
boolean subArrayFound = false;
for (int i = 0; i
Bro.. For every window. We need to check whether it is present in small array.. Apdidhane bro...
@@challengemania4447 yes , have to sort the subarray and small array and compare
Can you share the all questions ⁉️
Kindly check my community tap
Thank you @@anandtech-tamil3593
I got interview call from zoho for backend developer role 2nd round how to prepare for interview
Nice, all the best,,, focus on dsa...
Mudinja 2nd round question share pannuga. 1st round epo attend pannega?