Software Engineer

// filename Test.java
class Test {
  public static void main(String args[]) {
      System.out.println(fun());
  }
  static int fun() {
      static int x= 0;
      return ++x;
  }
}

// filename Main.java
class Main {
   public static void main(String args[]) {  
       System.out.println(fun());
   }
   int fun() {
       return 20;
   }
}

You are given a string 'str' of length 'N'.

Your task is to return the longest palindromic substring. If there are multiple strings, return any.

A substring is a contiguous segment of a string.

For example :

str = "ababc"

The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome. 

There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.

A, B and C can do a piece of work in 20, 30 and 60 days respectively. In how many days can A do the work if he is assisted by B and C on every third day?