+- Softwarez.Info - Software's World! (https://softwarez.info)
+-- Forum: Library Zone (https://softwarez.info/Forum-Library-Zone)
+--- Forum: Video Tutorials (https://softwarez.info/Forum-Video-Tutorials)
+--- Thread: Learn Data Structures And Solve Interview Problems (/Thread-Learn-Data-Structures-And-Solve-Interview-Problems)
Learn Data Structures And Solve Interview Problems - nieriorefasow63 - 12-21-2023
![[Image: 3c644c9510aa7c7e759162774133e520.jpg]](https://i122.fastpic.org/big/2023/1221/20/3c644c9510aa7c7e759162774133e520.jpg)
Learn Data Structures And Solve Interview Problems
Published 12/2023
MP4 | Video: h264, 1920x1080 | Audio: AAC, 44.1 KHz
Language: English | Size: 1.27 GB | Duration: 3h 7m
Learn the fundamentals of data structure and solve interview coding problems related to data structures
What you'll learn
Learn fundamentals of data structure
Solve data structure related interview problems
Become an expert in approaching data structure related problems
Solve 100+ DS related interview questions
Requirements
Familiar with python programming language and any python IDE (like PyCharm)
Description
Understand the fundamentals of the data structures and solve related Interview problems in python.Course Structure:Introduction:What is data structure?Demo: LinkedlistRuntime analysisStacks:Stack DS refresherDemo: Stack Interview questionsDemo: Stack Interview questions - Balanced parenthesisQueues:Queue, Circular, Priority QueueDemo: Queue Interview questions - Reverse a QueueDemo: Queue Interview questions - Level order traversal in treeLinkedlists:Linked listLinked list DS refresherDemo: Linkedlist implementationDemo: Linkedlist Interview question - Reverse a given linked listDemo: Linkedlist Interview question - Check for cycle in a given linked listDemo: Linkedlist Interview question - Find intersection between 2 linked listHashtables:Hash table DS refresherDemo: Interview question - Array SubsetDemo: Interview question - Remove duplicates in LinkedlistDemo: Interview question - Finding K-distance duplicatesTrees:Tree Data StructureTree traversal and related conceptsBinary tree DSDemo: Interview question - Find n-th node inorder traversalDemo: Interview question - Level-order-traversalDemo: Interview question - Construct tree from given inorder preorderBinary Search Tree (BST)Demo: Interview question - Finding postorder from given preorder of a BSTHeap DSDemo: Find Kth largest elementGraphs:Graph Data Structure - RefresherGraph DS basics & representationGraph traversals - BFS, DFSDemo: DFS ImplementationDemo: Interview question - Largest RegionDemo: Interview question - Count islandsDemo: DFS, BFS ApplicationMinimum Spanning Tree & Shortest path - RefresherRequirementsBasics knowledge of computer programming (preferably with Python)Windows / Linux / Mac OS X Machine with InternetContent teamExpert: Arunkumar KrishnanProduction: Vishnu Sakthivel
Overview
Section 1: Introduction
Lecture 1 Introduction
Lecture 2 Demo: Linked-list
Lecture 3 Runtime Analysis
Section 2: Stack Data Structure
Lecture 4 Stack Data Structure
Lecture 5 Demo: Stack Interview questions
Lecture 6 Demo: Stack Interview questions - Balanced parenthesis
Section 3: Queue Data Structure
Lecture 7 Queue, Circular, Priority Queue
Lecture 8 Demo: Queue Interview questions - Reverse a Queue
Lecture 9 Demo: Queue Interview questions - Level order traversal in tree
Section 4: Linkedlist Data Structure
Lecture 10 Linkedlist DS refresher
Lecture 11 Demo: Linkedlist implementation
Lecture 12 Demo: Linkedlist Interview question - Reverse a given linked list
Lecture 13 Demo: Linkedlist Interview question - Check for cycle in a given linked list
Lecture 14 Demo: Linkedlist Interview question - Find intersection between 2 linked list
Section 5: Hashtable Data Structure
Lecture 15 Hash table DS refresher
Lecture 16 Demo: Interview question - Arrray Subset
Lecture 17 Demo: Interview question - Remove duplicates in Linkedlist
Lecture 18 Demo: Interview question - K-distance duplicates
Section 6: Tree Data Structure
Lecture 19 Tree traversal and related concepts
Lecture 20 Binary tree
Lecture 21 Demo: Level-order-traversal
Lecture 22 Demo: Find n-th node in inorder traversal
Lecture 23 Demo: Construct tree from inorder and preorder
Lecture 24 Binary Search Tree (BST)
Lecture 25 Demo: Interview Questions - Convert BST preorder to postorder
Lecture 26 Heap Data Structure
Lecture 27 Demo: Interview Questions - Find Kth largest element
Section 7: Graph Data Structure
Lecture 28 Graph Basics and Representation
Lecture 29 Graph traversals - BFS, DFS
Lecture 30 Demo: DFS Implementation
Lecture 31 Demo: Interview question - Largest Region
Lecture 32 Demo: Interview question - Count Islands
Lecture 33 Demo: DFS, BFS Application
Lecture 34 Minimum Spanning Tree (MST) in Graph
Freshers and experienced professionals looking for career in product based companies (like MAANG companies)
HOMEPAGE
DOWNLOAD