-
Notifications
You must be signed in to change notification settings - Fork 0
/
Append and Delete.js
56 lines (50 loc) · 1.66 KB
/
Append and Delete.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
//I failed to grasp certain odd n even conditions
function appendandDelete(s,t,k){
let counter = 0;
let max = Math.max(s.length,t.length)
let min = Math.min(s.length,t.length)
for(let i=0;i<s.length;i++){
if(s[i] !== t[i]){
break;
}
counter++;
}
if((max == min && counter == max) || s == ''){
return 'Yes';
}else if(s.length > t.length && ((max - counter) > k)){
return 'No';
}
let modify = (max - counter) + (min - counter)
console.log(max,min,counter,modify)
return modify==k ? 'Yes' : 'No'
}
appendandDelete('hackerhappy','hackerrank',9)
//modified code
Here if k < modify it returns false for rest it's 'Yes'
function appendandDelete(s,t,k){
let counter = 0;
let max = Math.max(s.length,t.length)
let min = Math.min(s.length,t.length)
for(let i=0;i<s.length;i++){
if(s[i] !== t[i]){
break;
}
counter++;
}
let modify = (max - counter) + (min - counter);
if(k == modify || k >= s.length + t.length) return 'Yes';
else if(k >= modify && k% 2 == modify %2 ) return 'Yes'
else return 'No'
}
appendandDelete('hackerhappy','hackerrank',9)
function appendAndDelete(s, t, k) {
// Write your code here
let operation = 0, i = 0;
for( ; i < Math.min(s.length, t.length); i++) {
if(s.charAt(i) != t.charAt(i)) break;
}
operation = s.length - i + t.length - i;
if(k == operation || k >= s.length + t.length) return 'Yes';
else if(k >= operation && k % 2 == operation % 2) return 'Yes';
else return 'No';
}