-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex-3.html
More file actions
168 lines (139 loc) · 3.69 KB
/
Copy pathindex-3.html
File metadata and controls
168 lines (139 loc) · 3.69 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
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="keywords" content="Print the Table, Print Numbers, Check whether a Number is a prime or not, Print the Pattern, Print the Odds, Find the sum of the digits of a given number, Iteration Statements, Find the number of digits, Find the Fives, Find Sum">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Coding Assisement</title>
<link rel="stylesheet" href="./style.css">
</head>
<body>
<h2>3. Iteration Statements</h2>
<!-- ====== write code -->
<div class="Que">
<p>Que.1 Find the number of digits</p>
<pre>
const Find_Digits = (N) =>
{
// Convert the number to a string
const numStr = N.toString();
// Initialize the count to 0
let count = 0;
// Iterate through each character in the string
for (const ch of numStr) {
// If the character is a digit, increment the count
if (/[0-9]/.test(ch)) {
count++;
}
}
// Return the count
return count;
};
</pre>
<p>Que.2 Find the Fives.</p>
<pre>
const Find_Five = (N) =>
{
// Convert the number to a string
const numStr = N.toString();
// Initialize the count to 0
let count = 0;
// Iterate through each character in the string
for (const ch of numStr) {
// If the character is a digit, increment the count
if (ch == '5') {
count++;
}
}
// Return the count
return count;
};
</pre>
<p>Que.3 Find Sum</p>
<pre>
const findSum = (n) => {
let sum = 0;
for(let i=1; i<=n; i++){
if(i%2===0){
sum = sum+i;
}
}
return sum;
};
</pre>
<p>Que.4 Find the sum of the digits of a given number.</p>
<pre>
const Number_Sum = (N) =>
{
// Convert the number to a string
const numStr = N.toString();
let sum = 0;
for (const ch of numStr) {
sum += Number(ch);
}
return sum;
};
</pre>
<p>Que.5 Print the Odds.</p>
<pre>
const Print_Odd = (N) =>
{
console.log("2"); // print 2 first
for (let i = 3; i <= N; i += 2) { // start from 3 and increment by 2 to get only odd numbers
console.log(i);
}
};
</pre>
<p>Que.6 Print the Pattern.</p>
<pre>
const Print_pattern = (N) =>
{
for(let i=0; i < N; i++){
let row = "";
for(let j=0; j<=i; j++){
row += "*";
}
console.log(row);
}
};
</pre>
<p>Que.7 Check whether a Number is a prime or not.</p>
<pre>
const Prime_Check = (N) =>
{
if (N < 2) {
return "NO";
}
for (let i = 2; i <= Math.sqrt(N); i++) {
if (N % i === 0) {
return "NO";
}
}
return "YES";
};
</pre>
<p>Que.8 Print Numbers</p>
<pre>
const printNumbers = (n) => {
for(let i=1; i<=n; i++){
console.log(i);
}
};
</pre>
<p>Que.9 Print the Table</p>
<pre>
const Print_Table = (N) =>
{
for (let i = 1; i <= 10; i++) {
console.log(N + " * " + i + " = " + N*i);
}
};
</pre>
</div>
<div class="container">
<div class="row"><a href="./index-2.html">Back</a></div>
<div class="row"><a href="./index-4.html">Next</a></div>
</div>
</body>
</html>