Post List

Big-O notation and Time complexity in Python

Time complexity is a way to measure how the runtime of your program grows as the input size increases.
It helps you predict performance without actually running the code with huge inputs.
Input size (n) - the number of elements your function processes (length of a list, number of nodes, etc). * Runtime growth - how much slower your algorithm gets when n becomes very large. Think of it …

Memory Allocation in Python: Assignment vs Copy vs Deepcopy

When working with collections in Python, such as lists, dictionaries, sets, and custom objects, it's crucial to understand memory allocation. By the end of this article, you'll know the difference between assignment, shallow copying, and deep copying. You'll also be able to identify their implications on memory usage, object mutability, and time complexity.

Stacks, Queues, and Linked Lists in Python

When preparing for python coding interviews, three of the most common data structures you'll need to know are stacks, queues and linked lists interviewers love them because they test your understanding of memory, order of operations and problem-solving.

In this post, we will:

• Explain each data structure in simple terms.
• Show how to implement them from scratch in python.
• Solve a few classic mini-problems you might see in interviews.
…