Here, in this *one story*, you can find all my other stories linked. I am doing it for your convenience so that you don’t need to scroll my profile for ages!

Stories are listed in the most recent first order

Stories are listed in the most recent first order

**Binary search** is an important searching algorithm that every programmer studies at some point. Binary search and other variants of it are frequently asked questions in coding interviews.

This article is to show you how the binary search algorithm works and how to implement it using Python. Let’s get started!

**Table of Contents:**

· Searching in General (Linear Search)

· Binary Search Algorithm

· Implementation of Binary Search in Python

· Resources

There are many searching algorithms studied in Computer Science. But everyone starts learning searching algorithms with the simplest one among them, linear search.

Binary search is an improvement…

Though a resume alone can’t get you your desired job, having a good resume can make a significant difference. Your resume is your first impression. So if you spend some time perfecting your resume, the effort will be well worth it.

A simple black and white format is still the most professional way to write a good resume. But having a nice-looking online version of it can add a nice touch to your portfolio. You can add it to your personal website and share it with potential recruiters.

Especially if you are applying for a front-end developer role, this way…

Today I will share with you a beginner-friendly project that you can build with Vanilla JavaScript. Although there are many good JavaScript frameworks available, understanding the fundamentals of a language is important.

As a beginner in JavaScript myself, I was searching for some fun practice projects that I can build to sharpen my JavaScript basics. This is one of the projects that I built. This article will show you the step-by-step process of building it.

Let’s get started!

**Table of Contents:**

· Overview of the Project

· Project Structure

· The HTML

· The CSS

· Writing the Logic in JS

· Conclusion

· Resources…

In today's article, you will learn several different ways to remove duplicate values from a Python list. We will consider two types of scenarios —

- The given list is in sorted order
- The given list is not sorted

Let's get started!

Table of Contents:· Removing Duplicates From a Sorted List

· Removing Duplicates From an Unsorted List

∘ Using for loop

∘ Using set

∘ Using OrderedDict

∘ Using Numpy

∘ Using Pandas

We will have some advantages if the list is in sorted order. If the list is sorted, we can compare the two values next to each…

Comprehension is a unique feature of Python. Comprehension gives us a concise way to construct sequences like lists, sets, and dictionaries. Using comprehension we can create Python sequences with complex functionality using just one line of code. Comprehension is most commonly used in lists. According to Python documentation —

List comprehensions provide a concise way to create lists. Common applications are to make new lists where each element is the result of some operations applied to each member of another sequence or iterable, or to create a subsequence of those elements that satisfy a certain condition.

This article will show…

Consider the Python list below:

`lst = [1, 2, 3, 4, 5, 6, 7, 8, 9]`

We can print the entire list with `print(lst)`

.

In my second year at university, I was studying Data Structures and Algorithms. A lot of topics came up: analyzing time and space complexity, searching & sorting algorithms, recursion, dynamic programming, tree, graph, and many more. One of them was **backtracking**.

Backtracking is not a specific algorithm, rather it is a problem-solving technique. A popular practice problem of backtracking is to solve a sudoku puzzle. It is a frequently asked coding interview problem.

I had so much fun learning how to solve sudoku using backtracking. *Finally, a real-world problem!*

This article will show you how to solve a sudoku puzzle…

A **queue** is a linear data structure that follows the **First In First Out (FIFO)** principle. That means the first element that is added to the queue is the first one to be removed. It has similarities to stack. Often queue and stack are studied together. But to keep things simple and short I decided to write two separate articles on them. Here is my article on how to create a stack in Python:

But in this article, we will learn how to create a queue. Let’s get started!

A good example of a queue is a line of passengers…

**Stack** is a linear data structure that follows the **Last In First Out (LIFO)** principle. That means the last item that was inserted into the stack is the first one to be deleted from it. Stack is a dynamic data structure and has the flexibility to grow or shrink its size.

- Stack is a dynamic data structure. That means it does not have a fixed size. But it can have a maximum memory limit. If the maximum memory limit exceeds, it will cause a
**stack overflow**. - For the LIFO principle, elements can be inserted or removed from only one side…

Undergraduate CS student | Passionate about programming and tech