Skip to main content

Fix Breadcrumbs Error And m=1? In Blogger

 Remove Breadcrumbs Errors And ?m=1


Breadcrumb is a small path. It points your location on your site. It also affects the SEO of your website. 


Use canonical URL, so: data:blog.url.canonical  instead of data:blog.url. It should work for both desktop and mobile versions. It means the same URL works on both mobile and desktop without producing the ?m=1 or ?m=0.


Before this, I am going to tell you what all the portions I will explain and fix your problem.


First we will fix Breadcrumbs Error. This is the most dangerous for your website.


Second we will remove ?m=1 and ?m=0, tags from our mobile view URL.



Remove Breadcrumbs Error:-

You should follow the below steps, so that you would fixed this error :-

  1. Go to blogger.com

  2. Login to blogger with your blogger email id

  3. Click on Template

  4. Click edit HTML, you have to edit HTML theme code.

  5. Press Ctr + F to open a search bar in your HTML theme code.

  6. Search for <div class='breadcrumbs'

  7. Paste the below code up to </b:loop>



This code will solve your Breadcrumbs. Then save HTML template code and refresh the page.

Go to Google Search Console and validate your error page. Your Problem will be fixed Or it can take some time for google to validate the issue.


Fix ?m=1 and ?m=0 Mobile URL:-

You have to follow the same steps as the first one. But in the second code you have to paste before the closing body tag.


Follow the below steps for this error :-


  1. Go to Template setting of your blog

  2. Click on the Edit HTML 

  3. Find the </body> of your theme, by pressing Ctrl+F

  4. Paste the second code before </body>

  5. Save the theme code and refresh the page on your mobile.



After applying this technique you can fix ?m=1 and ?m=0 URL problem.


Conclusion:-

I have described all the steps in this post. To fix breadcrumb errors and m tag URL errors of mobile. Whenever paste or remove code from HTML theme save that edited code it will help you if any error occurs.


Comment your problems in the comment section And share this post. If you have any question then ask in the comment. 


Comments

Popular posts from this blog

C Programs : Basic Problems And Its Output

C Basics Programs 1.Check a string is a palindrome or not? Program:- #include<stdio.h> #include<string.h> void isPalindrome(char *str) { int i,l,h; l=strlen(str); i=0; h=l-1; while(h>i) { if(str[i++]!=str[h--]) { printf("Not Palindrome"); return; } } printf("Palindrome"); } int main() { int i,l,flag=0; char str[20]; printf("Enter a string:-"); scanf("%s",str); isPalindrome(str);    return 0; } Output :- Enter a string:- abcdcba Palindrome 2.Find the maximum frquency of a character in a string. Program:- #include<stdio.h> #include<string.h> //#define ASCII_SIZE 256 char string_freq(char *str) { int i,j,l,cmax=0,count; char s; l=strlen(str); for(i=0;i<l;i++) { count=1; for(j=i+1;j<l;j++) { if(str[i]==str[j]) { count++; } } if(cmax<count) { cmax=count; s=str[i]; } } printf("\n%d",cmax); return s; } in...

Data Structure And Algorithm Important Topics Overview

  Overview Of Data Structures And Algorithms This post will give you the clear idea about learning data structures and algorithms . So, Data structure? => In computer science a data structure is a data organization , management and storage format that enables efficient access and modification. Or in the other words it is a way in which data is stored on a computer. Types of data structures:- Array  String Stack Queue Linked List  Binary Tree Binary Search Tree Heap Hash Table Graph Above topics, array is a linear data structure which stores the data in the sequence order, dynamic array, every data is stored in the next contiguous memory location.   String is a collection of characters. If it contains the alphabets and it also uses the digit as character. If a string is composed of numbers and characters then numbers are also treated as characters. Stack is also a linear data structure. It works either on Last In First Out or First In Last Out . It has only one ...