Redis is an open source (BSD licensed), in-memory data structure store, used as a database, cache and message broker. It supports data structures such as strings, hashes, lists, sets, sorted sets with range queries, bitmaps, hyperloglogs and geospatial indexes with radius queries.

Redis is the world’s most popular in-memory data structure server. In order to make good use of it, we need to understand its basic data structures first.

Strings

The Redis String type is the simplest type of value you can associate with a Redis key. …

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

In this post, we are gonna discuss how to calculate the total Hamming distance

Problem Statement

Given an integer array nums, return the sum of Hamming distances between all the pairs of the integers in nums.

Input: nums = [4,14,2]
Output: 6

Explanation: 
In binary representation, the 4 is 0100, 14 is 1110, and 2 is 0010 (just
showing the four bits relevant in this case). …

Indexes are used to find rows with specific values quickly.

If a table has an index for the column in question, MySQL can quickly determine the position to seek in the middle of the data file without having to look at all the data. It is much faster than reading every row sequentially.

In this post, we’ll look at some of the important concepts behind indexing.

Example

Let’s first create a MySQL table.

CREATE TABLE Customer( 
  `custId` INT,
  `name` VARCHAR(50),
  `mobileNo` VARCHAR(11)
);ALTER TABLE `Customer` ADD PRIMARY KEY (`custId`);ALTER TABLE `mobileNo` ADD UNIQUE INDEX (`MobileNo`);

Assume we have a…

In this post, we are gonna discuss multiple solutions for sliding window maximum problem.

If you prefer to learn through videos, please have a look at the following video.

Problem Statement

You are given an array of integers, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

Return the max sliding window.

Example:

Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
Output: [3,3,5,5,6,7]
Explanation: 
Window position…

In the past few years, I had participated hundreds of web scraping projects. In the meantime, I had encountered a lot of scraping challenges.

In this post, I will list some scraping challenges and hope they will give you some help for the next interview.

1. Changing Structure

Recently, I needed to install the Catalina Mac System on my MacBooks. So I decide to make a bootable USB disk myself.

Let’s get started!

Prerequisites

• USB flash drive: It has at least 16GB of storage and make sure the data inside is backed up.
• Download the macOS Catalina installer file Catalina.dmg
• Install Disk Creator

Install Steps

1. Open LaunchPad→ Disk Utility

Converting the PNG file to JPG doesn’t need any fancy software. There is a function baked into macOS and accessible to Automator.

You can set it up as a Quick Action so that you can right-click on the file and convert it to JPG with a single click.

Step 1: Open “Automator” Application

Suppose you are in a library and want to find a book on a certain bookshelf. Book arranges in alphabetical order or by some integer code.

Generally speaking, the naive way to find it is to go book by book, but this will take a lot of time. You think there must be a better solution.

Ta Ta！

Binary Search Algorithm！

Binary Search

In computer science, binary search, also known as half-interval search, is a search algorithm that finds the position of a target value within a sorted array.

The binary search algorithm is used to search an item from an sorted/sorted…