For example, The code given in the file 02-first-java for Q1.java is the code that gives the factorial of a number. Whereas in Kunal's assignment the corresponding question is to check whether a number is odd or eve which is done in Q2.java.

I found this to be the issue for multiple questions. I would love to be assigned to fix it.

In Q10 of the conditionals assignment in the answer code, you are taking the height of the parallelogram as input, it should be "side". Simply replace "height" by "side" in the System.out.println("") statement.

In the following link:- https://github.com/thatbeautifuldream/java-dsa-bootcamp/blob/main/01-flow-of-program/q3.png Here the flowchart intialisation is wrong it should be i=1 instead of 0 which is correctly written in the pseudo code of the same.

Every open-source author, maintainer, and contributor knows the importance of fostering a positive environment for collaboration and providing adequate resources for folks to seek help and contribute in a meaningful way. These resources include providing a Code of Conduct, a Contributing Guide, issue templates, and more. GitHub refers to this collection of documents as community health files.

• [x] CODE_OF_CONDUCT.md
• [x] CONTRIBUTING.md
• [x] Issue and pull request templates and config.yml for submitting blank issues.

To know more about default community health files visit Github Documentation.

Closes # 65

📑 Description

Made a PR because the assignment problems in 02-first-java of DSA-Java Bootcamp doesn't matches with kunal kushwaha's DSA-Java Bootcamp.

• [x] Completed: Added current files that matches Kunal kushwaha's DSA-Java Bootcamp.

✅ Checks

• [x] My pull request adheres to the code style of this project
• [x] My code requires changes to the documentation
• [x] I have updated the documentation as required
• [x] All the tests have passed

ℹ Additional Information

Am given Question name as the file name. Happy to Contribute. Hope this will help the folks.

Thank You!

Description

a java program to find a perfect number between specified digits of number. perfect number is a number which is sum of its all factors except itself.

Additional Information

No response

• [x] Complete Git & GitHub Course
• [x] Introduction to Programming
  • [x] Types of languages
  • [x] Memory management
• [x] Flow of the program
  • [x] Flowcharts
  • [x] Pseudocode
• [x] Introduction to Java
  • [x] Introduction
  • [x] How it works
  • [x] Setup Installation
  • [x] Input and Output in Java
  • [x] Conditionals & Loops in Java
    • [x] if-else
    • [x] loops
    • [x] Switch statements
  • [x] Data-types
  • [x] Coding best practices
• [x] Functions
  • [x] Introduction
  • [x] Scoping in Java
  • [x] Shadowing
  • [x] Variable Length Arguments
  • [x] Overloading
• [x] Arrays
  • [x] Introduction
  • [x] Memory management
  • [x] Input and Output
  • [x] ArrayList Introduction
  • [ ] Searching
    • [x] Linear Search
    • [x] Binary Search
    • [x] Modified Binary Search
    • [ ] Binary Search on 2D Arrays
  • [ ] Sorting
    • [x] Insertion Sort
    • [x] Selection Sort
    • [x] Bubble Sort
    • [ ] Count Sort
    • [ ] Radix Sort
    • [x] Cyclic Sort
  • [ ] Sliding window
  • [ ] Two Pointer
  • [ ] Subarray Questions
• [ ] Pattern questions
• [x] Strings
  • [x] Introduction
  • [x] How Strings work
  • [ ] Comparison of methods
  • [ ] Operations in Strings
  • [ ] StringBuilder in java
• [ ] Maths for DSA
  • [x] Introduction
  • [x] Complete Bitwise Operators
  • [ ] Prime numbers
  • [ ] HCF / LCM
  • [ ] Sieve of Eratosthenes
  • [ ] Newton's Square Root Method
  • [ ] Number Theory
  • [ ] Euclidean algorithm
  • [ ] Advanced Concepts for CP (later in the course)
    • [ ] Bitwise + DP
    • [ ] Extended Euclidean algorithm
    • [ ] Modulo Properties
    • [ ] Modulo Multiplicative Inverse
    • [ ] Linear Diophantine Equations
    • [ ] Fermat’s Theorem
    • [ ] Wilson's Theorem
    • [ ] Lucas Theorem
    • [ ] Chinese Remainder Theorem
• [x] Recursion
  • [x] Introduction
  • [x] Why recursion?
  • Flow of recursive programs - stacks
  • Convert recursion to iteration
  • Tree building of function calls
  • Tail recursion
  • Sorting:
    • [ ] Merge Sort
    • [ ] Quick Sort
  • [ ] Backtracking
    • [ ] Sudoku Solver
    • [ ] N-Queens
    • [ ] N-Knights
    • [ ] Maze problems
  • [ ] Recursion String Problems
  • [ ] Recursion Array Problems
  • [ ] Recursion Pattern Problems
  • [ ] Subset Questions
• [ ] Space and Time Complexity Analysis
  • [ ] Introduction
  • [ ] Comparisons of various cases
  • [ ] Solving Linear Recurrence Relations
  • [ ] Solving Divide and Conquer Recurrence Relations
  • [ ] Big-O, Big-Omega, Big-Theta Notations
  • [ ] Get equation of any relation easily - best and easiest approach
  • [ ] Complexity discussion of all the problems we do
  • [ ] Space Complexity
  • [ ] Memory Allocation of various languages
  • [ ] NP-Completeness and Hardness
• [ ] Object Oriented Programming
  • [ ] Introduction
  • [ ] Classes & its instances
  • [ ] this keyword in Java
  • [ ] Properties
    • [ ] Inheritance
    • [ ] Abstraction
    • [ ] Polymorphism
    • [ ] Encapsulation
  • [ ] Overloading & Overriding
  • [ ] Static & Non-Static
  • [ ] Access Control
  • [ ] Interfaces
  • [ ] Abstract Classes
  • [ ] Singleton Class
  • [ ] final, finalize, finally
  • [ ] Object Class
  • [ ] Generics
  • [ ] Exception Handling
  • [ ] Collections Framework
  • [ ] Lambda Expression
  • [ ] Enums
  • [ ] Fast IO
  • [ ] File handling
• [ ] Greedy Algorithms
• [ ] Stacks & Queues
  • [ ] Introduction
  • [ ] Interview problems
  • [ ] Push efficient
  • [ ] Pop efficient
  • [ ] Queue using Stack and Vice versa
  • [ ] Circular Queue
• [ ] Linked List
  • [ ] Introduction
  • [ ] Fast and slow pointer
  • [ ] Cycle Detection
  • [ ] Single and Doubly LinkedList
  • [ ] Reversal of LinkedList
• [ ] Dynamic Programming
  • [ ] Introduction
  • [ ] Recursion + Recursion DP + Iteration + Iteration Space Optimized
  • [ ] Complexity Analysis
  • [ ] 0/1 Knapsack
  • [ ] Subset Questions
  • [ ] Unbounded Knapsack
  • [ ] Subsequence questions
  • [ ] String DP
• [ ] Trees
  • [ ] Introduction
  • [ ] Binary Trees
  • [ ] Binary Search Trees
  • [ ] DFS
  • [ ] BFS
  • [ ] AVL Trees
  • [ ] Segment Tree
  • [ ] Fenwick Tree / Binary Indexed Tree
• [ ] Square Root Decomposition
• [ ] Heaps
  • [ ] Introduction
  • [ ] Theory
  • [ ] Priority Queue
  • [ ] Heapsort
  • [ ] Two Heaps Method
  • [ ] k-way merge
  • [ ] Top k elements
  • [ ] Interval problems
• [ ] HashMap
  • [ ] Introduction
  • [ ] Theory - how it works
  • [ ] Comparisons of various forms
  • [ ] Limitations and how to solve
  • [ ] Map using LinkedList
  • [ ] Map using Hash
  • [ ] Chaining
  • [ ] Probing
  • [ ] Huffman-Encoder
• [ ] Tries
• [ ] Graphs
  • [ ] Introduction
  • [ ] BFS
  • [ ] DFS
  • [ ] Working with graph components
  • [ ] Minimum Spanning Trees
  • [ ] Kruskal Algorithm
  • [ ] Prims Algorithm
  • [ ] Dijkstra’s shortest path algorithm
  • [ ] Topological Sort
  • [ ] Bellman ford
  • [ ] A* pathfinding Algorithm