+ 5
Can anyone help me to complete this Pangrams codes
The detail description is in the code section with comments!! https://code.sololearn.com/c627y3KkROZo/?ref=app
9 Answers
+ 3
Rajeev Sharma for example in this way:
https://code.sololearn.com/cn8K2n497vk0/?ref=app
+ 3
Hint: you have to check of a text included all letters of alphabet at least one time.
+ 3
JaScript any example to make logic?
+ 3
Rajeev Sharma happy coding!
+ 1
Rajeev Sharma there is a total of 26 letters. You can create an array of size 26 where all elements are initially 0. Then you can iterate the string and update the corresponding index in the array to 1. At the end iterate the whole array, if there is no 0 found, it means it is a Pangram and vice versa.
+ 1
You need a loop and an inner loop to iterate the alphabet and the string, and every time a letter from the alphabet is in the string, then increase a variable to 1, and then break the inner loop.
In the end, you can compare if the variable has the same value as the length of the alphabet.
+ 1
JaScript I used two loops in this solution, but your solution is probably faster, because of less iterations.
https://code.sololearn.com/cmyGi2q6H53R/?ref=app
0
Can anyone help me to complete my certification program?