English | MP4 | AVC 1280×720 | AAC 48KHz 2ch | 3.5 Hours | 1.43 GB
Linked list, Stacks, Queues And Interview Problems
PHP being the most popular server side scripting language powers more than 80% of the web. PHP is beyond WordPress and it deserves more. By the release of PHP 7 , it is also capable of creating an enterprise application. We already know the importance of problem solving and arise in demand for developers especially web developers. Data structures are the core of computer science and it is the most involved topic on problem solving. Apart from being it is the most important topic asked in interview data structures helps to solve most of the problems when developing applications. So next time when your are going for a PHP developer interview and the interviewer asks to implement some data structure don’t think of using C , C++ or Java… lets implement it with PHP itself!!
In this series you will learn the most important world of linear data structures linked list, stacks and queues. You will learn how to implement it, how to perform insertion and deletion operations and some problems based on this data structures.
Linked list :-
Do you know PHP array(but trust me it is not the array like other languages) itself implemented with doubly linked list and hash table internally? In this you will learn the importance of linked list and why it is preferred for inserting and deleting the data when compared to array. You will learn
- How to create an linked list in PHP
- How to insert an element at first position of the list
- How to insert an element at the last position of the list
- How to insert an element at the given position
- How to delete the first element of the list
- How to delete the last element of the list
- How to delete an element at the given position
You will learn all types of linked list that you definitely need to know.
Stack:-
Do you know the function calls and variable declarations are internally maintained using stack. Yes programming languages itself make use of stack data structure for some of its operations. In this you will learn,
- How to implement stack using array
- How to implement stack using linked list(I hope you may come across this is interview)
- Some problems based on stack
Queue:-
Operating systems processes are rely on this cool data structure. In this you will learn
- How to implement queue using array
- How to implement queue using linked list
- Some problems on queue
Take your next step by enrolling to the course. Developers are on rise. But not everyone get hired those who know how to solve problems are the one getting hired. Apart from learning Laravel,Yii,etc,.. lets learn the core of problem solving.
The reason I made two parts of this course is that next part consist of non-linear data structures which is some what difficult to grasp and more over we are going to develop an real world application based on all the data structures we learned. Yes!!! that’s true. It is not enough to learn only the implementation of these data structures, we must need to know how to implement it at perfect scenario.
What you’ll learn
- What are algorithms really is? Basic view on algorithms.
- What are time and space complexities in a easily understandable way. Yeah that’s true.
- What are linked list and how linked list differs from Arrays?
- What are stacks and queues?
- Introduction to non-linear data structures
Table of Contents
Introduction
1 Welcome to the course
2 A quick note
3 What are data structures
Introduction to algorithms
4 Introduction
5 Rate of growth
6 Characteristics of an algorithm
7 Why to analyse an algorithm
8 What is O(1) constant time
9 What is O(n) linear time
10 What is O(log n) logarithmic time
11 What is O(n^2) quadratic time
12 What is O(n^3) cubic time
13 Best case,worst case and average case of an algorithm
Recursion
14 Introduction to recursion
15 Recursion example 1- factorial of a given number
Arrays
16 A breif about PHP arrays
17 SplFixedArray in PHP
Problems on arrays
18 Sum of the array – Two pointer approach
19 Sum of maximum sub array – Naive approach
20 Sum of maximum sub array – Kadanes algorithm
Linked list
21 Introduction to linked list
22 Deleting the given node
23 Why to use linked list
24 Implementing linked list
25 Inserting an element to the linked list
26 Inserting at front of the list
27 Inserting at given position
28 Displaying the elements of the list
29 Deleting the head node
30 Deleting the last node
Doubly linked list
31 Introduction to doubly linked list
32 Base condition for doubly linked list operations
33 Inserting the element at front
34 Inserting at given position
35 Insert at last
36 Deleting the head node
37 Deleting the tail node
38 Deleting the given node
Circular linked list
39 Introduction to circular linked list
40 Inserting at front of the circular list
41 Inserting at last of the circular list
42 Inserting at given position in the circular list
43 Deleting the first node of the circular list
44 Deleting the last node of the circular list
Problems on linked list
45 Printing the elements of the linked list using recursion
46 Reversing the linked list – Iterative approach
47 Removing duplicates in unsorted linked list
48 Removing duplicates in sorted linked list
49 Detecting cycle in the linked list – Approach 1
50 Detecting cycle in the linked list – Approach 2
Stacks
51 Introduction to Stack
52 Implementing stack using array
53 Implementing stack using linked list
Queues
54 Introduction to queue
55 Implementing queue using array
56 Implementing queue using linked list
Problems on stacks and queues
57 Expression evaluation
58 Implement queue using stack
Next steps
59 Introduction to non-linear data structures
60 Goodbye
Resolve the captcha to access the links!