The Fellow Programmer

  Given an array of   n   integers   nums , a   132 pattern   is a subsequence of three integers   nums[i] ,   nums[j]   and   nums[k]   such that   i < j < k   and   nums[i] < nums[k] < nums[j] . Return  true  if there is a  132 pattern  in  nums , otherwise, return  false . Follow up:  The  O(n^2)  is trivial, could you come up with the  O(n logn)  or the  O(n)  solution?   Example 1: Input: nums = [1,2,3,4] Output: false Explanation: There is no 132 pattern in the sequence. Example 2: Input: nums = [3,1,4,2] Output: true Explanation: There is a 132 pattern in the sequence: [1, 4, 2]. Example 3: Input: nums = [-1,3,2,0] Output: true Explanation: There are three 132 patterns in the sequence: [-1, 3, 2], [-1, 3, 0] and [-1, 2, 0].   Constraints: n == nums.length ...

Java Program to print * pattern as follows., INPUT n=5 OUTPUT * ** *** **** ***** CODE import java.util.*; public class Main { public static void main(String[] args) { int i, j, n; System.out.println("Enter the size of n:"); Scanner scan = new Scanner(System.in); n = scan.nextInt(); for(i=1;i<=5;i++){     for(j=1;j<=i;j++){         System.out.print("*");     }     System.out.println();  //Printing Next Line } System.out.println("\n==>>> https://thefellowprogrammer.blogspot.com/ <<<<<=="); } } Here, we are going to solve using two for loops. 1) Get input value of n 2) Outer for loop (i) acts as as variable which controls number of rows to be printed with help of inner loop.  (Eg) If i=2, only two '*' will be printed 3) Inner for loop (j) acts as a variable which number of columns (i.e., *) to be printe...