SDE - 1

Follow the below steps to solve the problem:

Run a for loop to traverse the string and create a temporary string to store the words
If the current character is a space then add the current string to the answer and empty the string
Else push the character into the string
Print the answer array in reverse order 

#include 
using namespace std;

// Function to reverse words*/
void reverseWords(string s)
{

// temporary vector to store all words
vector tmp;
string str = "";
for (int i = 0; i < s.length(); i++)
{

// Check if we encounter space
// push word(str) to vector
// and make str NULL
if (s[i] == ' ')
{
tmp.push_back(str);
str = "";
}

// Else add character to
// str to form current word
else
str += s[i];
}

// Last word remaining,add it to vector
tmp.push_back(str);

// Now print from last to first in vector
int i;
for (i = tmp.size() - 1; i > 0; i--)
cout << tmp[i] << " ";
// Last word remaining,print it
cout << tmp[0] << endl;
}

// Driver Code
int main()
{
string s = "i like this program very much";
reverseWords(s);
return 0;

Follow the given steps to solve the problem

Find all the positions of the first character of the original string in the string to be checked.
For every position found, consider it to be the starting index of the string to be checked.
Beginning from the new starting index, compare both strings and check whether they are equal or not.
(Suppose the original string to is s1, string to be checked to be s2,n is the length of strings and j is the position of the first character of s1 in s2, then for i < (length of original string) , check if s1[i]==s2[(j+1)%n). Return false if any character mismatch is found, else return true.
Repeat 3rd step for all positions found. 

import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int price[] = new int[n];
for(int i=0;i diff = new Vector<>();
for(int i=n-2;i>=0;i--) {
diff.add(price[i+1]-price[i]);
}
int ans = solve(diff);
if(ans<0) {
System.out.println(0);
}else {
System.out.println(ans);
}

}
private static int solve(Vector v) {
int n = v.size();
if(n==0) {
return 0;
}
int mx = v.get(0);
for(int i=1;i < n;i++) {
mx = Math.max(mx, v.get(i));
}
if(mx<=0) {
return 0;
}
int mxSum=0,csum=0;
for(int i=0;i < n;i++) {
csum+=v.get(i);
if(csum < 0)
csum=0;
mxSum = Math.max(csum, mxSum);
}
return mxSum;
}
}