Answer:
The answer is: second line indent
Explanation:
Also known as a second line indent, sets off the first line of a paragraph by positioning it at the margin, and then indenting each subsequent line of the paragraph.
Lower cost - You can leverage web technologies like FB and Google which allow you to advertise and reach billions of users relying on their services at a very low cost as compared to other mediums.
Security – Data stored with web technology companies offers more security because it is stored in huge data centers that have high-end protection
Increase business efficiency – Web technologies can increase business efficiency and unlock value in your business functions. They can reduce time, provide critical analytics and help your business grow.
Answer:
The program in Python is as follows:
word = input("Word: ")
if len(word) < 5:
print("At least 5 characters")
else:
pal = word[0:5]
word = word[0:4]
word = word[::-1]
pal+=word
print(pal)
Explanation:
This gets the word from the user
word = input("Word: ")
This checks if the length of the word is less than 5.
if len(word) < 5:
If yes, this tells the user that at least 5 characters is needed
print("At least 5 characters")
If otherwise
else:
This extracts the first 5 characters of the word into variable named pal
pal = word[0:5]
This extracts the first 5 characters of the word into variable named word
word = word[0:4]
This reverses variable word
word = word[::-1]
This concatenates pal and word
pal+=word
This prints the generated palindrome
print(pal)
Answer:
See explaination
Explanation:
Keep two iterators, i (for nuts array) and j (for bolts array).
while(i < n and j < n) {
if nuts[i] == bolts[j] {
We have a case where sizes match, output/return
}
else if nuts[i] < bolts[j] {
this means that size of nut is smaller than that of bolt and we should go to the next bigger nut, i.e., i+=1
}
else {
this means that size of bolt is smaller than that of nut and we should go to the next bigger bolt, i.e., j+=1
}
}
Since we go to each index in both the array only once, the algorithm take O(n) time.
