Skip to main content

Topics to Start - preparing for Data Structures and Algorithms


Learn in a different way :-


  1. Strings
  2. stacks and queues
  3. heaps
  4. searching
  5. hash table
  6. sorting
  7. recursion
  8. dynamic programming
  9. greedy algorithms
  10. graphs
  11. tree
  12. Binary Search Tree
  13. Linked List
  14. Array
  15. Parallel programming and concurrency
  16. design problems
  17. system design
  18. availability and scalability 
Below topics are good to have
  1. object oriented programming
  2. language details ( java , python)
  3. object oriented design
  4. tools ( bash , git , maven , jira , jenkins , docker , kubernetes)
  5. database
Labels:

Comments

Post a Comment

.

Popular posts from this blog

Adding Node at the End of Linked List

Adding Node at the End of Linked List:- The method takes two parameter one a head node of a linked list and other data too insert. public void addNodeEnd ( Node head , int data ) { if ( head == null ) { System . out . println ( "list is empty" ); return ; } Node node = new Node ( data ); Node temp = head ; while ( temp . next != null ) { temp = temp . next ; } temp . next = node ; } To Know the basic structure of the linked list click here
Post a Comment
Read more

DEPTH FIRST SEARCH IN JAVA

DEPTH FIRST SEARCH IN JAVA public void dfs () { vertex [ 0 ]. visited = true ; displyVertex ( 0 ); stackobj . push ( 0 ); while (! stackobj . isEmpty ()) { int v = adjVertex (( Integer ) stackobj . peek ()); if ( v ==- 1 ) { stackobj . pop (); } else { vertex [ v ]. visited = true ; displyVertex ( v ); stackobj . push ( v ); } } }
Post a Comment
Read more