Companies Home Search Profile

Data Structure & Algorithms Complete Course in Java

Focused View

Ravi Singh

20:53:54

138 View
  • 1. Time Complexity and Space Complexity Introduction.mp4
    14:37
  • 2. Design a data Structure which support Insert delete, Random in O(1) time.mp4
    19:13
  • 3. Segregation logic to Sort an array of 0s, 1s and 2s.mp4
    12:27
  • 4. Merge Sort Introduction.mp4
    08:50
  • 5. Merge Sort Code Implementation.mp4
    22:57
  • 6. Linear time approach to solve jump game problem.mp4
    08:41
  • 7. Digit rearrangement method to find next greater number with same set of digits.mp4
    12:23
  • 8. Greedy Techniques to find minimum number of platforms.mp4
    11:03
  • 9. Print matrix in spiral order without any extra space.mp4
    12:30
  • 10. Count frequencies of array elements in O(n) time complexity.mp4
    18:04
  • 11. Linear time approach to solve Stock Buy Sell Problem.mp4
    15:14
  • 12. In-place matrix rotation by 90 degree problem.mp4
    12:19
  • 13. Array puzzle of solving celebrity problem.mp4
    08:59
  • 14. Next Permutation Problem.mp4
    17:30
  • 15. QuickSelect Algorithm to find the Kth smallest Element in array - 1.mp4
    10:46
  • 16. QuickSelect Algorithm to find the Kth smallest Element in array - 2.mp4
    13:48
  • 17. Binary search method to find square root of an element.mp4
    05:35
  • 18. Rain Trapping Problem.mp4
    09:51
  • 19. Merge sort method to Count inversion in an array.mp4
    12:25
  • 20. Binary search method to find Median of two sorted Array.mp4
    20:19
  • 21. Smallest window in a string containing all characters of another string - 1.mp4
    15:37
  • 22. Smallest window in a string containing all characters of another string - 2.mp4
    14:25
  • 1. Linked List Creation Introduction.mp4
    08:21
  • 2. Single Linked List (Insertion, Search).mp4
    12:44
  • 3. Double Linked List (Insertion, Search).mp4
    14:52
  • 4. Flattering of LinkedList.mp4
    12:17
  • 5. Merge two Sorted Linked List.mp4
    17:31
  • 6. Sort Linked List using Merge Sort.mp4
    17:31
  • 7. Clone a Linked List.mp4
    10:43
  • 8. Reverse K Linked List.mp4
    12:18
  • 1. Stack Operation Implementation.mp4
    10:13
  • 2. Queue Operation Implementation.mp4
    08:15
  • 3. Circular Queue Implementation.mp4
    10:08
  • 4. Histogram Problem.mp4
    13:35
  • 5. Stack that Supports getMin() in O(1).mp4
    16:48
  • 6. Find Maximum size rectangle in Binary Sub-matrix.mp4
    08:17
  • 7. Sliding Window Problem using deque Data Structure.mp4
    22:35
  • 1. Binary Search Algorithm Introduction.mp4
    16:18
  • 2. Connect Nodes at Same level in a Binary Tree.mp4
    11:57
  • 3. Convert a Binary Tree to Doubly Linked List.mp4
    13:10
  • 4. Print nodes at k distance from root.mp4
    06:35
  • 5. Print all Nodes at Distance k from a given Node.mp4
    17:15
  • 6. Boundary Traversal of Binary Tree.mp4
    11:07
  • 7. Bottom View of Binary Tree.mp4
    16:50
  • 8. Construct Tree from PostOrder.mp4
    18:24
  • 9. Diameter of Binary tree.mp4
    12:49
  • 10. Left View of Binary Tree.mp4
    08:45
  • 11. Reverse level order Traversal of Binary Tree.mp4
    06:04
  • 12. Vertical sum of Binary Tree.mp4
    12:11
  • 13. Spiral Order of Binary Tree.mp4
    13:29
  • 14. Serialize and Deserialize a Binary Tree.mp4
    18:00
  • 15. Check if two N-ary trees are Mirror image or not.mp4
    16:21
  • 16. Maximum Path Sum in a Binary Tree.mp4
    18:28
  • 1. Heapify operation implementation.mp4
    06:50
  • 2. MinMax Heap Implementation.mp4
    09:12
  • 3. Group Anagrams Together.mp4
    11:33
  • 4. Find first non-repeating character from a stream of characters.mp4
    13:48
  • 5. Design and implement LRU.mp4
    21:11
  • 6. Four Sum Problem.mp4
    13:24
  • 7. Convert Number to Words Problems.mp4
    14:45
  • 8. Median of running data streams problem.mp4
    20:11
  • 9. Merge k Sorted arrays.mp4
    09:10
  • 1. Depth-first search method to find cycle in a graph.mp4
    13:54
  • 2. Topological sorting concepts and implementation.mp4
    16:17
  • 3. Find Number of IsLand in matrix.mp4
    14:35
  • 4. Dijkstra Algorithm explanation with example.mp4
    19:04
  • 5. Topological Algorithm to solve alien dictionary problem.mp4
    12:14
  • 6. Breadth first search algorithm to solve Rotten Orange Problem.mp4
    18:14
  • 7. Trie data structure approach to solve word boggle Problem.mp4
    11:57
  • 8. Breadth first search algorithm to solve snake ladder problem.mp4
    17:14
  • 9. Understanding Queue based approach to Jumping Number problem.mp4
    11:41
  • 10. Trie data Structure implementation.mp4
    15:08
  • 11. Type head suggestion problem.mp4
    16:08
  • 1. N Queen Problem.mp4
    07:13
  • 2. Sudoku Solving Problem - 1.mp4
    12:19
  • 3. Sudoku solving Problem - 2.mp4
    10:14
  • 4. Print all Permutations of a given String.mp4
    13:11
  • 5. Rat Maze Problem.mp4
    20:35
  • 6. Knight Walk Problem.mp4
    13:30
  • 7. Implement pow(x, n).mp4
    07:13
  • 1. How to Solve DP problems.mp4
    07:39
  • 2. Longest Common Subsequences.mp4
    11:07
  • 3. Edit Distance Problem.mp4
    13:38
  • 4. Coin Change Problem.mp4
    11:49
  • 5. Longest Palindrome Subsequences.mp4
    10:08
  • 6. Word Break Problem.mp4
    13:04
  • 7. Egg Dropping Problem.mp4
    09:26
  • 8. KnapSack Problems.mp4
    17:45
  • 9. Keystroke Problem.mp4
    10:58
  • 10. String interleave Problem.mp4
    13:51
  • 11. Partition Problem.mp4
    15:41
  • 12. Wild Card Problem.mp4
    20:39
  • 13. Matrix Path Problem.mp4
    07:46
  • 14. Climbing Stairs Problem.mp4
    08:14
  • Description


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

    What You'll Learn?


    • Data Structure and Algorithms
    • Coding Interview Questions
    • Problem solving skill
    • Crack product based company interviews

    Who is this for?


  • Candidates curious for Data Structure & Algorithms interview preparation
  • Prepare for Coding Interview
  • Switch from service based company to product based company
  • Want to increase salary by 2X ,3X, 4X, 5X
  • Our student cracked interview with Microsoft with max package 1.2cr
  • More details


    Description

    Data structure, Algorithms  Course For Cracking coding for Top product-based companies.  Each topic explains from very basic to an advanced level by using multiple examples. More focus is on Tricks, Techniques, and implementation than theory.

    This course explains all the deep concepts of Data structure and Algorithms with the help of problems. These problems are frequently asked during interviews.

    This course is for students in colleges preparing for campus placements and also for working professionals who want to crack interviews.

    Course Prerequisite:  Should have basic knowledge of Java or Python or C/C++ Programming


    Who Should Subscribe For this Course:

    • Working professionals preparing for interviews of Big-5(Google,Amazon,Microsoft,Facebook,Apple) and Top

    Product Based organization

    • BTech /MCA/MS Students looking for data structures, Algorithms & System Design coaching

    • Job seekers who are preparing for interviews in Product MNC/e-commerce companies

    • Anyone who has a deep desire to learn data structures, algorithms, and system design to improve

    programming/coding skills and designing skills



    Our instructor [ Ravi Singh] is a working professional who graduated from premier institutes and works with premier

    companies Like: Amazon, Cisco, Walmart Labs


    HOW IT WORKS

    Finish Topics of the course: This course is divided into multiple topics. Subscribers can finish topics one after another. Attempt each topic assignment.

    Who this course is for:

    • Candidates curious for Data Structure & Algorithms interview preparation
    • Prepare for Coding Interview
    • Switch from service based company to product based company
    • Want to increase salary by 2X ,3X, 4X, 5X
    • Our student cracked interview with Microsoft with max package 1.2cr

    User Reviews
    Rating
    0
    0
    0
    0
    0
    average 0
    Total votes0
    Focused display
    As a Developer and Architect i worked in top product based companies like WalmartLabs, Amazon etc.I always have keen interest in logic development, algorithm and data Structure. I worked as tutor and teaches  hundred of students to  crack coding interviews. I have my youtube channel to teach students and give them tips to do preparation for interview.
    Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.
    • language english
    • Training sessions 94
    • duration 20:53:54
    • Release Date 2023/03/07