Skip to main content

Featured

Solve LeetCode 3 Longest Substring Without Repeating Characters in C++ using the sliding window

Longest Substring Without Repeating Characters in C++ LeetCode 3 · sliding window · last index array Table of Contents Problem Statement Approach Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Conclusion Problem Statement 3. Longest Substring Without Repeating Characters Given a string s , find the length of the longest substring that contains no repeating characters. A substring is a continuous part of the string, so "pwke" is a subsequence of "pwwkew" but not a substring. Approach We use a sliding window . The window is the part of the string between start and end , and we always keep it free of repeated characters. An array lastIndex of size 128 remembers the most recent position of every ASCII ...

Write a program to find the max of two numbers in c

 Description : 

You have to read two integers from user and find the maximum of two integers.

Sample Execution : 

Test case 1 : 

Enter the num1 : 10

Enter the num2 : 20 

Max of two numbers is 20

Test case 2 :

Enter the num1 : 95

Enter the num2 : 25 

Max of two numbers is 95

PROGRAM:

---------------------------------------------------------------------------------------------------------------

#include<stdio.h>

int main()

{

    int num1,num2;

      printf("Enter the num1:");

     scanf("%d",&num1);

   printf("Enter the num2:");

    scanf("%d",&num2);

   if(num1>=num2)

    {

    printf("max of two numbers is %d",num1);

    }

else if(num2>=num1)

{

printf("max of two numbers is %d",num2);

}

}

---------------------------------------------------------------------------------------------------------------

Comments

Popular Posts

🌙