This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <string.h> | |
| int main() | |
| { | |
| int i,j,len,c; | |
| char str[1000]; | |
| scanf("%s", str); | |
| for(len=0; str[len] != '\0'; len++); | |
| for(i=0; i<len; i++){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| struct node{ | |
| int data; | |
| struct node* link; | |
| }; | |
| struct node* root = NULL; | |
| int len; | |
| void append(void); | |
| int length(void); | |
| void display(void); | |
| void main() |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <string.h> | |
| int main() | |
| { | |
| int len1,len2,i,j; | |
| char str1[1000],str2[1000]; | |
| scanf("%s\n%s", str1,str2); | |
| for(len1=0; str1[len1] !='\0'; len1++); | |
| for(len2=0; str2[len2] != '\0'; len2++); | |
| for(i=0; i<len2; i++){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #define CAPACITY 5 | |
| int stack[CAPACITY],top=-1; | |
| void push(int); | |
| int pop(); | |
| int isfull(void); | |
| int isempty(); | |
| void peek(void); | |
| void Traverse(void); | |
| void main() | |
| { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int len,i,j,t,c,k; | |
| char str[1000]; | |
| scanf("%s", str); | |
| for(len=0; str[len] != '\0'; len++); | |
| for(i=0; i<len; i++){ | |
| for(j=i+1; j<len; j++){ | |
| if(str[i] > str[j]){ | |
| t=str[i]; | |
| str[i]=str[j]; | |
| str[j]=t; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| int main(){ | |
| int len,i,j,t,c,k; | |
| char str[1000]; | |
| scanf("%s", str); | |
| for(len=0; str[len] != '\0'; len++); | |
| for(i=0; i<len; i++){ | |
| for(j=i+1; j<len; j++){ | |
| if(str[i] > str[j]){ | |
| t=str[i]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| int main() | |
| { | |
| int i,j,count,no_count=0,len1,len2,len; | |
| char str1[1000],str2[1000]; | |
| scanf("%s\n%s", str1,str2); | |
| for(len1=0; str1[len1] != '\0'; len1++); | |
| for(len2=0; str2[len2] != '\0'; len2++); | |
| if(len1==len2){ | |
| len=len1; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| sample input1: | |
| jeevitha | |
| output: | |
| e | |
| sample input2: | |
| balloon | |
| output: | |
| lo | |
| int main() | |
| { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| sample input1: | |
| {{}{}{}} | |
| sample output: | |
| Balanced | |
| sample input2: | |
| }}{}{}{} | |
| sample output: | |
| Unbalanced |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| example1: | |
| i/p:S02E03 | |
| o/p:Season 2, Episode 3 | |
| example2: | |
| i/p:S10E23 | |
| o/p:Season 10, Episode 23 | |
| example3: | |
| i/p:S06E60 | |
| o/p:Season 6, Episode 60 | |
OlderNewer