/* 💼 TASK Write a program to accept an integer and output whether it's an upward/downward staircase number and print "Not staircase number" if it's not the case. A staircase number have the following pattern:- ✔️ Compose of at least 2 distinct digits (0-9) ✔️ Same digit must be grouped together and occur at least twice Explanation: We need different digit to build the staircase step and if we plot the number as the y-value, we get a flat line with two or more occurences. So by connecting the lines we will get a staircase-like graph. ✔️ Upward if the unique digits are incerasing left-to-right ✔️ Downward if the unique digits are decreasing left-to-right Explanation: I believe this one is pretty self-descriptive. 😉 🔧 TEST CASE 11122333 "Upward staircase number" 11337788 "Upward staircase number" 33221100 "Downward staircase number" 9911 "Downward staircase number" 8080 "Not staircase number" 1234567 "Not staircase number" ❤ BONUS Clear-cut and optimized approach is encouraged.*/ import java.util.*; import java.io.*; public class Program { /* This is the main Function where, a number gets Inserted in String Format and get analyzed to see if its an Upward/Downward StairCase */ public static void main(String[] args) { Scanner scan = new Scanner(System.in); String Num=scan.nextLine(); ArrayList> strList= new ArrayList>(); strList = stringSeparation(Num); if(hasDigits(strList)) if(isUpward(strList)) System.out.println("the number <" + Num + "> is Upward stairCase"); else if(isDownward(strList)) System.out.println("the number <" + Num + "> is Downward stairCase"); else System.out.println("the number <" + Num + "> is not stairCase"); else System.out.println("the number <" + Num + "> is not stairCase"); } /* In stringSeparation the number in String Format gets separated, holding its same digits in an ArrayList inside and ArrayList like this: LIST LIST1 [1][1][1] LIST2 [2][2] LIST3 [3][3][3][3] This is done in order to in order to easily check wether each digit has appeared, at least 2 times, inside the number that was inserted */ public static ArrayList> stringSeparation(String Num) { ArrayList> strList= new ArrayList<>(); strList.add(new ArrayList()); int i, j=0; String[] strCheck = Num.split(""); String str=strCheck[0]; for(i=0;i()); j++; strList.get(j).add(strCheck[i]); } } return strList; } /* In the format mentioned before, hasDigits checks wether the number fullfils the first goal, that of having more than 2 same digits */ public static Boolean hasDigits(ArrayList> List){ int i,j; boolean flagNumOfDig=true; for(i=0;i becomes true, like 1<3<1=>not staircase but 1<3<4=> is staircase */ public static Boolean isUpward(ArrayList> List){ int i,j=0; boolean flagUpward = true; for(i=0;iInteger.parseInt(List.get(i+1).get(j).toString())) flagUpward=false; return flagUpward; } //The next function then checks if the number is and Downward staircase public static Boolean isDownward(ArrayList> List){ int i,j=0; boolean flagUpward = true; for(i=0;i

StrairCase Num