How to Reverse an Array in Java - Animation

preview_player
Показать описание

Watch all my playlist here:

Want to land a software engineering job in the IT industry? This course - 'Visualizing Data Structures and Algorithms' is here to help. The course walks you through multiple Java algorithms, data structures problems, and their solutions with step by step visualizations, so that you are actually learning instead of blindly memorizing solutions.

The course covers in and outs of Data Structures and Algorithms in Java. Java is used as the programming language in the course. Students familiar with Javascript, Python, C#, C++, C, etc will also get to learn concepts without any difficulty. The implementation of various Algorithms and Data Structures have been demonstrated and implemented through animated slides. It covers many interview room questions on Algorithms and Data Structures. The questions and solutions are demonstrated by -

1. Animated slide. (To make visualization of algorithms faster)
2. Coding algorithm on IDE.

The course covers topics such as -
0. Algorithm Analysis
1. Arrays
2. Matrix
3. Singly Linked List
4. Doubly Linked List
5. Circular Singly Linked List
6. Stacks
7. Queues
8. Binary Tree
9. Binary Search Tree
10. Graphs
11. Priority Queues and Heaps
12. Recursion
13. Searching
14. Sorting
15. Strings
16. Trie Data Structure
17. Dynamic Programming
and many more ...

#dsa #algorithms #coding
Рекомендации по теме
Комментарии
Автор

Best series for DS & Algo. I am also 10 yrs java exp guy. Was looking for DS & Algo free course over YouTube with java implementation and found this. Hats Off To You Man....Excellent Work. GOD BLESS YOU :)

shubhamagarwal
Автор

When am watching everying single video and While explaining You told the idea behind that particular algo and aftre that i pause the video and try to implement it on my own and match with your code some time it was right some time not and i correct mycode .Great videos😍

InPic
Автор

Your course is best in the youtube as my personal opinion.

soumyadipmajumder
Автор

Way of your explanation is very good.❤👌

divyansh
Автор

Thank you so much sir .Every videos of concept explaining very easy method .❤

gauravpatel
Автор

Thanku🙏 also give all concept which used during program..

Anc.s
Автор

Sir, i have a doubt why is it possible in reverse array function with void and
without return type and here not?

venkatasaivishal
Автор

Thank u so much for making this tutorial for free

naveenbala
Автор

If we have odd number of values then how we apply the same algorithm for it.

voiceofyvr
Автор

can you tag leetcode question for the problem?

jshankarc
Автор

how about this? I used for loop for this
int[] reverseArray(int[] arr) {
int n = arr.length;

int[] result = new int[n];
int index = 0;
for (int i = n -1; i >= 0; i--){
result[index] = arr[i];
index++;
}
return result;
}

soft.solutions
Автор

Sir app Data structure with java k hackerrank k problem solving videos bna k upload kriye we need to understand how to solve hackerrank problem plz sir do it.

__ritto___
Автор

This method is the simple method .
public class reverse
{
public reverse()
{

int arr[]=new int[]{1, 2, 3, 4, 5};
int p=arr.length;

for(int i=0;i<p;i++)
{
System.out.print(" "+arr[i]);
}
System.out.println("\nAfter Reverse");
for(int i=p;i!=0;i--)
{
System.out.print(" "+arr[i-1]);
}

}

public static void main(String[] args) {
reverse r=new reverse();
}
}

ajayrajpoot
Автор

You did a great job. May Allah guide us all to the truth.

MrPsychologie
Автор

int[] a= {2, 11, 5, 10, 7, 8};

for(int i=0;i<a.length;i++) {





}

bhavyats
Автор

what if I solve this problem with this method
int[] myArray ={645, 567, 56, 345, 234, 4567, 67, 3254} ;
int[] resultArray=new int[myArray.length];
for(int i=0; i < myArray.length; i++){
myArray[i];
}

akashmahmud