This repository has been archived by the owner on Nov 3, 2024. It is now read-only.
Added isPalindrome.java file | Fixes issue #364 #365
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Hacktoberfest! ππ
π Have you read the Contributing Guidelines? π€
(Yes)
π Description
I've succesfully added isPalindrome problem in java language.
Fixes #364 π§
β Checklist
README.md
and linked to my code. ππ Related Issues or Pull Requests
The isPalindrome problem in Data Structures and Algorithms (DSA) involves determining if a given string or number reads the same backward as forward. This problem is fundamental in understanding string manipulation and algorithmic logic.
Key Points:
Definition: A palindrome is a sequence that reads the same backward as forward, such as "madam" or "121".
Approach:
1). String Comparison: Compare characters from the beginning and end of the sequence, moving toward the center.
2). Two-Pointer Technique: Utilize two pointers, one starting from the beginning and the other from the end, to check equality.
3). Efficiency: The algorithm typically runs in O(n) time complexity, where n is the length of the sequence, because each character is checked at most once.