Answer:
The output is attached below
Explanation:
d = {}
while True:
line = input("Enter line: ")
if len(line)==0:
break
token = line.split(' ')
for var in token:
try:
if len(var)==0:
continue
count = d[var]
d[var] = count + 1
except KeyError:
d[var] = 1
pass
for word in sorted(d):
print(word , d[word])
------------------
Answer:
Ther are 8 best programming language :
• Javascript
• Swift
• Scala
• Go
• Python
• Elm
• Ruby
• C#
Infinite
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
Answer:
Explanation:
The following code is written in Java. Both functions traverse the linkedlist, until it reaches the desired index and either returns that value or deletes it. If no value is found the function terminates.
public int GetNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.data;
count++;
current = current.next;
}
assert (false);
return 0;
}
public int removeNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.remove;
count++;
current = current.next;
}
assert (false);
return 0;
}
<span>Create new ad groups with related keywords grouped together</span>
