DSA using Python Assignment-6: Circular Doubly Linked List

This assignment focuses on implementing a Circular Doubly Linked List (CDLL) using Python. A CDLL is a data structure where each node contains references to both the previous and next nodes, and the list forms a closed loop. The assignment includes methods for insertion, deletion, searching, and traversal, demonstrating efficient manipulation of linked data in both forward and backward directions.

Assignment-6: Circular Doubly Linked List

🔹 Task 1: Define Node class
Define a class Node to describe a node of a circular doubly linked list.

🔹 Task 2: Define CDLL class with __init__() and is_empty()

Define a class CDLL to implement Circular Doubly Linked List with \_\_init\_\_() method to create and initialise last reference variable.

🔹 Task 3: Define is_empty() Method

Define a method is\_empty() to check if the linked list is empty in CDLL class.

🔹 Task 4: insert_at_start()

In class CDLL, define a method insert\_at\_start() to insert an element at the starting of the list.

🔹 Task 5: insert_at_last()

In class CDLL, define a method insert\_at\_last() to insert an element at the end of the list.

🔹 Task 6: search()

In class CDLL, define a method search() to find the node with specified element value.

🔹 Task 7: insert_after()

In class CDLL, define a method insert\_after() to insert a new node after a given node of the list.

🔹 Task 8: display()

In class CDLL, define a method to print all the elements of the list.

🔹 Task 9: Implement __iter__()

In class CDLL, implement iterator for CDLL to access all the elements of the list in a sequence.

🔹 Task 10: delete_first()

In class CDLL, define a method delete\_first() to delete first element from the list.

🔹 Task 11: delete_last()

In class CDLL, define a method delete\_last() to delete last element from the list.

🔹 Task 12: delete_item()

In class CDLL, define a method delete\_item() to delete specified element from the list.

📙Software Engineer at Google Book

 🌐 Explore the Journey of a Software Engineer at Google 🚀  

If you are passionate about coding, problem-solving, and building scalable applications, then this book is a must-read for you.  

"Software Engineer at Google" provides deep insights into how one of the world’s biggest tech companies works, how engineers solve complex challenges, and how you can sharpen your own skills.  

📖 What you will learn:  

✔️ Real-world engineering practices  

✔️ Problem-solving techniques  

✔️ Best coding principles  

✔️ Inspiration from Google’s work culture  

🔗 Click below to download and start your learning journey today:  

👉 [Download Software Engineer at Google Book]

DSA using Python: Assignment-5: Circular Linked List

Learn how to implement Circular Linked List in Python step by step. This assignment covers Node and CLL classes, insertion, deletion, searching, and iteration with clear examples for better understanding of Data Structures and Algorithms using Python.

Assignment-5: Circular Linked List

### ✅ Task 1: Define Node class

1. Define a class Node to describe a node of a circular linked list.

### ✅ Task 2: Define CLL class

2. Define a class CLL to implement Circular Linked List with __init__() method to create and initialise last reference variable.

### ✅ Task 3: is_empty()

3. Define a method is_empty() to check if the linked list is empty in CLL class.

### ✅ Task 4: insert_at_start()

4. In class CLL, define a method insert_at_start() to insert an element at the starting of the list.

### ✅ Task 5: insert_at_last()

5. In class CLL, define a method insert_at_last() to insert an element at the end of the list.

### ✅ Task 6: search()

6. In class CLL, define a method search() to find the node with specified element value.

### ✅ Task 7: insert_after()

7. In class CLL, define a method insert_after() to insert a new node after a given node of the list.

### ✅ Task 8: print_all()

8. In class CLL, define a method to print all the elements of the list.

### ✅ Task 9: Iterator

9. In class CLL, implement iterator for CLL to access all the elements of the list in a sequence.

### ✅ Task 10: delete_first()

10. In class CLL, define a method delete_first() to delete first element from the list. 

### ✅ Task 11: delete_last()

11. In class CLL, define a method delete_last() to delete last element from the list.

### ✅ Task 12: delete_item()

12. In class CLL, define a method delete_item() to delete specified element from the list.

DSA using Python: Assignment-4: Doubly Linked List

In this assignment, we implement a Doubly Linked List (DLL) using Python.  

A DLL is a data structure where each node contains:

- **data** (the value)

- **next** pointer (link to next node)

- **prev** pointer (link to previous node)

It allows traversal in both directions, making insertion and deletion more flexible than a singly linked list.

Assignment-4: Doubly Linked List

### ✅ Task 1: Define Node class

1. Define a class Node to describe a node of a doubly linked list.

### ✅ Task 2: Define DLL class

2. Define a class DLL to implement Doubly Linked List with __init__() method to create and initialise start reference variable.

### ✅ Task 3: is_empty()

3. Define a method is empty() to check if the linked list is empty in DLL class.

### ✅ Task 4: insert_at_start()

4. In class DLL, define a method insert_at_start() to insert an element at the starting of the list.

### ✅ Task 5: insert_at_last()

5. In class DLL, define a method insert_at_last() to insert an element at the end of the list.

### ✅ Task 6: search()

6. In class DLL, define a method search() to find the node with specified element value.

### ✅ Task 7: insert_after()

7. In class DLL, define a method insert_after() to insert a new node after a given node of the list.

### ✅ Task 8: print_all()

8. In class DLL, define a method to print all the elements of the list.

### ✅ Task 9: Iterator

9. In class DLL, implement iterator for DLL to access all the elements of the list in a sequence.

### ✅ Task 10: delete_first()

10. In class DLL, define a method delete_first() to delete first element from the list. 

### ✅ Task 11: delete_last()

11. In class DLL, define a method delete_last() to delete last element from the list.

### ✅ Task 12: delete_item()

12. In class DLL, define a method delete_item() to delete specified element from the list.

A Doubly Linked List gives more flexibility compared to a Singly Linked List as we can traverse in both directions.  

This assignment builds understanding of bidirectional linking and efficient insertion/deletion operations.

DSA using Python: Assignment 3 – Singly Linked List (SLL)

Follow Me

About Singly Linked List

In this assignment, we implement a Singly Linked List (SLL) using Python. We build the structure using classes, define insertion and deletion operations, and also add methods for searching and iterating over the list. This is a fundamental concept in Data Structures and Algorithms (DSA).

Assignment 3 – Singly Linked List (SLL)

### ✅ Task 1: Define Node Class

Define a class `Node` to describe a node of a singly linked list.

### ✅ Task 2: Define SLL Class

Implement `__init__()` method to create and initialise the `start` reference variable.

### ✅ Task 3: is_empty()

Method to check if the list is empty.

### ✅ Task 4: insert_at_start()

Insert element at the **start** of the list.

### ✅ Task 5: insert_at_last()

Insert element at the **end** of the list.

### ✅ Task 6: search()

Search for a node with a given value.

### ✅ Task 7: insert_after()

Insert new node after a given node.

### ✅ Task 8: print_all()

Print all elements of the list.

### ✅ Task 9: Iterator

Implement an iterator to access all elements in a sequence.

### ✅ Task 10: delete_first()

Delete the **first** node.

### ✅ Task 11: delete_last()

Delete the **last** node.

### ✅ Task 12: delete_item()

Delete a node with specific value.

This assignment helped in building the core structure of singly linked lists in Python. Understanding how to create nodes and link them using a class-based approach is essential for real-world linked list problems in coding interviews and DSA practice.

💻Technical Questions

JavaScript 

1. What is a Closure and how it is used?
2. Explain the difference between null and undefined.
3. How does prototypal inheritance work in JavaScript?
4. What are the different ways to handle asynchronous operations in JavaScript?
5. What is the event loop?

HTML and CSS

1. Describe the CSS Box Model.
2. How do you handle responsive design?
3. What are some common ways to optimize CSS for performance?
4. What are the differences between various CSS positioning properties (relative, absolute, fixed)?

System Design

1. How do you optimize a web page for speed and performance?
2. How would you design a scalable autocomplete search component?
3. How would you design a chat application with a real time messaging and offline support?

Coding Challenges

1. Implement a function to determine if a string is a palindrome, considering only alphanumeric characters.
2. Find all pairs in an arrays of Integers that sum up to a target value.
3. Write code to debounce or throttle user input to prevent excessive API calls.

Behavioral Questions

1. Tell me about a time you had to solve a difficult problem.
2. Describe a situation where you had to learn something new quickly.
3. How do you approach working in a team?
4. Tell me about a time you had to handle a conflict with a teammate.
5. How do you stay up-to-date with the latest frontend technologies?

DSA using Python: Assignment - 2: Classes and Objects

Follow Me

“In this assignment, we will learn how to use Python classes and objects to build reusable and structured code. The tasks cover real-world examples like persons, shapes, books, and teams.”

Assignment - 2: Classes and Objects

### 1️⃣ Class: Person

1. Define a python class Person with instance object variables name and age. Set
Instance object variables in __init__() method. Also define show() method to display name and age of a person.

### 2️⃣ Class: Circle
2. Define a class Circle with instance object variable radius. Provide setter and getter
for radius. Also define getArea() and getCircumference() methods.

### 3️⃣ Class: Rectangle
3. Define a class Rectangle with length and breadth as instance object variables.
Provide setDimensions(), showDimensions() and getArea() method in it.

### 4️⃣ Class: Book
4. Define a class Book with instance object variables bookid, title and price. Initialise them via __init__() method. Also define method to show book variables.

### 5️⃣ Class: Team
5. Define a class Team with instance object variable a list of team member names. Provide methods to input member names and display member names.

"These 5 class-based problems help in building a solid foundation in Object-Oriented Programming using Python. Understanding these basics is essential for any aspiring Python Developer."

#Python #DSAwithPython #OOP #ClassesAndObjects #PythonAssignment #LearnPython #FullStackPython