This repository contains a wide collection of basic Java programs, organized by topics/packages.
It is designed to help beginners understand core Java concepts, improve problem-solving skills, and practice coding.
- ArithmeticOperators – Perform
+ , - , * , / , %. - AssignmentOperators – Example:
a += bmeansa = a + b. - LogicalOperators – Use
&&(AND),||(OR),!(NOT). - RelationalOperators – Example:
a > b,a == b. - TernaryOperator – Syntax:
condition ? value1 : value2. - UnaryOperators – Example:
++a , a++ , --a , -a.
- Example1 – Example7
- AddElement
- Check_array
- Maxnum
- Practice
- RemoveElement
- Reverse
- RotateAnticlock
- RotateClockwise
- Marks →
marks >= 35 → Pass else Fail
- DoWhile
- ForLoop
- WhileLoop
- Armstrong →
sum(d^n) == num(153 = 1³+5³+3³) - DigitsCount →
while(n>0) n/10 - Emirp → Prime and reverse is also prime
- Factor → Numbers that divide
nexactly - HappyNumber → Replace number by sum of squares of digits until 1
- Hcf → Greatest number dividing both a & b
- KrishnaMurthyNumber →
sum(fact(digits)) == num - Lcm → Smallest number divisible by both a & b
- Palindrome →
reverse == original - Perfect →
sum(factors) == num - PositiveInteger →
n > 0 - Prime → Divisible only by 1 and itself
- PrimeMethod
- SpyNumber →
sum(digits) == product(digits)
- ASCII
- Anagram → Same characters in any order
- ConvertArray
- First
- Problem1 – Problem6
- ReverseSubstring
- Substring
- VowConso → Count vowels & consonants
- palindrome →
reverse == original
- ArmstrongRec
- Factorial →
n! = n × (n-1)! - ReverseRecur
- Test
- BinarySearch → Divide & search mid element
- LinearSearch → Check one by one
- BubbleSort → Swap adjacent elements until sorted
- Days
- Practice
├── .settings/
├── bin/
├── src/
│ ├── Array/
│ ├── IfElse/
│ ├── Loops/
│ ├── Numbers/
│ ├── Operators/
│ ├── Patterns/
│ ├── Recursion/
│ ├── SearchingTechniques/
│ ├── SortingTechniques/
│ ├── Strings/
│ ├── Switch/
│ ├── TwoDArray/
│ └── module-info.java
├── .classpath
└── .project