Code Crumble

  Introduction The construction of Ram Mandir in Ayodhya, India has been a topic of great controversy and debate. The significance of this temple goes beyond religious beliefs and holds a deep historical and cultural value for the nation. In this blog, we will explore the importance of Ram Mandir from various perspectives and shed light on the reasons why it holds such a special place in the hearts of millions of Indians. The Historic Proof The history of Ayodhya and the existence of Ram Mandir date back centuries. According to the epic tale of Ramayana, Bhagvan Ram returned to Ayodhya after 14 years of exile, and it is during his reign that the city flourished. However, around 500 years ago, the house of Bhagvan Shri Ram was attacked and a mosque, known as Babri Masjid, was built on the site. Historical evidence has shown that the original name of the mosque was Masjid-e-Janamsthan, which translates to "mosque at the birthplace." This itself indicates that the mosque was...

  Problem 1: Print Your Name n Times Let's start with a simple problem: printing your name n times using recursion. The generic way to achieve this would be to run a for loop and print your name n times. However, in this case, we want to use recursion. To solve this problem, we will define a recursive function called f(i, n) . The function takes two parameters: i , which represents the current iteration, and n , which represents the total number of times to print your name. We start by taking the input of n from the user. Then, we call the function f(0, n) , which will recursively print your name n times. Here's how the function works: Check if i is greater than n . If it is, return. Print your name. Call the function f(i + 1, n) to recursively print your name n times. By following these steps, we can easily print your name n times using recursion. Problem 2: Print Numbers from 1 to n Next, let's solve a problem where we need to print numbers from 1 to n in...

  Introduction Welcome to this blog where we will explore the complete journey of the Ram Temple in Ayodhya, from its humble beginnings to its grand existence. Ayodhya holds a significant place in the religious and cultural tapestry of India, as it is believed to be the birthplace of Lord Ram, one of the most revered deities in Hinduism. The history of the Ram Temple is deeply intertwined with the socio-political landscape of India, with numerous debates and legal battles that have shaped its destiny. Let's delve into the rich history and significance of this sacred place. Ancient Origins According to Hindu mythology, Ayodhya is considered the birthplace of Lord Ram, the seventh avatar of Lord Vishnu. The ancient epic, Ramayana, narrates the story of Lord Ram's birth in Ayodhya and his journey to become a revered deity. The city of Ayodhya remained an important religious and cultural center throughout history, with various rulers and dynasties paying homage to Lord Ram and u...

  How to Determine if a Number is Prime or Not Introduction Prime numbers are a special type of numbers that can only be divided by 1 or themselves without leaving a remainder. They are unique and have various properties that distinguish them from non-prime numbers. In this blog, we will explore the concept of prime numbers and discuss a simple method to check if a given number is prime or not. What are Prime Numbers? Prime numbers are a set of numbers that are only divisible by 1 and themselves. For example, the numbers 2, 3, 5, and 7 are prime numbers. These numbers cannot be divided evenly by any other number. How to Determine if a Number is Prime? To determine if a number is prime, we can follow a simple approach. We start by checking if the number is divisible by any number between 2 and one less than the number itself. If the number is divisible by any of these numbers, then it is not a prime number. On the other hand, if the number is not divisible by any of these numbe...

Introduction In this blog, we will discuss the problem of finding the sum of all divisors from 1 to N. This problem is an observation-based problem with a tint of simple mathematics. We will explore different approaches and algorithms to solve this problem efficiently. Understanding the Problem The problem statement is self-explanatory. Given a number N, we need to find the sum of all its divisors from 1 to N. Brute Force Approach Initially, we can think of solving this problem using a brute force approach. We can iterate from 1 to N and check if each number is a divisor of N. If it is a divisor, we add it to the sum. However, this approach is not optimal for large values of N. Optimized Approach To optimize the solution, we can use a contribution technique. Instead of finding all the divisors individually, we can find the contribution of each number in the sum. Let's understand this technique with an example: For N = 8: 1 can contribute to all numbers from 1 to 8 2 can contribut...

You are given an integer   'n' . Return  'true'  if 'n' is an Armstrong number, and  'false'  otherwise. An Armstrong number is a number (with 'k' digits) such that the sum of its digits raised to 'kth' power is equal to the number itself. For example, 371 is an Armstrong number because 3^3 + 7^3 + 1^3 = 371. bool  checkArmstrong(int n){      //Write your code here     int num= 0 ,temp;     int count= 0 ;      for (int i=n;i> 0 ;i=i/ 10 )      count++;      for (int i=n;i> 0 ;i=i/ 10 )     {         temp=i% 10 ;         num=num+pow(temp,count);     }     if (num==n)      return   true ;     else    ...

Problem statement Check whether a given number   ’n’   is a palindrome number.   Example: Input: 'n' = 51415 Output: true Explanation: On reversing, 51415 gives 51415. Checking for Palindrome Numbers Palindrome numbers are numbers that read the same backward as forward. For example, 121 and 12321 are palindrome numbers. To check if a number is a palindrome, we can reverse the number and compare it with the original number. If they are the same, the number is a palindrome; otherwise, it is not. Using the concepts of extracting digits and reversing a number, we can efficiently check for palindrome numbers. bool  palindrome(int n) {      // Write your code here     int num= 0 ,temp;      for (int i=n; i> 0 ;i=i/ 10 )     {         temp=i% 10 ;         num=(num* 10 )+temp...

 #dsa #leetcode #problem_solving Given a signed 32-bit integer  x , return  x  with its digits reversed . If reversing  x  causes the value to go outside the signed 32-bit integer range  [-2 31 , 2 31 - 1] , then return  0 . Assume the environment does not allow you to store 64-bit integers (signed or unsigned). Example 1: Input: x = 123 Output: 321 Example 2: Input: x = -123 Output: -321 Example 3: Input: x = 120 Output: 21 class Solution { public:     int reverse ( int x ) {         int num= 0 , temp;     for ( int i=x; i!= 0 ; i=i/ 10 )     { temp=i% 10 ;         if ((num > INT_MAX/ 10 )|| (num < INT_MIN/ 10 ))         return 0 ;       num= (num* 10 ) + temp;     }     return num;     } };

DSA  Find the number of digits of ‘n’ that evenly divide ‘n’. The objective is to calculate the modulus of each digit in the number n, then determine if that digit divides n. Consequently, increase the counter. Keep in mind that the digit may be 0, therefore handle such scenario. int countDigits(int n){     int count= 0 ;      for (int i=n; i> 0 ; i=i/ 10 )     {         int temp = i% 10 ;          if (temp> 0  && n%temp== 0 )          count++;     }            return  count; }

 One of the most widely used high-level programming languages is C++. Developers have been using it for a long time, and because of its quicker execution time, all programmers have always enjoyed it, especially competitive programmers. One of C++'s special features that sets it apart from all other programming languages is STL. The term "STL" refers to the standard template library , which is full of pre-defined templates for classes and containers. This makes it very simple for programmers or developers to implement various data structures without having to write all of the code themselves or worry about space-time complexities. If you go a bit further into STL, you will need to grasp the workings of templates, which are among the most powerful tools available for the C++ programming language.

  Finding the peak element in the mountain array using binary search. (Data Structures and Algorithms) #include<iostream> using namespace std; void MountSearch (int arr[], int size ) { int start = 0, end = size-1; int index = 0; for(int mid = start + (end-start)/2; start <= end; mid = start + (end-start)/2 ) { if(arr[mid-1]<arr[mid] && arr[mid]>arr[mid+1]) { index = mid; break; } else if(arr[mid]<arr[mid+1]) { start = mid+1; } else if(arr[mid-1]>arr[mid]) { end = mid; } } cout<<"The index of the peak is: "<<index; } int main () { int arr[9] = {0,1,2,4,5,3,2,1,0}; MountSearch(arr,9); return 0; }

  Today, we’re diving deep into the cutting-edge world of Artificial Intelligence — specifically, exploring the latest and most exciting developments in the field. Get ready to witness the wonders of Emerging AI as we unravel how it’s reshaping our world and what we can expect in the near future. If you’re as fascinated as I am about the potential of AI, don’t forget to hit that like button and subscribe, so you won’t miss any of our tech explorations. Let’s jump right in! AI-Powered Healthcare One of the most revolutionary applications of Emerging AI is in healthcare. From diagnosing diseases with unprecedented accuracy to assisting in surgeries, AI is transforming patient care. Imagine a world where AI-driven medical imaging can detect diseases at earlier stages, potentially saving countless lives. Today, we’ll witness some incredible AI-powered healthcare solutions that are making waves in the medical community. AI and Creative Industries AI’s capabilities are not limited to tec...