CODE
1 Alternate sorting:
import [Link].*;
class main{
static void alternatesort(int arr[] , int n ){
[Link](arr);
int i = 0;
int j = n-1;
while(i<j){
[Link](arr[j--] + " ");
[Link](arr[i++] + " ");
}
if (n % 2 !=0)
[Link](arr[i]);
}
public static void main(String[] args){
int arr[] = {1,9,2,4,7,3};
int n = [Link];
alternatesort(arr,n);
}
2 First Occurences:
import [Link].*;
class Main{
public static String subString(String str,int startingIndex, int endingIndex){
String s = "";
for(int i=startingIndex ; i<=endingIndex;i++){
s += [Link](i) + "";
}
return s;
}
public static void main(String[] args){
String s1 = "ZOHOCORPORATION";
String s2 = "PORT";
int min = Integer.MAX_VALUE;
int max = Integer.MIN_VALUE;
int n2 = [Link]();
for(int i=0; i<n2;i++){
int val = [Link]([Link](i) + "");
if(val<=min)
min = val;
if(val>=max)
max = val;
}
[Link](min + " " + max);
[Link](subString(s1,min,max));
}
}
3 Greater On Right Side:
public class GreaterOnRightSide{
static void nextGreatest(int arr[] , int n ){
int max = -1;
int temp = 0;
for(int i=n-1;i>=0;i--){
temp = arr[i];
if(i == n-1){
arr[i] = -1;
max = [Link](max,temp);
continue;
}
arr[i] = max;
max = [Link](max,temp);
}
}
public static void main(String[] args){
int arr[] = {16,17,4,3,5,2};
int n = [Link];
nextGreatest(arr,n);
for(int i = 0;i<n;i++){
[Link](arr[i] + " ");
}
}
}
4 Matrix Diagnol Sum:
public class MatrixDiagonalSum {
public static void main(String[] args) {
int row = 3, col = 3, upperTriangle = 0, lowerTriangle = 0;
int arr[][] = { { 1, 2, 3 }, { 4, 5, 6 }, { 7, 8, 9 } };
for (int i = 0; i < row; i++) {
for (int j = 0; j < col; j++) {
if (j <= col - (i + 1))
upperTriangle += arr[i][j];
if (j >= col - (i + 1))
// [Link](arr[i][j]+" ");
lowerTriangle += arr[i][j];
}
}
[Link](upperTriangle + " " + lowerTriangle);
[Link](upperTriangle > lowerTriangle ? upperTriangle :
lowerTriangle);
}
}
5 Number Staircase:
public class NumberStaircase {
public static void main(String[] args) {
int n = 5,count = 1,flag =1;
for (int i = 1; i <= n; i++) {
count=flag;
for (int j = 1; j <= n; j++) {
count = count>n? count-n:count;
[Link](count + " ");
count++;
}
flag++;
[Link]();
}
}
}
6 NumbericRightAngleTrianglePattern:
import [Link].*;
public class NumbericRightAngleTrianglePattern {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
int n =5;
for(int i=1;i<=n;i++) {
for(int j=i;j<n;j++) {
[Link](" ");
}
for(int j=i;j>=1;j--) {
[Link](j+" ");
}
[Link]();
}
}
}
7 Numeric Pattern:
public class Numericpattern{
public static void main(String[] args){
int n = 6, o = 1, e = 2;
for(int i = 0; i < n;i++){
for(int j = 0; j < n;j++){
[Link](" ");
}
for(int j = 1; j <=i; j++){
if(i%2 == 0){
[Link](e + " ");
e+=2;
}
else{
[Link](o + " ");
o+=2;
}
}
[Link]();
}
}
}
8 XpatternWithWord:
public class XpatternWithWord {
public static void main(String[] args) {
String s = "NISHANT";
int n = [Link]();
for(int i = 1;i <= n; i++) {
for (int j = 1; j <= n; j++) {
[Link](i==j || j==((n+1)-i)?[Link](i-1): " ");
}
[Link]();
}
}
}
9 SnakePattern:
public class SnakePattern {
public static void main(String[] args) {
int n =4, count =1;
for(int i = 1;i <= n; i++) {
for (int j = 1; j <= n; j++) {
[Link](count + " ");
if(i%2 == 0 && j!= n)
count -=1;
else if(i%2!=0 && j!=n)
count +=1;
}
count +=n;
[Link]();
}
}
}