Answer:
how many times as strong would what?
put your question in the replies to this answer and I'll gladly answer it
Explanation:
May I have brainliest please? :)
Answer:
Websphere Studio Application Developer
Answer:
def isAnagram(s1, s2):
list1=s1
list2=s2
sortedlist1 = sorted(list1)
sortedlist2 = sorted(list2)
if sortedlist1 == sortedlist2:
print(list1+ " and "+list2+ " are anagram")
else:
print(list1+ " and "+list2+ " are not anagram")
Explanation:
Here is a call to the function isAnagram():
list1 =input("Enter String1 ")
list1 =input("Enter String2 ")
isAnagram(list1,list2)
Attached is the run and output for this program
Answer:
The JavaScript statement is
var str1 = "Information Technology";
var result = str1.toUpperCase();
Explanation:
JavaScript is used to validate the client side it means it provide the client side validation.
Following are the function of JavaScript that converted the string into uppercase.
function val()
{
var str1 = "Information Technology ";
var result = str1.toUpperCase();
}
The toUpperCase() function convert the string into uppercase in JavaScript
OUTPUT
INFORMATION TECHNOLOGY
Hi,
I changed your program using some of the concepts you were trying to use. Hopefully you can see how it works:
#include <string>
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
short T;
cin >> T;
cin.ignore();
string str[100];
for(int i=0; i<T; i++)
{
getline(cin, str[i]);
}
for (int i = 0; i < T; i++)
{
stringstream ss(str[i]);
string tmp;
vector<string> v;
while (ss >> tmp)
{
// Let's capitalize it before storing in the vector
if (!tmp.empty())
{
transform(begin(tmp), end(tmp), std::begin(tmp), ::tolower);
tmp[0] = toupper(tmp[0]);
}
v.push_back(tmp);
}
if (v.size() == 1)
{
cout << v[0] << endl;
}
else if (v.size() == 2)
{
cout << v[0][0] << ". " << v[1] << endl;
}
else
{
cout << v[0][0] << ". " << v[1][0] << ". " << v[2] << endl;
}
}
return 0;
}
