From 4b394fc8af478626873df0bc3b19618f3db7595b Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Wed, 28 Jan 2026 16:28:27 +0530 Subject: [PATCH 01/24] ques1 --- Ishita_q1.c | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 Ishita_q1.c diff --git a/Ishita_q1.c b/Ishita_q1.c new file mode 100644 index 0000000..3a92e0b --- /dev/null +++ b/Ishita_q1.c @@ -0,0 +1,11 @@ +#include +using namespace std; + +int main() +{ + int num = -15; + + if(num == 0){ + cout << "Zero"; + }else (num > 0) ? cout << "Positive": cout << "Negative"; +} From 5f3a40898b293439408419ae30e22a8eed73c714 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Wed, 28 Jan 2026 16:36:05 +0530 Subject: [PATCH 02/24] Create Ishita_q3.c --- Ishita_q3.c | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 Ishita_q3.c diff --git a/Ishita_q3.c b/Ishita_q3.c new file mode 100644 index 0000000..4030979 --- /dev/null +++ b/Ishita_q3.c @@ -0,0 +1,11 @@ +#include +using namespace std; + +int main() { + int n; + cout<<"Enter num: "; + cin>>n; + int sum=n*(n+1)/2; + cout<<"Sum: "< Date: Wed, 28 Jan 2026 16:36:46 +0530 Subject: [PATCH 03/24] ques2 --- Ishita_q2.c | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 Ishita_q2.c diff --git a/Ishita_q2.c b/Ishita_q2.c new file mode 100644 index 0000000..bc03658 --- /dev/null +++ b/Ishita_q2.c @@ -0,0 +1,10 @@ +#include +using namespace std; + +int main() { + int n; + cout<<"Enter num: "; + cin>>n; + (n%2==0) ? cout<<"Even":cout<<"Odd"; + return 0; +} From 2f8b70968681df257305f952163e31e2b23dd223 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Wed, 28 Jan 2026 16:46:40 +0530 Subject: [PATCH 04/24] ques 5 --- Ishita_q5.c | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Ishita_q5.c diff --git a/Ishita_q5.c b/Ishita_q5.c new file mode 100644 index 0000000..1ba00c6 --- /dev/null +++ b/Ishita_q5.c @@ -0,0 +1,18 @@ +#include +using namespace std; + +int calcSum(int a,int b){ + if(b>a>>b; + int sum=calcSum(a,b); + cout< Date: Wed, 28 Jan 2026 16:47:23 +0530 Subject: [PATCH 05/24] ques3,4 --- Ishita_q3.c | 2 ++ 1 file changed, 2 insertions(+) diff --git a/Ishita_q3.c b/Ishita_q3.c index 4030979..7b8146a 100644 --- a/Ishita_q3.c +++ b/Ishita_q3.c @@ -9,3 +9,5 @@ int main() { cout<<"Sum: "< Date: Wed, 28 Jan 2026 16:51:03 +0530 Subject: [PATCH 06/24] ques6 --- Ishita_ques6.c | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 Ishita_ques6.c diff --git a/Ishita_ques6.c b/Ishita_ques6.c new file mode 100644 index 0000000..23ddf26 --- /dev/null +++ b/Ishita_ques6.c @@ -0,0 +1,12 @@ +#include +#include +using namespace std; + +int main() { + int a,b; + cout<<"Enter num: "; + cin>>a>>b; + int largest = max(a,b); + cout< Date: Wed, 28 Jan 2026 16:53:51 +0530 Subject: [PATCH 07/24] Rename Ishita_ques6.c to Ishita_q6.c --- Ishita_ques6.c => Ishita_q6.c | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Ishita_ques6.c => Ishita_q6.c (100%) diff --git a/Ishita_ques6.c b/Ishita_q6.c similarity index 100% rename from Ishita_ques6.c rename to Ishita_q6.c From 5024db1ddc629377fe03021c7f204442c9a49d61 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Wed, 28 Jan 2026 16:54:24 +0530 Subject: [PATCH 08/24] ques7 --- Ishita_q7.c | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 Ishita_q7.c diff --git a/Ishita_q7.c b/Ishita_q7.c new file mode 100644 index 0000000..7e50711 --- /dev/null +++ b/Ishita_q7.c @@ -0,0 +1,12 @@ +#include +#include +using namespace std; + +int main() { + int a,b,c; + cout<<"Enter num: "; + cin>>a>>b>>c; + int largest = max(a,max(b,c)); + cout<<"Largest num: "< Date: Wed, 28 Jan 2026 16:58:22 +0530 Subject: [PATCH 09/24] ques8 --- Ishita_q8.c | 11 +++++++++++ 1 file changed, 11 insertions(+) create mode 100644 Ishita_q8.c diff --git a/Ishita_q8.c b/Ishita_q8.c new file mode 100644 index 0000000..cf9f038 --- /dev/null +++ b/Ishita_q8.c @@ -0,0 +1,11 @@ +#include +#include +using namespace std; + +int main() { + int year; + cout<<"Enter num: "; + cin>>year; + (year%400 == 0 || (year%4==0 && year%100!=0)) ? cout<<"Leap year" : cout<<"Not leap year"; + return 0; +} From 47e32e43a4b22f68507eafd2e8a217379c130cef Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Wed, 28 Jan 2026 17:08:08 +0530 Subject: [PATCH 10/24] ques9 Prime num check --- Ishita_q9.c | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 Ishita_q9.c diff --git a/Ishita_q9.c b/Ishita_q9.c new file mode 100644 index 0000000..cd41645 --- /dev/null +++ b/Ishita_q9.c @@ -0,0 +1,23 @@ +#include +#include +using namespace std; + +int main() { + int i,n; + cout<<"Enter num: "; + cin>>n; + bool check = true; + if(n<2){ + check = false; + }else{ + for(int i=2;i Date: Wed, 28 Jan 2026 17:16:46 +0530 Subject: [PATCH 11/24] ques10 Print prime num in ranges --- Ishita_q10.c | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 Ishita_q10.c diff --git a/Ishita_q10.c b/Ishita_q10.c new file mode 100644 index 0000000..a6c2e89 --- /dev/null +++ b/Ishita_q10.c @@ -0,0 +1,28 @@ +#include +#include +using namespace std; + +bool checkPrime(int n){ + if(n<2){ + return false; + }else{ + for(int i=2;i>st>>end; + for(int i=st;i<=end;i++){ + if(checkPrime(i)){ + cout< Date: Thu, 29 Jan 2026 09:37:15 +0530 Subject: [PATCH 12/24] ques11 Sum of digits --- Ishita_q11.c | 18 ++++++++++++++++++ 1 file changed, 18 insertions(+) create mode 100644 Ishita_q11.c diff --git a/Ishita_q11.c b/Ishita_q11.c new file mode 100644 index 0000000..dbcad77 --- /dev/null +++ b/Ishita_q11.c @@ -0,0 +1,18 @@ +#include +using namespace std; + +int getSum(int num, int sum){ + if(num==0) return sum; + sum+=(num%10); + return getSum(num/10,sum); +} + +int main () +{ + int num, sum = 0; + cout<<"Enter number: "; + cin>>num; + cout <<"Sum of digits : " << getSum(num, sum); + + return 0; +} From 93042ee14c8104889cca85935fb6a77731233ab0 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Thu, 29 Jan 2026 09:53:09 +0530 Subject: [PATCH 13/24] ques12 palindrome check of string --- Ishita_q12.c | 35 +++++++++++++++++++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 Ishita_q12.c diff --git a/Ishita_q12.c b/Ishita_q12.c new file mode 100644 index 0000000..07dc8d8 --- /dev/null +++ b/Ishita_q12.c @@ -0,0 +1,35 @@ +#include +#include +using namespace std; + +void lower(char str[]){ + int i = 0; + while (str[i] != '\0'){ + str[i] = tolower(str[i]); + i++; + } +} +int main() +{ + char str[10] = "Radar"; + int i, len, flag = 0; + + lower(str); + + len = strlen(str); + + for (i = 0; i < len / 2; i++) + { + if (str[i] != str[len - i - 1]){ + flag++; + break; + } + } + + if (flag) + cout << str << " is not palindrome"; + else + cout << str << " is palindrome"; + + return 0; +} From 1694f254ac8bc221182173bf3c7f2dd86975267b Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Fri, 30 Jan 2026 17:55:24 +0530 Subject: [PATCH 14/24] Update Ishita_q12.c --- Ishita_q12.c | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/Ishita_q12.c b/Ishita_q12.c index 07dc8d8..88950de 100644 --- a/Ishita_q12.c +++ b/Ishita_q12.c @@ -11,7 +11,8 @@ void lower(char str[]){ } int main() { - char str[10] = "Radar"; + string str; + cin>>str; int i, len, flag = 0; lower(str); From 66745efe90a71c5892858d32e79f717f9e03bd89 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Fri, 30 Jan 2026 18:08:13 +0530 Subject: [PATCH 15/24] armstrong num --- Ishita_q13.c | 40 ++++++++++++++++++++++++++++++++++++++++ 1 file changed, 40 insertions(+) create mode 100644 Ishita_q13.c diff --git a/Ishita_q13.c b/Ishita_q13.c new file mode 100644 index 0000000..ce87e61 --- /dev/null +++ b/Ishita_q13.c @@ -0,0 +1,40 @@ +#include +#include +using namespace std; + +int power(int x){ + int len = 0; + while (x){ + len++; + x = x/10; + } + return len; +} + +void armstrong(int st,int end){ + + for(int num = st; num <= end; num++){ + + int sum = 0, temp, len; + temp = num; + + len = power(num); + + while(temp != 0){ + int digit = temp % 10; + sum = sum + pow(digit,len);; + temp /= 10; + }; + + if(sum == num) cout << num << " "; + } +} + +int main (){ + int st,end; + cout<<"Enter ranges:"; + cin>>st>>end; + armstrong(st,end); + + return 0; +} From 19f9fd2bac0c7db5b8947c8afaf0d10ac7021f1e Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Fri, 30 Jan 2026 18:13:11 +0530 Subject: [PATCH 16/24] Create Ishita_q15.c --- Ishita_q15.c | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Ishita_q15.c diff --git a/Ishita_q15.c b/Ishita_q15.c new file mode 100644 index 0000000..9a29ec6 --- /dev/null +++ b/Ishita_q15.c @@ -0,0 +1,17 @@ +#include +using namespace std; + +int fibo(int num){ + if (num <= 1){ + return num; + } + return fibo(num-1) + fibo(num-2); +} + +int main (){ + int n; + cout<<"Enter num: "; + cin>>n; + cout << fibo(n); + return 0; +} From f87d7b7c9b983a760e52bafcb199359a0ddc911c Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Fri, 30 Jan 2026 18:13:51 +0530 Subject: [PATCH 17/24] fibonnacci --- Ishita_q15.c | 1 + 1 file changed, 1 insertion(+) diff --git a/Ishita_q15.c b/Ishita_q15.c index 9a29ec6..0357ac5 100644 --- a/Ishita_q15.c +++ b/Ishita_q15.c @@ -6,6 +6,7 @@ int fibo(int num){ return num; } return fibo(num-1) + fibo(num-2); + } int main (){ From f5a1cece18b23a5b34efd59aea26b374afb9c788 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Fri, 30 Jan 2026 18:16:51 +0530 Subject: [PATCH 18/24] fibonacci till n --- Ishita_q14.c | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Ishita_q14.c diff --git a/Ishita_q14.c b/Ishita_q14.c new file mode 100644 index 0000000..9ef9bc9 --- /dev/null +++ b/Ishita_q14.c @@ -0,0 +1,17 @@ +#include +using namespace std; + +int fibo(int num){ + if (num <= 1){ + return num; + } + return fibo(num-1) + fibo(num-2); +} + +int main (){ + int n; + cout<<"Enter num: "; + cin>>n; + for(int i = 0; i < n; i++) + cout << fibo(i) << ", "; +} From 43efeb1ca6fa7f0a087c563bbd3aa77629a4d1c5 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Sat, 31 Jan 2026 14:51:47 +0530 Subject: [PATCH 19/24] factorial num --- Ishita_q16.java | 17 +++++++++++++++++ 1 file changed, 17 insertions(+) create mode 100644 Ishita_q16.java diff --git a/Ishita_q16.java b/Ishita_q16.java new file mode 100644 index 0000000..14788bd --- /dev/null +++ b/Ishita_q16.java @@ -0,0 +1,17 @@ +import java.util.Scanner; + +public class Main { + + static int fact(int num){ + if(num==0){ + return 1; + } + return num*fact(num-1); + } + public static void main(String[] args) { + Scanner sc = new Scanner(System.in); + int a = sc.nextInt(); + int fct = fact(a); + System.out.println("Fact: "+fct); + } +} From 38e677bd76458af1e2234305adabb0f2439ce11f Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Sat, 31 Jan 2026 14:55:35 +0530 Subject: [PATCH 20/24] Create Ishita_q17.java --- Ishita_q17.java | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 Ishita_q17.java diff --git a/Ishita_q17.java b/Ishita_q17.java new file mode 100644 index 0000000..03e9ad2 --- /dev/null +++ b/Ishita_q17.java @@ -0,0 +1,12 @@ +import java.util.Scanner; + +public class Main { + + public static void main(String[] args) { + Scanner sc = new Scanner(System.in); + int base = sc.nextInt(); + double exp = sc.nextDouble(); + double res1 = Math.pow(base, exp); + System.out.println(base + " ^ " + exp + " = " + res1 ); + } +} From 5788baaa73edec250988cca1e5aa09435e5752eb Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Sun, 1 Feb 2026 17:52:44 +0530 Subject: [PATCH 21/24] factors on num --- Ishita_q18.java | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 Ishita_q18.java diff --git a/Ishita_q18.java b/Ishita_q18.java new file mode 100644 index 0000000..e546298 --- /dev/null +++ b/Ishita_q18.java @@ -0,0 +1,25 @@ +import java.util.Scanner; + +class Main{ + + static void getFact(int n) + { + for(int i = 1; i <= Math.sqrt(n); ++i) + { + if (n % i == 0){ + if(i == n / i) + System.out.print(i + ", "); + else + System.out.print(i + ", " + n/i + ", "); + } + } + } + + public static void main(String[] args){ + + Scanner sc = new Scanner(System.in); + int a = sc.nextInt(); + getFact(a); + } + +} From 5a85e9cbda5506d5781232e4a542ab1c9de0851d Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Sun, 1 Feb 2026 18:01:41 +0530 Subject: [PATCH 22/24] Create Ishita_q19.java --- Ishita_q19.java | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) create mode 100644 Ishita_q19.java diff --git a/Ishita_q19.java b/Ishita_q19.java new file mode 100644 index 0000000..56a38c0 --- /dev/null +++ b/Ishita_q19.java @@ -0,0 +1,26 @@ +import java.util.Scanner; + +class Main { + static void getPrimeF(int n) { + while (n % 2 == 0) { + System.out.print(2 + " "); + n /= 2; + } + + for (int i = 3; i <= Math.sqrt(n); i += 2) { + while (n % i == 0) { + System.out.print(i + " "); + n /= i; + } + } + if (n > 2) { + System.out.print(n); + } + } + + public static void main(String[] args) { + Scanner sc = new Scanner(System.in); + int a = sc.nextInt(); + getPrimeF(a); + } +} From acfc653a7ac335ceecbc135232a361a2f002f781 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Sun, 1 Feb 2026 18:03:17 +0530 Subject: [PATCH 23/24] prime factors of num good concept , check once --- Ishita_q19.java | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Ishita_q19.java b/Ishita_q19.java index 56a38c0..6cd885c 100644 --- a/Ishita_q19.java +++ b/Ishita_q19.java @@ -3,7 +3,7 @@ class Main { static void getPrimeF(int n) { while (n % 2 == 0) { - System.out.print(2 + " "); + System.out.print(2 + " "); n /= 2; } From f599a9769889f5eeefdd2f068b90443a1cc455f9 Mon Sep 17 00:00:00 2001 From: Ishita Jain <216325024+ishitaajain22-tech@users.noreply.github.com> Date: Mon, 2 Feb 2026 20:54:23 +0530 Subject: [PATCH 24/24] Create Ishita_q20.java --- Ishita_q20.java | 34 ++++++++++++++++++++++++++++++++++ 1 file changed, 34 insertions(+) create mode 100644 Ishita_q20.java diff --git a/Ishita_q20.java b/Ishita_q20.java new file mode 100644 index 0000000..7f92036 --- /dev/null +++ b/Ishita_q20.java @@ -0,0 +1,34 @@ +import java.util.Scanner; + +class Main { + static int fact(int num){ + if(num == 0){ + return 1; + } + return num * fact(num-1); + } + static boolean detectStrong (int num) + { + + int digit, sum = 0; + int temp = num; + + while(temp!=0){ + digit = temp % 10; + + sum = sum + fact(digit); + temp /= 10; + } + + return sum == num; + + } + public static void main(String[] args) { + Scanner sc = new Scanner(System.in); + int num =sc.nextInt(); + if (detectStrong(num)) + System.out.println (num + " is Strong Number"); + else + System.out.println (num + " is not a Strong Number"); + } +}