| FazBrowse GitHub Viewer | Trending | | Home |
| Tools: [Download Repo ZIP] [Original HTTPS Page] |
| Name | Name | Last commit date | ||
|---|---|---|---|---|
A curated collection of frequently asked Java programming interview questions with clean, well-structured solutions. Covers the most common algorithmic patterns tested in technical interviews.
| Program | Concept |
|---|---|
| Factorial.txt | Compute factorial of a number |
| Fibonacci series upto given range.txt | Generate Fibonacci sequence up to N |
| Prime number.txt | Check if a number is prime |
| Prime Factor.txt | Find all prime factors of a number |
| Palindrom number.txt | Check if a number is a palindrome |
| String palindrom.txt | Check if a string is a palindrome |
| Reverse.txt | Reverse a number or string |
| GCD.txt | Greatest Common Divisor using Euclidean algorithm |
| LCM.txt | Least Common Multiple |
| Sum of digits.txt | Sum all digits of a number |
| No.of digits.txt | Count digits in a number |
| Split number into digit.txt | Extract individual digits |
| Power of a number.txt | Compute power/exponentiation |
| Swap two numbers.txt | Swap values with and without temp variable |
| Even odd.txt | Determine even or odd |
Java — all solutions are written in Java.
Anyone preparing for Java technical interviews looking for quick reference solutions to the most commonly asked programming problems.
| Back | FazBrowse Home | New Git URL |