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

Nth Node from End in LinkedList

Nth Node from End in LinkedList 1)  Find length of  linked list. 2) Traverse (length-position+1) element from begin. //nth Node from end public Node nodeFromEnd ( Node head , int position ){ Node temp = head ; int length = 1 ; while ( temp . next != null ) { length ++; temp = temp . next ; } System . out . println ( "length" + length ); temp = head ; int c = 1 ; while ( c !=( length - position + 1 )) { temp = temp . next ; c ++; } return temp ; }
Post a Comment
Read more

Best LeetCode Lists for Interviews

Here is a list of some of the best questions asked in interviews:-  Must do 75 https://leetcode.com/list/5hkn6wze/ Must do 60  https://leetcode.com/list/5eie1aqd/ Must do medium:-  https://leetcode.com/list/5xaelz7g/ Must do Easy:-   https://leetcode.com/list/5r7rxpr1/ Graph:-  https://leetcode.com/list/x18ervrd/  Dynamic Programming:-    https://leetcode.com/list/x14z0dxr/  FaceBook interviews:- https://leetcode.com/list/xyu98pv6/  Amazon Interviews:-  https://leetcode.com/list/5hkniyf7/  Google Interviews:- https://leetcode.com/list/xyu9xfo1/ https://github.com/nazarmubeen/TopProblems/blob/master/README.md
1 comment
Read more