In the last part, we had a look at Lists and Linked Lists. In this part, we are going to learn about another data structure called Stack.
Consider this situation: Sophia is arranging the shirts of David one on top of the other in the cupboard. She is very particular that David should always wear the shirt at the top.
In the last part, we had discussed about the basics of Linked List and how to add elements in a linked list as well as its traversal. In this part, we shall discuss few more operations on Linked List such as Search, Insert and Delete. Along with this, we’ll also compare Arrays with Linked Lists.
At times, Sophia can come across situations when she wants to check whether her list contains an item or not. Let’s learn how we can search elements in a linked list.
In the last part, we ended up the below code :
This is in continuation of our Data Structures and Algorithms using Python series. In the last part, we discussed about Lists and its implementation using Array. As a conclusion, we had found that list can lead to memory wastage if implemented using Array. In this part, we shall go through the implementation of list using another data structure called Linked List.
As Sophia’s list is going to have frequent additions and deletions, it may not be a good choice to implement it using arrays.
There is one more implementation for list which is using Linked List. …
This is the second part of our Data Structures and Algorithms using Python series where we are going to learn about the first data structure called Lists.
If you haven’t read the first part yet, find it here where we introduced Data Structures in brief.
Let’s assume this scenario first:
It was a Saturday morning and Sophia was in the grocery shop with her list of grocery items. The list kept on changing as she moved from one section of the shop to another. She added few items, removed few and kept on scanning the list. …
In this series, I’ll introduce the basic concepts of Data Structures in programming using Python language constructs. In common words, Data Structures are storage containers in which elements can be stored, located, retrieved and deleted from, easily. Data Structures make the organization and management of large amounts of data efficiently.
When you provide a search term in Google and click on search, you get the search results in a fraction of second.
A prime number, as we know, is a natural number that has exactly two distinct natural number divisors: the number 1 and itself.
We often get questions like the one given below:
Given a number n, print all primes smaller than or equal to n. — e.g. If n is 20, the output should be “2, 3, 5, 7, 11, 13, 17, 19”
Sieve of Eratosthenes is used to get all prime numbers in a given range and is a very efficient algorithm. You can read more about sieve of Eratosthenes on Wikipedia.
In this algorithm, we follow the following…
Hey everyone, I am back with yet another blog. But this time, there is something very special about it.
So, few days ago I was scrolling through LinkedIn feed where I found this amazing opportunity called Crio Winter of Doing or CWoD. I was very excited and went on searching about this and landed on Crio’s official website where I was shocked to see the amazing companies with which I can get chance to work with if I get selected. Since, I was newbie to this, but this program’s structure is built in such a way that even a beginner…
Let’s start off by saying, Dart is an object-oriented programming language. Within an object-oriented language, we spend most of the time thinking about how to model our logic using objects and classes. Dart is a statically typed language, similar to C++, C# or Java. For now we can think like, any given variable must contain data of a single type like integer, string, etc. Dart has a C-style syntax. Dart has multiple runtime environments. It means we can somehow execute Dart code in the browser, from our command line or with mobile apps. When we run on browser, the code…
As finally, this year IPL Season 13 has started on Sept. 19, 2020 , the cricket mood is on. While watching the first match itself, the idea of analyzing IPL dataset struck my mind and luckily I found one dataset on Kaggle which contains the data of matches held between 2008–2019. So, I shall be analyzing that dataset only. Although it can be improved to a great extent, hope you like my work.
We have selected the below datasets for the analysis which contains data related to IPL matches for the last 12 seasons :
By default, every Python project on your system will use these same directories to store and retrieve site packages (third party libraries).
But you would have probably discovered that it’s quite painful to manage different projects with different dependencies targeting different Python versions on your local machine.
At such situations, the concept of virtual environment comes to our aid.
If you haven’t used or don’t know about Virtual Environments in Python, let me first define it for you.
A virtual environment is a tool that helps to keep dependencies required by different projects separate by creating isolated Python virtual environments…