-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathscript.js
More file actions
275 lines (196 loc) · 6.37 KB
/
script.js
File metadata and controls
275 lines (196 loc) · 6.37 KB
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
//Q// Remove duplicate members from an array?//done
// const arr = [1, 2, 5, 5, 6, 7, 8, 3, 9, 9, 9, 5];
// const elementRemove = (arr) => {
//solution #1
// console.log([...new Set(arr)]);//[1,2,5,6,7,8,3,9]
//solution #2
// let newArr = [];
// for (let i = 0; i < arr.length; i++) {
// if (arr.indexOf(arr[i]) !== i) {
// newArr[newArr.length] = arr[i];
// }
// }
// return newArr;
//solution #3
// const newArr = arr.filter((el, i, arr) => i === arr.indexOf(el));
// return newArr;
// };
// console.log(elementRemove(arr));
//Q// Merge two sorted array?//done
// const arr1 = [1, 2, 3, 4, 5];
// const arr2 = [6, 7, 8, 9, 10];
// console.log([...arr1, ...arr2]);
//Q// Swap two numbers without using a temp variable?//done
// const stringNum = [2, 3];
// let [first, second] = stringNum;
// [second, first] = [first, second];
// console.log(first, second);
//Q// Reverse a string in JavaScript?//done
// const stringName = "Hello!, Mansoor I would Like to meet you.";
// const reverseString = stringName.split(" ").reverse().join(" ");
// console.log(reverseString);
//Q// Reverse words in a sentence?//done
// const stringName2 = "Hello!, Mansoor I would Like to meet you.";
// const reverseString2 = stringName.split("").reverse().join("");
// console.log(reverseString2);
//Q// Reverse words in place?//done
// const stringName3 = "Hello!, Mansoor I would Like to meet you.";
// const reverseStringinPlace = stringName3
// .split(" ")
// .map((el) => el.split("").reverse().join(""))
// .join(" ");
// console.log(reverseStringinPlace);
//Q// Find the first non repeating char in a string?//done
// const longestString = "mansoor";
// const nonReapeatingWord = longestString
// .split("")
// .find((el, i, arr) => i === arr.indexOf(el));
// console.log(nonReapeatingWord);
//Q// Remove duplicate characters from a sting?
const fullName = "Mansoor Khan Anis";
const removeDuplicate = (str) => {
return str
.toLowerCase()
.trim()
.split("")
.filter((el, i, arr) => i == arr.indexOf(el))
.join("");
};
console.log(removeDuplicate(fullName));
//Q// Verify a word as palindrome?//done
// const palindrom = "racecar";
// function palindromChecker(pali) {
// const palindrom = pali.toLowerCase();
// const reversePalindrom = pali.toLowerCase().split("").reverse().join("");
// console.log(reversePalindrom);
// return palindrom === reversePalindrom;
// }
// console.log(palindromChecker("racecar"));
// Q// Generate random between 5 to 7 by using defined function.//done
// function randomGenerator(value) {
// return Math.floor(Math.random() * 3) + 5;
// }
// console.log(randomGenerator());
//Q// Find missing number from unsorted array of integers.//done
// function findMissingNumber(arr) {
// const sortedArrar = arr.sort((a, b) => a - b);
// const startNUm = sortedArrar[0];
// const endNum = sortedArrar.at(-1);
// let missingNum = [];
// for (let i = startNUm; i <= endNum; i++) {
// sortedArrar.indexOf(i) === -1 ? (missingNum[missingNum.length] = i) : -1;
// }
// return missingNum;
// }
// console.log(findMissingNumber([1, 5, 6, 3, 9, 2, 4]));
// console.log(findMissingNumber([1, 3, 5, 7, 9, 12]));
// console.log(findMissingNumber([2, 4, 6, 8, 10, 13]));
//[1, 2, 3, 4, 5, 6, 9]
//Q// Check whether any two numbers in an array sums to a given number?//done
// const input = [1,2,5,4,6,8,7,9]
/*Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]. */
/*Input: nums = [3,2,4], target = 6
Output: [1,2] */
/*Input: nums = [3,3], target = 6
Output: [0,1] */
//let's creat question
//[2, 7, 11, 15] this will be our target value 9
// let target = 9;
//
// console.log(arr);
// // let resultArr = [];
// let length = arr.length;
// for (let i = 0; i < length; i++) {
// // resultArr[resultArr.length] = target - arr[i];
// // if (resultArr[arr[i]]) {
// // console.log("hurray");
// // }
// // target = target + arr[i];
// // if (resultArr.length === arr.length) console.log("lol");
// console.log(arr[i], arr[i + 1]);
// if (arr[i] + arr[i + 1] === target) {
// console.log(arr.indexOf(arr[i]), arr.lastIndexOf(arr[i + 1]));
// console.log("hurray");
// }
// console.log(target);
// // console.log(resultArr.indexOf(arr[i]));
// }
// resultArr.filter((el, i) => console.log(arr.indexOf(el)));
// return resultArr;
// console.log(sum([2, 7, 11, 15], 9));
//output
//Q// Total number of zeros from 1 upto n?
// console.log();
//Q// Match substring of a string?
// const subString = "fox";
// const longSentence = "long nose fox run over lazy dog";
// console.log(longSentence.includes(subString));
// // or
// function matchSubString(str, substr) {
// // 'string'.substring
// console.log(
// str.substring(str.indexOf(substr), str.indexOf(substr) + substr.length) ===
// substr
// );
// }
// console.log(matchSubString(longSentence, subString));
/*Verify a prime number?*/ //done
// const numArr = [2, 4, 7, 9, 6, 34, 67];
//solution #1
// function findPrimes(limit) {
// let isPrime = [];
// let primes = [];
// for (let i = 2; i <= limit; i++) {
// isPrime[i] = true;
// }
// console.log(isPrime);
// for (let i = 2; i <= limit; i++) {
// if (isPrime[i]) {
// primes.push(i);
// for (let j = i * i; j <= limit; j += i) {
// isPrime[j] = false;
// console.log(j);
// }
// }
// }
// return primes;
// }
// const primes = findPrimes(20);
// console.log(primes); // [2, 3, 5, 7, 11, 13, 17, 19]
// // solution #2
// function isPrime(num) {
// if (num < 2) {
// return false;
// }
// for (let i = 2; i <= Math.sqrt(num); i++) {
// if (num % i == 0) {
// return false;
// }
// }
// return true;
// }
// console.log(isPrime(7)); // true
// console.log(isPrime(10)); // false
// function mul(x) {
// return function (y) {
// return {
// result: x * y,
// sum: function (z) {
// return x * y + z;
// },
// };
// };
// }
// console.log(mul(2)(3).result);
// console.log(mul(2)(3).sum(4));
// Input: “adsjfdsfsfjsdjfhacabcsbajda”
// Output: { a: 5, b: 2, c: 2, d: 4, f: 4, j: 4, s: 5 }
// const RepeatedString = "adsjfdsfsfjsdjfhacabcsbajda";
// const obj = {};
// const value = RepeatedString.split("").filter((el, i, arr) => {
// const repatd = i === arr.indexOf(el);
// console.log(repatd);
// });
// console.log(value);