Reached 500 clicks on Google

 




Today's Morning was rough but by the setting, it was so pleasant. I recently received an email from Google Search Console in which I was congratulated on reaching 500 clicks from Google Search in the past 28 days.


This news is motivating. I am glad to see the progress of mayankvikash.in and the results of my hard work.


Thank you! Everyone who ever visited this website.


I love writing and with this website, I can keep improving it and try to add some valuable things for the world to read.


I had a chat with a friend. I am completing my project work, so I may be less active here. But I will try my best to keep the site updated regularly and add valuable content.


Thanks Again.




Mayank Vikash is a passionate and driven tech enthusiast with a deep-rooted love for all things technology. As a dedicated tech student, Mayank has spent years exploring the ever-evolving world of coding, programming, and digital innovation.

Comments

Post a Comment

Translate

Popular posts from this blog

Letter to SBI Bank Manager of Local Branch to reduce the interest rate on home loan

Image
Letter to SBI Bank Manager of Local Branch to reduce the interest rate on home loan House no.  , Road no.  , Bistupur, Jamshedpur - 831002. 18th December, 2023. The Manager, SBI, Road no. , Bistupur, Jamshedpur - 831002.      Subject [To reduce the interest rate for Home Loan] Sir, I am [Name] and I have an account in your bank (A/C ......). I have been authorized a home loan from your bank which currently has an interest rate of 9.35%. The interest rates have resulted in a huge financial burden for me. I request you to reduce it to a moderate rate which I can cope with.  Yours faithfully, [Name]
Read more

Java Recursion Program Practise 2 - Fibonacci Series

Image
Java program to find the given term of Fibonacci Series using Recursion Function import java.util.*; class Main {          int fib(int n){         if(n==1){         return 0;         }         if(n==2){         return 1;         }         if(n>2){             return(fib(n-2)+fib(n-1));         }         else         return -1;     }     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int a;         System.out.println("Enter the number of terms of Fibonacci series to be displayed using Recursion function");         a = in.nextInt();         Main ob = new Main();   ...
Read more

Java Recursion Program Practise 1 - Factorial

Image
Java Program to find Factorial of given number using Recursion import java.util.*; class Main {          int fact(int n){         if(n==0)         return 1;         else{             return(n*fact(n-1));         }     }     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int a;         System.out.println("Enter a number to get the factorial with the help of recursion");         a = in.nextInt();         Main ob = new Main();        System.out.println(ob.fact(a));                                } }
Read more

Java Recursion Program Practise 5 - to input a number and print the sum of digits of the number

Image
Java Program to input a number and print the sum of digits of the number using Recursive Function import java.util.*; class Main {    int digit(int n){        if(n==0)        return 0;        else        return (n%10+digit(n/10));    }     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int a;         System.out.println("Enter the number whose sum of digit is desired using Recursive function");         a = in.nextInt();         Main ob = new Main();         System.out.println(ob.digit(a));                       } }
Read more

Java Recursion Program Practise 4 - to input a number and display sum from 1 to that number

Image
Java Program to input a number and display sum from 1 to that number using Recursion import java.util.*; class Main {     int add(int n){         if(n>0){             return (n + add(n-1));         }         else         return 0;     }     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int a;         System.out.println("Enter the number of which the sum is desired from 1 to the number n");         a = in.nextInt();         Main ob = new Main();       System.out.println( ob.add(a));              } }
Read more

Java Recursion Program Practise 3 - Raising base to power of index

Image
Java Program to input two number and raising the input number to the power of the another input using Recursive Function.  import java.util.*; class Main {     int power(int n, int p){         if(p==0)         return 1;         else {             return (n* power(n,p-1));         }     }     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         int a, b;         System.out.println("Enter the number and the power to be raised using Recursion Function");          a = in.nextInt();         b = in.nextInt();         Main ob = new Main();         System.out.println(ob.power(a,b));              } }
Read more

Java String Manipulation 28th Jan Practice 1 - to accept a character and check whether it is a letter or not. If letter, then convert it to uppercase or lowercase. Also check whether it is letter or a special character

Image
Java Program to accept a character and check whether it is a letter or not. If letter, then convert it to uppercase or lowercase. Also check whether it is letter or a special character import java.util.*; class Main {     public static void main(String[] args) {         Scanner in = new Scanner(System.in);         char a;         System.out.println("Enter a character");         a = in.next().charAt(0);         if(Character.isLetter(a)){             System.out.println("Character "+ a+ " is letter");             if(Character.isUpperCase(a)){                 System.out.println(Character.toLowerCase(a));             }             else             System.out.println(Character.toUpperCase(a)); ...
Read more

Java String Manipulation 28th Jan Practice 2 - input a string and check whether it is a palindrome or not

Image
Palindrome is a number or a string which when reversed is the same as the original.  import java.util.*; class Main {     public static void main(String[] args) { Scanner in = new Scanner(System.in); String s,s1=""; char ch; System.out.println("Enter a String"); s = in.next(); int l = s.length(); s = s.toUpperCase(); for(int i=l-1; i>=0; i--){     ch = s.charAt(i);     s1 = s1+ch; } System.out.println(s1); if(s1.equals(s)){     System.out.println("Palindrome");      } else System.out.println("Not a palindrome");     } }
Read more

Narrate an experience that shows appearances can be deceiving

Image
A person standing in the railway station dressed in a good looking attire It is a common habit of humans to make judgements at the first look. It does not matter if we are seeing a person or a thing for the first time, our minds do not need to take a second look before coming to a judgement. If we look at a person, we quickly look at his clothes and shoes and come to the assumption that he is poor or rich. The same is the case with things, we decide for ourselves whether a substance is expensive or cheap just by its glittering and glistening. Over time, many learned personalities have taught us to "not judge a book by its cover." Through his various plays and writing, William Shakespeare, the popular eighteenth-century English writer, has sent the message to not fall for outward appearances. I have recently expereinced an incident that explains why is it important to not rely on just outward appearances to make a judgement about a person. I was travelling by train during my s...
Read more

Abhisara - the Tryst Notes

Image
Upagupta, the disciple of Buddha, lay asleep in the dust by thr city wall of Mathura. Lamps were all out, doors were all shut, ans stars were all hidden by the murky sky of August. Whose feet were those tinkling with anklets, touching his breast of a sudden? He woke up startled, and the light from a woman's lamp fell on his forgiving eyes. It was Vasavadatta the dancing girl, starred with jewels, Clouded with a pale blue mantle, drunk with the wine of her youth. She lowered her lamp and saw the young face, austerely beautiful. 'Forgive me, young ascetic,' said the woman, 'Graciously come to my house. The dusty earth is not a fit bed for you.' The young ascetic answered, 'Woman, go on your way; When the time is ripe I will come to you.' Suddenly the black night showed its teeth in a flash of lightning.  The storm growled from the corner of the sky, and the woman trembled in fear. A year had not yet passed. It was eveing of a day in April, in the Spring. The b...
Read more