$25
WT Lab Assignment- 1
Write a program using Java to find the number of times a substring exists in a given string, if the order of characters in the substring is irrelevant-
2. Write a program using Java to read a paragraph from the user and replace specific words mentioned in a vector to the following format; i.e., For example word Happy is reduced to
3. When working with shortest path problems, negative cycles play a very critical role. WAP using Java to print the shortest path between the two nodes if it exists otherwise print CCNegative cycles exist". Can the program be extended to include all possible paths between the two nodes?
4. WAP using java to check if two strings/numbers are anagrams of each other-