 دسته بندی دوره ها

# Data Structure & Algorithms Complete Course in Java

سرفصل های دوره

Master Data Structure & Algorithms Course For Cracking Coding Interviews for Top product-based Companies.

1. Array problems solving techniques with examples
• 1. Time Complexity and Space Complexity Introduction
• 2. Design a data Structure which support Insert delete, Random in O(1) time
• 3. Segregation logic to Sort an array of 0s, 1s and 2s
• 4. Merge Sort Introduction
• 5. Merge Sort Code Implementation
• 6. Linear time approach to solve jump game problem
• 7. Digit rearrangement method to find next greater number with same set of digits
• 8. Greedy Techniques to find minimum number of platforms
• 9. Print matrix in spiral order without any extra space
• 10. Count frequencies of array elements in O(n) time complexity
• 11. Linear time approach to solve Stock Buy Sell Problem
• 12. In-place matrix rotation by 90 degree problem
• 13. Array puzzle of solving celebrity problem
• 14. Next Permutation Problem
• 15. QuickSelect Algorithm to find the Kth smallest Element in array - 1
• 16. QuickSelect Algorithm to find the Kth smallest Element in array - 2
• 17. Binary search method to find square root of an element
• 18. Rain Trapping Problem
• 19. Merge sort method to Count inversion in an array
• 20. Binary search method to find Median of two sorted Array
• 21. Smallest window in a string containing all characters of another string - 1
• 22. Smallest window in a string containing all characters of another string - 2

• 1. Linked List Creation Introduction
• 2. Single Linked List (Insertion, Search)
• 3. Double Linked List (Insertion, Search)
• 5. Merge two Sorted Linked List
• 6. Sort Linked List using Merge Sort
• 7. Clone a Linked List
• 8. Reverse K Linked List

• 3. StackQueue Problems
• 1. Stack Operation Implementation
• 2. Queue Operation Implementation
• 3. Circular Queue Implementation
• 4. Histogram Problem
• 5. Stack that Supports getMin() in O(1)
• 6. Find Maximum size rectangle in Binary Sub-matrix
• 7. Sliding Window Problem using deque Data Structure

• 4. Binary Tree Problems
• 1. Binary Search Algorithm Introduction
• 2. Connect Nodes at Same level in a Binary Tree
• 3. Convert a Binary Tree to Doubly Linked List
• 4. Print nodes at k distance from root
• 5. Print all Nodes at Distance k from a given Node
• 6. Boundary Traversal of Binary Tree
• 7. Bottom View of Binary Tree
• 8. Construct Tree from PostOrder
• 9. Diameter of Binary tree
• 10. Left View of Binary Tree
• 11. Reverse level order Traversal of Binary Tree
• 12. Vertical sum of Binary Tree
• 13. Spiral Order of Binary Tree
• 14. Serialize and Deserialize a Binary Tree
• 15. Check if two N-ary trees are Mirror image or not
• 16. Maximum Path Sum in a Binary Tree

• 5. HashingHeap Sort
• 1. Heapify operation implementation
• 2. MinMax Heap Implementation
• 3. Group Anagrams Together
• 4. Find first non-repeating character from a stream of characters
• 5. Design and implement LRU
• 6. Four Sum Problem
• 7. Convert Number to Words Problems
• 8. Median of running data streams problem
• 9. Merge k Sorted arrays

• 6. Graph Algorithms & Application
• 1. Depth-first search method to find cycle in a graph
• 2. Topological sorting concepts and implementation
• 3. Find Number of IsLand in matrix
• 4. Dijkstra Algorithm explanation with example
• 5. Topological Algorithm to solve alien dictionary problem
• 6. Breadth first search algorithm to solve Rotten Orange Problem
• 7. Trie data structure approach to solve word boggle Problem
• 9. Understanding Queue based approach to Jumping Number problem
• 10. Trie data Structure implementation
• 11. Type head suggestion problem

• 7. Backtracking Algorithm Explanation with Examples
• 1. N Queen Problem
• 2. Sudoku Solving Problem - 1
• 3. Sudoku solving Problem - 2
• 4. Print all Permutations of a given String
• 5. Rat Maze Problem
• 6. Knight Walk Problem
• 7. Implement pow(x, n)

• 8. Dynamic Programming tips and tricks with examples
• 1. How to Solve DP problems
• 2. Longest Common Subsequences
• 3. Edit Distance Problem
• 4. Coin Change Problem
• 5. Longest Palindrome Subsequences
• 6. Word Break Problem
• 7. Egg Dropping Problem
• 8. KnapSack Problems
• 9. Keystroke Problem
• 10. String interleave Problem
• 11. Partition Problem
• 12. Wild Card Problem
• 13. Matrix Path Problem
• 14. Climbing Stairs Problem
• 53,700 تومان
بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
خرید دانلودی فوری

در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

ایمیل شما:
تولید کننده:
مدرس:
شناسه: 7831
حجم: 6456 مگابایت
مدت زمان: 1254 دقیقه
تاریخ انتشار: 19 اسفند 1401 53,700 تومان