Problem:-
There are three type of the edits that can be performed on strings: insert a character, remove a character , or replace a character . Give two strings , write a function to check if they are one edit(or zero edits ) away.
Exmple:-
pale, ple -> True
pales, pale -> true
pale , bale -> true
pale , bake -> false
Code:-
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int f1[122],f2[122];
int main()
{
char s1[50],s2[50];
int i;
printf("Enter first string\n");
scanf("%s",s1);
printf("Enter second string\n");
scanf("%s",s2);
int l1,l2,l;
l1=strlen(s1);
l2=strlen(s2);
// minimum length
l=l1>l2?l2:l1;
int edits=0,flag=0;
// if diff of length is greater than 1
if(abs(l1-l2)>1)
printf("False");
else
{
int i,j;
for(i=0,j=0;j<l;i++)
{
if(s1[i]!=s2[j])
{
if(edits!=0)
{
flag=1;
break;
}
edits++;
if(l1==l2)
j++;
}
else
j++;
}
if(flag==1)
printf("False");
else
printf("Ture");
}
}
Output:-
Enter first string
pale
Enter second string
ple
Ture
Recommended Post:
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
- Playing With Characters | Hackerrank practice problem solution
- Sum and Difference of Two Numbers | hackerrank practice problem solution
- Functions in C | hackerrank practice problem solution
- Pointers in C | hackerrank practice problem solution
- Conditional Statements in C | Hackerrank practice problem solution
- For Loop in C | hackerrank practice problem solution
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
MCQs:-
