A comprehensive collection of programming solutions, algorithms, and patterns for junior developer roles, organized by topic and programming language.
This repository is organized into the following sections:
- Python/ - Python solutions for basic programming problems
- Java/ - Java solutions for basic programming problems
- C/ - C solutions for basic programming problems
- Patterns/ - Pattern printing programs (12+ patterns)
- Algorithms/ - Searching and sorting algorithms
Each folder contains solutions with multiple implementation methods to help you understand different approaches to solving the same problem.
A comprehensive palindrome checking solution with multiple implementation methods:
- String Reversal Method - Reverse the string and compare
- Two Pointer Method - Efficient O(1) space complexity approach
- Recursive Method - Understanding recursion
- Additional Methods - Language-specific implementations
Multiple techniques to swap two variables:
- Temporary variable method
- Arithmetic operations (without temp)
- XOR operation
- Multiplication/division method
- Language-specific methods
Generate Fibonacci numbers using various approaches:
- Iterative method
- Recursive method
- Memoization (dynamic programming)
- Space-optimized iterative
- Mathematical formula (Binet's)
Calculate factorial with different implementations:
- Iterative approach
- Recursive approach
- Tail recursion
- Built-in functions
- Loop variations
Determine if a number is odd or even:
- Modulo operator
- Bitwise AND operation
- Division method
- String manipulation
Check primality and generate primes:
- Basic approach
- Optimized (up to √n)
- Sieve of Eratosthenes
- First n primes generator
Additional fundamental problems:
- Array reversal
- String reversal
- Sum of digits
- Find maximum/minimum
- Array sum
12+ common patterns including:
- Square patterns (solid and hollow)
- Triangles (right-angled, inverted)
- Pyramids and diamonds
- Number patterns
- Floyd's triangle
- Pascal's triangle
- Alphabet patterns
- Linear Search - O(n)
- Binary Search - O(log n) - Iterative & Recursive
- Jump Search - O(√n)
- Interpolation Search - O(log log n)
- Bubble Sort - O(n²)
- Selection Sort - O(n²)
- Insertion Sort - O(n²)
- Merge Sort - O(n log n)
- Quick Sort - O(n log n) average
- Heap Sort - O(n log n)
- Counting Sort - O(n + k)
Python:
cd Python
python palindrome.pyJava:
cd Java
javac Palindrome.java
java PalindromeC:
cd C
gcc palindrome.c -o palindrome
./palindromeEach solution is designed to help junior developers understand:
- Multiple approaches to solve the same problem
- Time and space complexity analysis
- Best practices in different programming languages
- Code organization and documentation
We welcome contributions! Whether you want to add new problems, implement solutions in other languages, fix bugs, or improve documentation - all contributions are appreciated.
Please read our Contributing Guidelines to get started. It includes:
- How to contribute code
- Style guides for Python, Java, and C
- Pull request process
- Issue reporting guidelines
Feel free to add more practice questions and solutions to help the community!
New to programming? Check out our Learning Resources Guide for:
- Recommended tutorials and courses
- Books for beginners
- Practice platforms
- Study plans and tips
- Community resources
- Free certifications
Perfect for beginners who want structured guidance on where to start and how to progress!
- Choose your preferred programming language folder
- Read the README in each folder for specific instructions
- Study the different implementation methods
- Run the code to see the results
- Try modifying the test cases to experiment
Happy coding! 🚀