-
Notifications
You must be signed in to change notification settings - Fork 0
/
RESOURCES.txt
44 lines (29 loc) · 1.76 KB
/
RESOURCES.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
01_array_or_list_exercise.py
arrays_or_list.py
-rw-r--r--. 1 shayon shayon 2537 Jul 26 04:08 02_fibonacci_sequence.py
-rw-r--r--. 1 shayon shayon 964 Jul 26 04:08 03_factorial_of_num.py
-rw-r--r--. 1 shayon shayon 1331 Jul 26 04:08 04_count_prime_num.py
-rw-r--r--. 1 shayon shayon 2038 Jul 26 04:08 04_prime_num.py
I am going to give you a few topics of Data Structure and Algorithms, you need to create a few questions and more than 2 tasks(basic, intermediate, advanced) for each topic. Moreover, give me some real-life examples (Python code examples with a little bit of explanation) about that as well
https://www.geeksforgeeks.org/top-100-data-structure-and-algorithms-dsa-interview-questions-topic-wise/
This is a JavaScript Comment document:
```
/**
* Tutorial: https://www.youtube.com/watch?v=ex8EHl5fq1o&list=PLC3y8-rFHvwjPxNAKvZpdnsr41E0fCMMP&index=42
* The queue data structure is a sequential collection of elements that follows the principle of First In First out (FIFO)
* First element inserted into the queue is first element to be removed
* A queue of people. People enter the queue at one end (rear/tail) and leave the queue from the other end( front/head )
* Queue is an abstract data type. It is defined by its behavior rather than being a mathematical model.
*
* The queue data structure dsupports two main operations
* Enqueue - Add an element to the rear/tail of the collection
* Dequeue - Remove an element from the front/head of the collection
*
* Queue usage
* Printers - printing multiple documents
* CPU - task scheduling
* Callback queue in JavaScript runtime
*/
```
Make this more readable, detailed, organized, and easy to understand the stack data structure in JS.
Add a few real-life examples. Use cases in real life or real applications.