From 7640cd00c6c863d314fb44631dbc75b5a91b232f Mon Sep 17 00:00:00 2001
From: masumrazait <masumrazait@gmail.com>
Date: Sat, 28 Feb 2026 23:52:53 +0530
Subject: [PATCH 1/4] added new code

---
 src/test/java/March/DuplicateWordFinder.java  |  18 ++++++++++++++++++
 .../java/March/EvenLetterPrintFromString.java |  12 ++++++++++++
 .../March/DuplicateWordFinder.class           | Bin 0 -> 1365 bytes
 .../March/EvenLetterPrintFromString.class     | Bin 0 -> 1018 bytes
 4 files changed, 30 insertions(+)
 create mode 100644 src/test/java/March/DuplicateWordFinder.java
 create mode 100644 src/test/java/March/EvenLetterPrintFromString.java
 create mode 100644 target/test-classes/March/DuplicateWordFinder.class
 create mode 100644 target/test-classes/March/EvenLetterPrintFromString.class

diff --git a/src/test/java/March/DuplicateWordFinder.java b/src/test/java/March/DuplicateWordFinder.java
new file mode 100644
index 0000000..cd67624
--- /dev/null
+++ b/src/test/java/March/DuplicateWordFinder.java
@@ -0,0 +1,18 @@
+package March;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class DuplicateWordFinder {
+	public static void main(String[] args) {
+		String str = "masum raza delhi patna bihar delhi amnour delhi patn";
+		String words[] = str.split(" ");
+		Set<String> uniq = new HashSet<String>();
+		for (String word : words) {
+			uniq.add(word.trim());
+		}
+		for (String word : uniq) {
+			System.out.println(word);
+		}
+	}
+}
diff --git a/src/test/java/March/EvenLetterPrintFromString.java b/src/test/java/March/EvenLetterPrintFromString.java
new file mode 100644
index 0000000..730ec64
--- /dev/null
+++ b/src/test/java/March/EvenLetterPrintFromString.java
@@ -0,0 +1,12 @@
+package March;
+
+public class EvenLetterPrintFromString {
+	public static void main(String[] args) {
+		String str = "masumraza delhi";
+		for (int i = 1; i <= str.length() - 1; i++) {
+			if (i % 2 == 0) {
+				System.out.print(str.charAt(i)+" ");
+			}
+		}
+	}
+}
diff --git a/target/test-classes/March/DuplicateWordFinder.class b/target/test-classes/March/DuplicateWordFinder.class
new file mode 100644
index 0000000000000000000000000000000000000000..b7444da899bfc460f307717bff577c3a42f97452
GIT binary patch
literal 1365
zcmZ`(OH<QO6#i~Wn^J;6A!2<NP-s!CBBHj4FGSG-&Xj=x++5m7gKb*V)YsZy;m(z7
zUFe`Qj%)vi{tWTEX%Rc%=A7K~{LU*set-D}U;>Le0s^sl>E?^6nR>Nk=cQ+@RNTU>
z?G!9mhbGXyC7;VwNjjUU#f>d1?+JvaY{&Md1=<qHWdZF@rC>$ShIRu%gao>>wqq^S
z%Nv%vBsWTyKr~y)%hIxRZS`&nHLqyb1de6@3n0VbWobJChZF1BJs>&HwVlmOayg71
zfr+xL)yr{LzLxQVRVv!?s`MNg->{3)ZAxU>snmBLN*zY8fQUz6qF=}1mO2~Z4IDvC
zAXsBxSoBEZ000Mo(s4|n$H!Xt>{9B!tQB*X7r{}qt86C?oI;$1v4*lhUn03bZU+W&
zTE~z;=UyNNF>nUMY`ZKJ1k8T{HAa(3t|`}qfh0x+!nS9*(yO?tf6X*Lrn#m((}8n1
zuVai8+Do*nHITvu0(GpHtiKg#GhaK#F`?s9Yx`c+JgaQrGA4<&Qm3=osL`&Z9&vIW
z8*IsPCW5O->$oP+>t}CO8^~ZvK(8u~5_h1b;J+)NN|-iq12<_~l(hvPEjM$G(51V{
z4eLE%Ohi`m*qG@4?sMiZcms6Q>W=+P?eku9I0dzp%79&MUF%oX-PImy^_be9WSUVr
zbDqpUotIVrAavXoh~&7Yd27~IS99cmn>??eU;xC=8wLXW;?a@ne5J?*d2sYI!XJEf
zgjA^&?I1N82IQT5wc`-FD50|$XRt73Pomw~v(e}$^v!?8(bdm5zHn|et$&*gwM_=!
zBNo%m;CNaai)o*5VjBYith@;dGiZk1?fe?s#)v?gcKxy7HqHushndzs;-WIYqGZ<v
z-tPQV=rkyFqdpC*9|*r9h!W>8@r{#D5nql7*U2sP_!UgE5~9Q{+$L{B9(ORq8X|a%
zyOaeOVF|OiN1cjupIVJk!p*NadZ{intRB$nAte*gc6ga#9a$ZwPX{3cKLB%wsY5Lq
Pook0)MwzE?01JNrA@MgV

literal 0
HcmV?d00001

diff --git a/target/test-classes/March/EvenLetterPrintFromString.class b/target/test-classes/March/EvenLetterPrintFromString.class
new file mode 100644
index 0000000000000000000000000000000000000000..54c9cb2ffa7c59ad98492954ebc82b51305b1db7
GIT binary patch
literal 1018
zcmah{S#J_i6#gy@4AAK!bhE`4>ITJj)YjTc7h7VJCe)f>NQ_SxxWd#~$S^~q&;API
zqlwS@K#eB;0AKw*F6RP?X~Fn#_jA7G-1Gg{mu~>pQBV<JSUl!#wV^+13%e*hPq<H9
z!}bnc$0~WWtE*5LCQf;q>n6AB`bp(fR6U09wqYCIE<-SrEi)(urzT<uBB~*TFvED!
zu*GBFstETfub6@%UUaJ5EOXb8=l-SQHH;QRy7(U%d7`kmVKYo;o)`bh>50r|%Mn~6
zQj52I%jK_mswT{a5k&%1Dkjf4D7|WV!qPB}8B*`~WM-;|XgGS;J%I{t<yBl}n7PPx
z;2UO5xG~J*ii+fU=x)h0EMSo;RBdo~pU{=eQMMrC(;Aj=l|gND(-$W%h&WTo4!Vh9
z7T0ARZ^($jcj-36z)~`BSwjxDh>ka#!mcr_49ge*>D$Olh*b?bZZkwYr&mvg$;?n)
zcd@QwjUmyk%K3U}xF-dNnzDhU-TN9gu|>*EVb{Gzw^fd)9NewbmnVjNBZag)SGLN<
zs?+~7g9hb~mONg4dCZ&r7K)V|->r&6LpIsMKO1>fLLv>~p!Np>w4+X?S*4RsE2A~E
ze1^!!?sJT0`3y=Jp;_w%&^k(|D8?{OH!}Gh0ZGuU_(W0J`G9OP)O?H7C&a&E_E|33
z!Q5x0&TuV$vx960D;?Z<6JW_)2OCQ5{qG-=FbGLFN0g+3PGLj{e2nHC?Keq+6p`u?
n;Q{j9oDFPahh&7XhF$EDtA}(yg5Xa?RLrv_X>*^h0yy{s?$_u#

literal 0
HcmV?d00001


From 27fc09e69910abff95b4ac5ca112801245642cee Mon Sep 17 00:00:00 2001
From: masumrazait <masumrazait@gmail.com>
Date: Sun, 1 Mar 2026 00:14:04 +0530
Subject: [PATCH 2/4] added new code

---
 .../java/March/EvenLetterPrintFromString.java |  23 ++++++++++++------
 .../March/EvenLetterPrintFromString.class     | Bin 1018 -> 1125 bytes
 2 files changed, 15 insertions(+), 8 deletions(-)

diff --git a/src/test/java/March/EvenLetterPrintFromString.java b/src/test/java/March/EvenLetterPrintFromString.java
index 730ec64..0f3ab98 100644
--- a/src/test/java/March/EvenLetterPrintFromString.java
+++ b/src/test/java/March/EvenLetterPrintFromString.java
@@ -1,12 +1,19 @@
 package March;
 
 public class EvenLetterPrintFromString {
-	public static void main(String[] args) {
-		String str = "masumraza delhi";
-		for (int i = 1; i <= str.length() - 1; i++) {
-			if (i % 2 == 0) {
-				System.out.print(str.charAt(i)+" ");
-			}
-		}
-	}
+    public static void main(String[] args) {
+        String str = "masumrazadelhi";
+
+        // Remove spaces completely
+        str = str.replace(" ", "");
+
+        // Now count only characters
+        for (int i = 0; i < str.length(); i++) {
+            if (i % 2 == 0) { // even position among letters
+                System.out.print(str.charAt(i) + " ");
+            }
+        }
+    }
 }
+
+//m s m a a e h 
\ No newline at end of file
diff --git a/target/test-classes/March/EvenLetterPrintFromString.class b/target/test-classes/March/EvenLetterPrintFromString.class
index 54c9cb2ffa7c59ad98492954ebc82b51305b1db7..495cc765550f1edeca1c287c6c95753eb4332ec7 100644
GIT binary patch
delta 513
zcmZ{hy>8P`9L0Zso7BcJRq7Jlf@y;ZkPzAwQa(dyOWH!ENFZfmw1U;9O45)fNM)&z
zcmd>%jj0m@3<iP3127`N3m{$siI1Bsu&|uroO{nX_uL=Gchmax>-|Syk&Wlp=j?bp
z*d4Tc!IR)&*xG8EObU`QNefuGOdCu^_awc4oD+i43%jkL5eloh+IH|bD7J#mX0f^z
z^y=ZGLD*@8<^S>de}sC!*X(ST4|9@PgBc<9*Q~y`+Yj3|8BPiM&Y&-(Yuk}4X*nIu
ziRZhVu{p~*VXUEoSJZ(+xs7~vST}ETo<j6gvZl|RO@jI8l}uR{J_|M%xfFesveFi9
zE^{TC*0QB*+%UK<OpZD<cZ&B_xxT6x2C7Dxc_GmqQp13X%`KLquJ&#JK)LH`$z>;1
zD>#mGH0D@MuN;u~65SVM-r#+}e^BsZvhT>f<$~kH6k|#;SD$I(6=H6_{Qc#%^3c`T
zFoU6R=xSn<WJ00K5%pI|mPjc?%`(blxx~uoVujmO5ysW)R#`)1UGYiupG+9I;%iF0
JqbQBLe*kwdXlMWc

delta 397
zcmXAk!D<s>6otQklFW>g!Ajcbm`v;#qs?^Gm?n*hv9&cTp$kC}T>jXSq$DxMDCowG
z8<%!=;!+UY)x{_ZK7gxIAE6X{hC*Bav|Kn`&f%PM@4k6pSbvUw{syYFK3KcXRA0V$
z*&oR_(p%r?b-HJmCT%biJ{RfOc`k(Sg(ohCUxlk@$r-p?BAvU$tU!O-k)zeIAYOdn
zw=A+;w#joP{3i-!hpRRTt_jk`wN3d-mU?o~E<GBLx`TGpe{50|2+zV{-X`FBSks!O
z!%dqKx5C$2p|U{Lpdy$)v3H-99xCrxC2YvP&Eh0GF`Q77>f1JT8sUz%_x6+Ojj0D4
zsdH=br7!qyV)zm78>wG7PXae0^8@cYh16VxA8{k1{7w^Y5K)V-e?I=Zt;{hjg&A~(
zlQ<m{gR=?)wbx0i0q?YkJ2X!`HSSVeLLEkhW$vM|qJ$)|LrjCL$ZJYmRg}j4{}@|H
AtN;K2


From cb5a3d54c1ca69282b315b0dfe9fd9f0b1e30f51 Mon Sep 17 00:00:00 2001
From: masumrazait <masumrazait@gmail.com>
Date: Sun, 1 Mar 2026 00:28:25 +0530
Subject: [PATCH 3/4] added new code with Logic explanation

---
 src/test/java/March/SumOfNumber.java          |  17 ++++++
 .../FindTheDuplicateNumber.java               |  50 ++++++++++++++++++
 .../codeWithLogicExplanation/SumOfNumber.java |  24 +++++++++
 .../interviewPractice2026/pom.properties      |   2 +-
 target/test-classes/March/SumOfNumber.class   | Bin 0 -> 655 bytes
 .../FindTheDuplicateNumber.class              | Bin 0 -> 1903 bytes
 .../SumOfNumber.class                         | Bin 0 -> 695 bytes
 7 files changed, 92 insertions(+), 1 deletion(-)
 create mode 100644 src/test/java/March/SumOfNumber.java
 create mode 100644 src/test/java/codeWithLogicExplanation/FindTheDuplicateNumber.java
 create mode 100644 src/test/java/codeWithLogicExplanation/SumOfNumber.java
 create mode 100644 target/test-classes/March/SumOfNumber.class
 create mode 100644 target/test-classes/codeWithLogicExplanation/FindTheDuplicateNumber.class
 create mode 100644 target/test-classes/codeWithLogicExplanation/SumOfNumber.class

diff --git a/src/test/java/March/SumOfNumber.java b/src/test/java/March/SumOfNumber.java
new file mode 100644
index 0000000..7b66574
--- /dev/null
+++ b/src/test/java/March/SumOfNumber.java
@@ -0,0 +1,17 @@
+package March;
+
+public class SumOfNumber {
+	public static void main(String[] args) {
+		int num = 00;
+		while (num >= 10) {
+			int sum = 0;
+			while (num > 0) {
+				sum += num % 10;
+				num = num / 10;
+			}
+			num = sum;
+		}
+		System.out.println(num);
+	}
+
+}
diff --git a/src/test/java/codeWithLogicExplanation/FindTheDuplicateNumber.java b/src/test/java/codeWithLogicExplanation/FindTheDuplicateNumber.java
new file mode 100644
index 0000000..63ae404
--- /dev/null
+++ b/src/test/java/codeWithLogicExplanation/FindTheDuplicateNumber.java
@@ -0,0 +1,50 @@
+package codeWithLogicExplanation;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class FindTheDuplicateNumber {
+
+	public static void main(String[] args) {
+
+		// Integer array with some duplicate values (747 appears multiple times)
+		int ar[] = { 133, 2, 134, 53554, 747, 747, 43634, 747, 86, 346 };
+
+		// Input string converted to lowercase for uniform comparison
+		String input = "India Delhi".toLowerCase();
+
+		// Set to store duplicate numbers
+		Set<Integer> duplicate = new HashSet<>();
+
+		// Set to store unique numbers
+		Set<Integer> uniq = new HashSet<>();
+
+		// Loop through each number in the array
+		for (int num : ar) {
+			// If adding to uniq fails (already exists), add to duplicate
+			if (!uniq.add(num)) {
+				duplicate.add(num);
+			}
+		}
+
+		// Print duplicate numbers
+		System.out.println("duplicate number is : " + duplicate);
+
+		// Set to store unique characters
+		Set<Character> uniqs = new HashSet<>();
+
+		// Set to store duplicate characters
+		Set<Character> duplicates = new HashSet<>();
+
+		// Loop through each character in the string
+		for (char c : input.toCharArray()) {
+			// If adding to uniqs fails (already exists), add to duplicates
+			if (!uniqs.add(c)) {
+				duplicates.add(c);
+			}
+		}
+
+		// Print duplicate characters
+		System.out.println("duplicate charater is : " + duplicates);
+	}
+}
\ No newline at end of file
diff --git a/src/test/java/codeWithLogicExplanation/SumOfNumber.java b/src/test/java/codeWithLogicExplanation/SumOfNumber.java
new file mode 100644
index 0000000..1507dac
--- /dev/null
+++ b/src/test/java/codeWithLogicExplanation/SumOfNumber.java
@@ -0,0 +1,24 @@
+package codeWithLogicExplanation; // Declares the package name (March). Helps organize classes.
+
+public class SumOfNumber { // Defines the class SumOfNumber
+	public static void main(String[] args) { // Main method: program entry point
+		int num = 9876; // Initialize the number you want to process (example: 9876)
+
+		// Outer loop: keep running until num becomes a single digit (<= 9)
+		while (num > 9) {
+			int sum = 0; // Reset sum for this iteration
+
+			// Inner loop: calculate sum of digits of num
+			while (num > 0) {
+				sum += num % 10; // Add last digit to sum
+				num = num / 10; // Remove last digit from num
+			}
+
+			// After summing digits, assign sum back to num
+			num = sum;
+		}
+
+		// Print the final single-digit result
+		System.out.println(num);
+	}
+}
\ No newline at end of file
diff --git a/target/classes/META-INF/maven/com.interviewPractice2026/interviewPractice2026/pom.properties b/target/classes/META-INF/maven/com.interviewPractice2026/interviewPractice2026/pom.properties
index ca7da1e..42fc131 100644
--- a/target/classes/META-INF/maven/com.interviewPractice2026/interviewPractice2026/pom.properties
+++ b/target/classes/META-INF/maven/com.interviewPractice2026/interviewPractice2026/pom.properties
@@ -1,5 +1,5 @@
 #Generated by Maven Integration for Eclipse
-#Sat Feb 28 11:30:55 IST 2026
+#Sun Mar 01 00:25:16 IST 2026
 artifactId=interviewPractice2026
 groupId=com.interviewPractice2026
 m2e.projectLocation=D\:\\My_Project\\Testing_Project\\interviewPractice2026
diff --git a/target/test-classes/March/SumOfNumber.class b/target/test-classes/March/SumOfNumber.class
new file mode 100644
index 0000000000000000000000000000000000000000..84217de83a6edffb47fd5f91943dfc90c5212d67
GIT binary patch
literal 655
zcmZuv%T5zf82(OY+Mz?C<<g366;T&03ueQv#f^yxNfDDV-MH~|7|X%AG}9RqABGJv
zVXX^ESoi=w2rt0S5aByh5+IsM{_|hXcbR|Y_uunh0JibcLP20@PbS`><7VOhr?*)+
z@)HZDK<!9=kxn3^v9muq^1W1`)K`&8UkMnU?ohyd9Uu5M43sM<q9jlqsK}pDyqBZE
z7g!#|o(zUEQM$fun(3jM3akwN5$=&RlqwQvbUqC347h2cqH(V~EMo~P7M35_bH7eg
zKdfLCby|xvI<3#ZDt6uxnG)~IuxH~D9$Q$WcFz59TtO2p0c)ZW0X>+V-TXCWGS+tg
zV~BE577B=6W>cLlxT*9$@5#ySyV`D?C7%CA>21{R?RZN&zy=89w*U&vxI{*amBUl;
zEN-4*?t4DA8TA+h%rjPI7kDnPDq|5<b~N}KZ)nm@qkoE~v2%)QyH&F%A9omoe(U)9
zvfXETa((dwwboBGw1NSxu$6NcX{SUx7N0rx_1bMTm^Z1{=IlB3x>VFop3T(Qf5NJO
h4xVB?_fqF<ot+K#7hztZD6aT#&Ho{{AcwyF;s%s+fV}_!

literal 0
HcmV?d00001

diff --git a/target/test-classes/codeWithLogicExplanation/FindTheDuplicateNumber.class b/target/test-classes/codeWithLogicExplanation/FindTheDuplicateNumber.class
new file mode 100644
index 0000000000000000000000000000000000000000..0d084c072b8e9023f9b99f6faadea48d397f9337
GIT binary patch
literal 1903
zcmb7E%~M-d6#w0Pyqi3NB!O3&Qf-Q~CQyh}j7qSUhGNk`P$>AIMK8%Kd2M)!kC!U0
zYuB#bbz^7TIJyXE9b7u&jN`b`o&P}BZpCx+MM81mOmg2n_nz}RAHQ?YFaP{-0AK=l
zI9v>gTq$p?noc28+A?$3KP?x9B^<M4C1y=4zg#e8D&?Y?6OOS^+1@m44i7`{uDCA}
zq`8&IZr(L=4udjfTBdV_!5xdQFnH1gtHKR`0A45zJsHz#KrD;RqQMZ(lyaiDB5YI2
zjYE%9Fn1WnGygNJ6uI0Mrp0h7ww^f(Z^^MuYbzCBaRa|!rsZqfhhB!RIV*39=!{V;
zm?|{%bDZkPt8N&;X+%idDP>BZ7<O9hP~d&B__H231{gv$#}&scCT@tG!jj>rI0L_m
z7ZBw**How#Zq9OyEyE7rJO&x~eNn6!**h}+xpw%5TB-{}xX5vVq5H@QISAk-#Hi{b
zpJ&iwZGqL9NyXRv7{(=zk<R>fcN}9ofKiN*b*VxWYIS3?lvt#qIaC2dY^OM0X6Qd&
z(Q6g6m^Y}Fmnq_Wvqhp-tw*BfPINM=B7q6X{;S6VYjGkqUJKxLyg~gV%4Nf%97a#d
zp)IYtb;Ey3LZkwik}Ub0QvFiJ6<p<bi=np`cV|WcOv{jXStePuB>U+AW^ld6bGjhx
zY1<aN)KIbbdRoQXnB%z7#Hw*8l|;^|v-b|e=~%j*v(|OWhYZ~w)h8zn$*x`@av|(3
zYWLm~T9&~jY+Bam7`&!cmJEfTsRQ-BzXdN}Sx0loS5dLdkBMPohJi^ec|bnZmKg~w
zNB=ZY+4&}S%guK=)CoM*7D%&0uaLKk|E+dZ6sg#~<cQq8c~P#tdyWN;MGlI>wN7EE
zOQnjPGiFUWCk9R)L}M~jdOVaHjWfVSJDN1Ka*`7CW%Tt9@4@$N?OLT(Udy$M)<9i>
zzTG7G@f>>Sgp6I&@JJ2T9aMi*b$1A#XLXM^t9wIunAMeVFst*B>uFZ^)z+XA4rTRV
z{V3=Qu8`mlv9)X_9Im2o{t3?LdpNt$_)dC8^hw`AlDm`2W5gmpO&LpiBOcAWkLSO~
zi!OYLp3x&|^?|}PMdObS|NIW|CrIew@jbjUT1B#o$tvD#;(D7K<x&;b^hxy~>31i6
zj}ecknr|Y>BVLW~W47TV7$MN6xcb1yG@s^wbofWp$-CqvqO`ooB6=W;IExUiUARgm
zllukqVHN$jhX_8SdH0a^U*H_R!XUoE1?(e+-)IK?g%LcZ{ogcE0vNB6aEl60g~mLg
zfDnI07K=o~EPlp&c%N8Zz)x7hGO@ghDsIxwL!Jh(Lb8|eH}C<SdCAL7=(JPF*IBG#
zov6G;n8T!B$GF|XxJ_qu%Z--h23dYc`ZG`tk%yn-BM!l#aSYK9jFAYOcOBAn={k1X
Prn3nQ%3jP9mJ7ze&?Li8

literal 0
HcmV?d00001

diff --git a/target/test-classes/codeWithLogicExplanation/SumOfNumber.class b/target/test-classes/codeWithLogicExplanation/SumOfNumber.class
new file mode 100644
index 0000000000000000000000000000000000000000..766ea6d50cb2bc2d5d2fb7dc3f86e578ce15e70b
GIT binary patch
literal 695
zcma)4O>fgc5Ph3Cb)C9RnvhWHKq*933aGhoOUea-RLM{zqj2bjjWOvKe?*Rr;D2!C
zghbD90Eq)XfFHsi;D##7Tc;9K;(#p8&dl34^Jcu?etr20;5ND@N&;O!c@{iT*`b?E
zlz;ElG?cN-R1){SJlcQ$FptJTYQhkxAIX=pPk7SbA0GvNCa^G6vC8fUlzZDF0pl)f
zRZ)gzqk;v2nycbqUgEJFhk-!DO?(-SWU6$0mNc?MH51r!|3}M!eIlu1fp+h}{iDgt
zQWZ}I+an9BXqsr8Q|!H-WkF=)0$Nm?<P_hUlU34xL}o^QAfrJQ7jenNnn1IteIB;4
z4oAS8YDP#6MsKf}T&5FF(ENuWwu|#fK<v?*X>Zxfr2pc9oSuze^^!dGgZoM^sQ%a5
zceDa*f<*o?phS;*r8OD#c?zDD8=tZGp@6Hj8U_hVwD$Z0&t*myR#0O`li%}(E_!Qq
z>&@^O>*d{J)H+VRI(@oJ8xEbfr$0JFr*6GF{r(Yk=M&nxM;W@uPEoxA1B<L?@w1B_
zO?FtL*FghUh;`A%O)gYxxjOGh>@p(*J>J-$8VfCA8ys$v`4t!^FvSTU+|o}DD{zh3
H60ZLSnE#P+

literal 0
HcmV?d00001


From 36449f673190ebb7293847fd31ab1a6270a41df8 Mon Sep 17 00:00:00 2001
From: masumrazait <masumrazait@gmail.com>
Date: Sun, 1 Mar 2026 00:36:59 +0530
Subject: [PATCH 4/4] added new code with Logic explanation

---
 .../NonRepeatingCharacter.java                |  30 ++++++++++++++++++
 .../PalindromNumber.java                      |  24 ++++++++++++++
 .../ReversString.java                         |  19 +++++++++++
 .../UpperCaseCountInString.java               |  29 +++++++++++++++++
 .../NonRepeatingCharacter.class               | Bin 0 -> 1372 bytes
 .../PalindromNumber.class                     | Bin 0 -> 1062 bytes
 .../ReversString.class                        | Bin 0 -> 1164 bytes
 .../UpperCaseCountInString.class              | Bin 0 -> 1212 bytes
 8 files changed, 102 insertions(+)
 create mode 100644 src/test/java/codeWithLogicExplanation/NonRepeatingCharacter.java
 create mode 100644 src/test/java/codeWithLogicExplanation/PalindromNumber.java
 create mode 100644 src/test/java/codeWithLogicExplanation/ReversString.java
 create mode 100644 src/test/java/codeWithLogicExplanation/UpperCaseCountInString.java
 create mode 100644 target/test-classes/codeWithLogicExplanation/NonRepeatingCharacter.class
 create mode 100644 target/test-classes/codeWithLogicExplanation/PalindromNumber.class
 create mode 100644 target/test-classes/codeWithLogicExplanation/ReversString.class
 create mode 100644 target/test-classes/codeWithLogicExplanation/UpperCaseCountInString.class

diff --git a/src/test/java/codeWithLogicExplanation/NonRepeatingCharacter.java b/src/test/java/codeWithLogicExplanation/NonRepeatingCharacter.java
new file mode 100644
index 0000000..a1fa268
--- /dev/null
+++ b/src/test/java/codeWithLogicExplanation/NonRepeatingCharacter.java
@@ -0,0 +1,30 @@
+package codeWithLogicExplanation;
+
+public class NonRepeatingCharacter {
+
+	public static void main(String arg[]) {
+
+		// Input string
+		String input = "masum raza delhi bihar";
+		System.out.print("non repeating character is : ");
+		// Loop through each character
+		for (char c : input.toCharArray()) {
+			// If first and last occurrence of the character are the same,
+			// it means the character appears only once in the string
+			if (input.indexOf(c) == (input.lastIndexOf(c))) {
+				System.out.print(c + " ");
+			}
+		}
+		// Another string to check repeating characters
+		String sc = "bittumasum";
+		System.out.print("\nrepeating character is: ");
+		// Loop through each character
+		for (char d : sc.toCharArray()) {
+			// If first and last occurrence are different,
+			// it means the character appears more than once
+			if (sc.indexOf(d) != (sc.lastIndexOf(d))) {
+				System.out.print(d + " ");
+			}
+		}
+	}
+}
\ No newline at end of file
diff --git a/src/test/java/codeWithLogicExplanation/PalindromNumber.java b/src/test/java/codeWithLogicExplanation/PalindromNumber.java
new file mode 100644
index 0000000..0e2d2b1
--- /dev/null
+++ b/src/test/java/codeWithLogicExplanation/PalindromNumber.java
@@ -0,0 +1,24 @@
+package codeWithLogicExplanation;
+
+public class PalindromNumber {
+
+	public static void main(String[] args) {
+
+		int num = 12321; // The number to check
+		int rev = 0; // Variable to store the reversed number
+		int original = num; // Keep a copy of the original number
+
+		// Reverse the number
+		while (num != 0) {
+			rev = rev * 10 + num % 10; // Take last digit and build reversed number
+			num = num / 10; // Remove last digit from num
+		}
+
+		// Compare original with reversed
+		if (original == rev) {
+			System.out.println(original + " number is palindrome");
+		} else {
+			System.out.println(rev + " num is not palindrome");
+		}
+	}
+}
\ No newline at end of file
diff --git a/src/test/java/codeWithLogicExplanation/ReversString.java b/src/test/java/codeWithLogicExplanation/ReversString.java
new file mode 100644
index 0000000..1991027
--- /dev/null
+++ b/src/test/java/codeWithLogicExplanation/ReversString.java
@@ -0,0 +1,19 @@
+package codeWithLogicExplanation;
+
+public class ReversString {
+
+	public static void main(String[] args) {
+
+		String input = "delhi"; // The original string
+		String rev = ""; // Variable to store the reversed string
+		int len = input.length(); // Get the length of the string (5 for "delhi")
+
+		// Loop backwards from last character to first
+		for (int i = len - 1; i >= 0; i--) {
+			rev = rev + input.charAt(i); // Append each character to rev
+		}
+
+		// Print the reversed string
+		System.out.println("reverse string is : " + rev);
+	}
+}
\ No newline at end of file
diff --git a/src/test/java/codeWithLogicExplanation/UpperCaseCountInString.java b/src/test/java/codeWithLogicExplanation/UpperCaseCountInString.java
new file mode 100644
index 0000000..7c98803
--- /dev/null
+++ b/src/test/java/codeWithLogicExplanation/UpperCaseCountInString.java
@@ -0,0 +1,29 @@
+package codeWithLogicExplanation;
+
+public class UpperCaseCountInString {
+
+	public static void main(String[] args) {
+
+		// Input string to check
+		String input = "MaDhUBani";
+
+		// Counter to keep track of uppercase letters
+		int count = 0;
+
+		// Loop through each character in the string
+		for (int i = 0; i <= input.length() - 1; i++) {
+
+			// Get the character at position i
+			char c = input.charAt(i);
+
+			// Check if the character is uppercase
+			if (Character.isUpperCase(c)) {
+				count++; // Increase count if uppercase
+				System.out.println("Upper character is : " + c);
+			}
+		}
+
+		// Print total number of uppercase characters found
+		System.out.println("Total Upper case is : " + count);
+	}
+}
\ No newline at end of file
diff --git a/target/test-classes/codeWithLogicExplanation/NonRepeatingCharacter.class b/target/test-classes/codeWithLogicExplanation/NonRepeatingCharacter.class
new file mode 100644
index 0000000000000000000000000000000000000000..7537052c5a9f92ce6344771455ea449af559138a
GIT binary patch
literal 1372
zcmb7EOH&g;5dJ3FWJ6ed1fm9stS?M>1vN$`iedmo0|8@UQJf~56$X>t)MjIe<<Y<3
z(E?7K^$;zs;s;n|`H#e&4L*=uJY;sJd-|LHzV6P~AD?#tq_L>N$1rNxW%H?U*YftN
zFs5JDD%|3(u&va*Z9O(?CLOHR+!}Yd;hK&Lh2hvbf5B69aWz#at(%6+5WFQU;Z894
z6Uik8B}b@X_|c&ufFQ%sys*sqMzv%*Pk5<fGDPyW!7EGL5%RomRNOUDXBf->UshRq
zvC4(Ta3Zmi|C3$Obtw64aw&x4<g4;}qpCan71zsVWliWMLA*N9ji`#A1H6hGb=RzF
zIDwPI$!-wEXbV`_sRcrH3ESk=YzQ%ixMf?q^Ght<_@$OE>iW1I#%aV=^f7dMsU1Yn
za0dMhftm!RR}$^=592J(t2lQsM~|I`3%JP8>DsbLla9kTNR32tB`1R}X-FW+pbD#O
zzAQYGuG!?QbPZ`3mafhUue-A?w~A4Qlm7~MuOTXB(~&`A8ZP4s;l1FMhAHu)iCpq<
z%3+KkEo<K&LWY5n2qU<m;U>nZS$M5xT4jcjc4QBM?LVKD5Vthk2DMqpwOhqy=t;DB
zKZLss;gWFOhFA3v?lHu|?Q1lyQ;oT^N(E}uJyaWE)no@m4y8to#|--A7<_fPAyQpM
zmmAOLc+Kl+6;mqa$-P2%!bQ8`80L(S1JK)cz(%F`Bs672QwsQKM-xP=N~aWk8GQqT
z9}#-*xx=(dHz=T!R;_h`zFl<cz!4lJ3k9>MP&|;W$g%tfL?Wk}=pAZ8Umg$aW)%O#
z4lc(6@$~JXz9t6bGPs34y7&bn%YC1a`iQHMYfW5lB1@5P{45?-w)ehA?#xNFNwN)l
zXu;h~z@Jfea3vOuD(Q*gIN`}<aPv1_{4k!vqDnNdz4uM>@<Z~<cpO6Ve}uSoqMz6d
z6Q60?&(qj0q6f<~qc&oAjb6N^{U+j`4r!7N*g_6d9^N~Onjt0nF@XDcK*BDffLXHn
sD1HDB$>zr+x|>39kHCT|@~W%^Q!xh&`u3nhZ5jWv56KD@D9ne2pP@!Pi2wiq

literal 0
HcmV?d00001

diff --git a/target/test-classes/codeWithLogicExplanation/PalindromNumber.class b/target/test-classes/codeWithLogicExplanation/PalindromNumber.class
new file mode 100644
index 0000000000000000000000000000000000000000..9ed38ef4b9d2c3b14c29ad90647a5c2c65f5fffd
GIT binary patch
literal 1062
zcma)5+fEZv6kVqsn6?a3S|~^h6hUpPP`qDSFwtm2QUz135??&DV>vjTnG92+zv7c`
zJnI7(P5b~q!f)^k&^2wnaCtD3?6c3=d#|(3+IzkoeEtgHDoQ#+0=c@=FrO)Zv*I*W
z{r(%*lD71fV;9$?rR;|1v>vrv8>Xj26Nqog9a&^bv$(pkW!8Ox{<5-_zbp{W<!b`k
zJ>ta>M$|wb`UQq6$~L<YPvnMW3M48{U0OBisbJqb)cj4gEl{ZZFP{?cYDr}aq;fAR
ze|c4XPua~<z81wWk~$KHSXbX}`)13)2u8`+Y4ZW2-D2ew*I4PZ-jpqhGbS*06!vag
zSq;;R;WW}ZCJsY)E;f+Cq=3F7t+u)PitxFW{Be3Qq%a*QlnpYD$Mdxa&M=g<JK|^6
zcGmsf56YXuoPo1ANBO1ens!5A{v?!Rz`X~Q0*IV}JPHC4-|31bFp@iw>qRW+m={QP
z^f;`Pfnx9o-3`RE><BKgBLVGzv+el*@Mg!P*JPKICp3)hV3B}Wq34-9<mGs(scdNp
z3|4(vfBjIpy=jS6owipuAE;oSMvhGCLckI;APxr|2+`vx((2q5xeBg*g?&Umbiy&(
zAPg1^&>GzYu7lh~aSB5`35vf%;|Ht{FV2+1OX=lZBr@^XW;z~oUoO#F<@CFsKPEHp
zG5rzoFG#IVe!}=ZrV=xInBBwqJzUsDrWecfVvB!b0iiGgLYH|xc&Ua6$wg@mk{iS*
z=}gd{LISf$qRd&o!_(&&>yR&W39|kQ>oq*(uYQg6`%%SpdLbe`#tnL5++@Z8v;zzX
PAx_PWGwl|SLb&}4(=zq!

literal 0
HcmV?d00001

diff --git a/target/test-classes/codeWithLogicExplanation/ReversString.class b/target/test-classes/codeWithLogicExplanation/ReversString.class
new file mode 100644
index 0000000000000000000000000000000000000000..34efe5ab0cf3a15e11431c9a0eeff50b27b411ab
GIT binary patch
literal 1164
zcma)*T~iWK7{~ty78htu1<^7!)Kn0aO0yF4jnpvACL5ckt0SD?*s{wki&OV~jPARx
z3v6np572ENq3@ABXK@n4i)P@wJum0?Jo`UCet-QAU>=Wk_!!0uc2T^LZaHt4WMSiN
z)#Mg;rER63i6i0E_FP9=B^??=_aQ&xX|k8ny9bA&;4*Y9NlUuR4E{uNpFzt~vM~Gz
z83>?*p(`&f@uXfk5YBUcU<!sv-Y#%+pF2|RPY*S>ENcvt`Tv5+&_xw4Er!0ttNa;M
z6E&0E52A-5P!wia1`%aI7%}wg=sQ<K)7`)oT%|%xVU^snS4d9BHHQ9w6R+2$Srm@S
zHDq8I*BSI9Zq~)_YlewL3rMp&nPkh+DO(r=7*V|$Wr($g{AE|^Zx|TI1VI(b+*zYG
zYl&Pkt6~!dl9(b3uU3UsWEf0j+pjq#&8UcJ12dRq2)cIj4u;-Ddq^gPo4Bpx*7+8_
ztGS|LU=H)t8M{s>v1U=yPCq4KxRg`yN+yT}%IkQF5%HR*nYgUQ7vqZIo}#|bFmqAG
zZB06(&)|WMC5EW?Db8PMU|BU$uPO?Yw4iaPL>h`-pa>F!w5p0e(smn($xqxgk^&f5
zj{cINbI;|4H#@xQDOATQLwL`wI|Z>Rm5h5@U&pNC!w4t|y)3{-E0RBrI_=UllLir(
zI!5r5XAaY-%%FfvG#X6@nmcJ1!ew;Pi3<J+jZy*Ik?wpXvXg3{cX>!FE@&Sy{0##y
zr@vtE81Yn0YhbK_$p%t8@3oVd_Tl8$XQY)&<PJGZH*lA14J;}GKfMTG6hRtw+69Rw
zL?i~HM3AC+4n4>r;?d1F39y1yFLn!SSSP*?JVcgOKJr?j^#*0?#uzqfrD2PFWAL3&
V%7BhXI%4!=RPz9Z=E&&7_8&tL3G)B|

literal 0
HcmV?d00001

diff --git a/target/test-classes/codeWithLogicExplanation/UpperCaseCountInString.class b/target/test-classes/codeWithLogicExplanation/UpperCaseCountInString.class
new file mode 100644
index 0000000000000000000000000000000000000000..dc772d6733ec73027c7f7006d7b51767d78b112f
GIT binary patch
literal 1212
zcmb7@-A)rh7>3{JZrQdh0xbm<ss&M7P*wy{C?HTkt3{1KiF!0_H|=1%+ibT+&$$WD
zO+40vVl?prOuPo~1pTHhG^CuE&HV2B%{<@F{5t;r6TmFCH24?{)5%+V!YgK-f-pDU
zS4!OGo^Whqw^Fg(G_P7|r)GN@d)sq`UC^L1^d0bb+#qGac)ovNnI1#eqOgUx%%CKa
zIR-UN$A+LFsKbvghTg2Ot!K6JzUA)l{gTBH&N?P9<+v;4y0xi#MNws#&i*G>imohk
zVKWRS-elW&P3TlI7eGHlaEq@Och|TrLWm%$Vc?7}O|gza43R@-k-MwpnVQHX(;-~K
zu!hSFk@n$fQgG9=Tpc5bF?5USY0#uyI{7+?s~FV~KYP!Is%MpTjNux^%c;>N(I&HS
zj29GTk4P+DPHDK#Fx0-V3Ak1hrM%?^aFgsB7se%PgCs7h@r8H@<4DTDPmm&UUO1%U
zmX6z)B2PJG+RihK5OIgNbz4eW+|e<Oy9@!(X`(O;Bsxt<JBv9D_fDd9)-4_PC74!`
zo|bHxig_Iipd5CUEW6+p8&#AEV2RSX<9NIjZ@Ed;*!J+D<X@54nNEfiY{~<73sh2(
zbIO9jFYJnpf4IYMqVb!u@)=l$nxJM<OEdIrd)$1x#Vf6%4Q)F$*R(c;EbHOZ5;*g2
zreqc|3UZBJAK;@IJq+qKS{XDl8vPST2z+V$4pA?EgABT<*P8+wduSEJ1@zL6H2wpX
zjso_=eOYBmS^f-TGFC@;PK~PHaPcEzhd%ZdSAJmpRrtmc5>d5|$vTWWW)2k=qv-=R
z|LO1V6U`!NM(S8@N+gZ~i8ImY0}UWQ0ff*`-vB+0C_R8d%+THnhLNL{M4oM8VHInQ
wGj@>1IzjvK5*yg07-*QsBbq66&KMpeL#{j_tq$cFAq^465;9UxY0ro3KkWb(=Kufz

literal 0
HcmV?d00001