Skip to main content

The Core of SEO

By





This is a summary from book “3 Months to No.1: The “No-Nonsense” SEO Playbook for Getting Your Website Found on Google” / https://amzn.to/3KqkE6x

The core of SEO. Basically, all we do with SEO is that we optimize for keywords.  When we optimize for a keyword, we mean one or multiple search terms, that the customers would search for. This is where the battle happens, and it's a zero-sum game. Meaning if you want to beat someone from being at the first place on Google, a search results, you would need to remove in from there. 

In SEO, we optimize for 3 types of keywords:

1. Information

2. Commercial

3. Brand.

With informational customers are just searching for information while in commercial customers are actually looking to solve a problem they have fixed a door in their house, in branded keywords customers are looking for a specific brand.

We want to:

1. Find keywords in one of first 3 categories.

2. Rule out keywords that we wouldn't have the budget to fight for.

Estimate what happens if you are number 1

Then, once you have found the relevant keywords you want to estimate what would happen if you are now number 1 on Google, how much money you would make for this we have tools that would assist us, one of these tools is named SEMRush.

To look for good keywords we can just brainstorm for keywords put yourself in the shoes of the customer and ask yourself what would you search for, don't try to be too clever, aim for regular customers with most traffic?  For keyword suggestion and ideas, you can also use Uber suggest tool.

The next step after you have found candidate keywords is the bottom line, how much money would you make if you get to first position in google with these keywords, you want to first find keywords that would actually make you money and only then put months in optimizing them?

For that purpose, again we use SEMRush tool with this way you have a glance into the currently first position in google first ranked website, and then you can calculate how much money you would make if you get to this first position.

Comments

Post a Comment

Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

By
Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is
14 comments
Read more

Alternatives to Using UUIDs

By
  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,
Post a Comment
Read more

Bellman Ford Graph Algorithm

By
The Shortest path algorithms so you go to google maps and you want to find the shortest path from one city to another.  Two algorithms can help you, they both calculate the shortest distance from a source node into all other nodes, one node can handle negative weights with cycles and another cannot, Dijkstra cannot and bellman ford can. One is Dijkstra if you run the Dijkstra algorithm on this map its input would be a single source node and its output would be the path to all other vertices.  However, there is a caveat if Elon mask comes and with some magic creates a black hole loop which makes one of the edges negative weight then the Dijkstra algorithm would fail to give you the answer. This is where bellman Ford algorithm comes into place, it's like the Dijkstra algorithm only it knows to handle well negative weight in edges. Dijkstra has an issue handling negative weights and cycles Bellman's ford algorithm target is to find the shortest path from a single node in a graph t
1 comment
Read more