Online 4, string and function;

 

 Basic Level

  1. Print length of a string

    • Input: "hello"

    • Output: 5

  2. Reverse a string

    • Input: "gojo"

    • Output: "ojog"

  3. Check Palindrome

    • Input: "madam"

    • Output: Yes

  4. Copy one string to another without using strcpy()

  5. Count vowels in a string

🟨 Intermediate Level

  1. Count frequency of each character

    • Input: "banana"

    • Output: a=3, b=1, n=2

  2. Check if two strings are anagrams

    • Input: "listen", "silent"

    • Output: Yes

  3. Convert all characters to uppercase

  4. Find number of words in a string

    • Input: "I love C programming"

    • Output: 4

  5. Remove all vowels from a string

🟦 Challenge Level

  1. Find the longest palindromic substring

  2. Find the first non-repeating character

  3. Count occurrences of a substring

  4. Sort characters in a string

  5. Implement custom strstr() function



#online rotationL
// /*Input:
// waterbottle
// erbottlewat*/
#include<stdio.h>
#include<string.h>
void rotation(char str1[], int n)
{
    int len= strlen(str1);
     
    char temp[100]; int k=0;
for(int i=0; i<n;i++)  //0,1
{
    temp[k++]= str1[i];
}
for(int i=0; i<len-n;i++) //0,1,2 |2,3,4
{
    str1[i]= str1[i+n];
}
int l=0;
for(int i=len-n; i<len; i++)
{
    str1[i]= temp[l++];  //3,4 0,1
}


}

int rotation_perfection(char str[], char str2[], int n)
{  int len = strlen(str);
    rotation(str,n);
    if(strcmp(str, str2)==0){return 1;}
    return 0;
}

 //abcde cdeab
int main()
{

   char str[100]; scanf("%s", str);
   char str2[100]; scanf("%s", str2);
char str3[100]; char str4[200];

  int n=strlen(str);
int result;

  for(int i=0; i<=n; i++)
  {result= rotation_perfection(str3, str4, i);
    if(result==1){result=1; break;}
    strcpy(str3, str);
strcpy(str4, str2);
  }
 
   printf("%d", result);
}

Comments

Post a Comment

Popular posts from this blog

Phy 129 - WM, CT-03

  Statement : For position ( x x x ) and momentum ( p p p ), the uncertainty principle is: Δ x ⋅ Δ p ≥ ℏ 2 \Delta x \cdot \Delta p \geq \frac{\hbar}{2} Δ x ⋅ Δ p ≥ 2 ℏ ​ where Δ x \Delta x Δ x is the uncertainty in position, Δ p \Delta p Δ p is the uncertainty in momentum, and ℏ ≈ 1.05 × 1 0 − 34   J \cdotp s \hbar \approx 1.05 \times 10^{-34} \, \text{J·s} ℏ ≈ 1.05 × 1 0 − 34 J \cdotp s . Similarly, for energy ( E E E ) and time ( t t t ): Δ E ⋅ Δ t ≥ ℏ 2 \Delta E \cdot \Delta t \geq \frac{\hbar}{2} Δ E ⋅ Δ t ≥ 2 ℏ ​ . #Learning -2 p = γ m v p = \gamma m v p = γm v , where: m m m is the rest mass of the particle, v v v is the velocity of the particle, γ \gamma γ is the Lorentz factor, given by γ = 1 1 − v 2 c 2 \gamma = \frac{1}{\sqrt{1 - \frac{v^2}{c^2}}} ; A wave group: a wave group corresponds to a moving particle and is formed by the superposition of multiple harmonic waves with different frequencies, wave numbers, and amplitudes.\ Wave Function Ψ ( x ) \Psi(x)...
Read more
Copy of Jujutsu Kaisen 2D Game UI Design Request                                                                                                                                                                ...
Read more

Online 3 CSE 102; Array Resources.

 Problems and their solution: Practice Problems on “Array” (MOODLE) Problem 1: Floor, Ceil within an array              A[] = {96, 21, 58, 34, 46} Number Floor Ceil 15 -1 21 21 21 21 30 21 34 96 96 96 98 96 -1 Solution: Sort them, then find floor and ceil from the array. Use selection sort: void selectionSort(int arr[], int n) {     int i, j, minIndex, temp;     for (i = 0; i < n - 1; i++) {         minIndex = i;         // Find the index of the smallest element in the remaining array         for (j = i + 1; j < n; j++) {             if (arr[j] < arr[minIndex])                 minIndex = j;         }         // Swap the found minimum element with the first element         if (minIndex != i) {    ...
Read more