Skip to content

Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
cclauss merged 7 commits into from
May 25, 2023
Merged

Merge and add benchmarks to palindrome algorithms in the strings/ directory #8749

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
b42f504
refactor: Merge and add benchmarks to palindrome
CaedenPH May 19, 2023
b1f49ca
updating DIRECTORY.md
May 19, 2023
316fd04
chore: Fix failing tests
CaedenPH May 19, 2023
4454f58
Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…
CaedenPH May 19, 2023
da3003a
Update strings/palindrome.py
CaedenPH May 25, 2023
35ea03e
Update palindrome.py
cclauss May 25, 2023
c28fe2e
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] May 25, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion DIRECTORY.md
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
* [Hexagonal Number](maths/hexagonal_number.py)
* [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
* [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
* [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.
* [Is Square Free](maths/is_square_free.py)
* [Jaccard Similarity](maths/jaccard_similarity.py)
* [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
* [Indian Phone Validator](strings/indian_phone_validator.py)
* [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
* [Is Isogram](strings/is_isogram.py)
* [Is Palindrome](strings/is_palindrome.py)
* [Is Pangram](strings/is_pangram.py)
* [Is Spain National Id](strings/is_spain_national_id.py)
* [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down
41 changes: 0 additions & 41 deletions strings/is_palindrome.py
View file
Open in desktop

This file was deleted.

40 changes: 39 additions & 1 deletion strings/palindrome.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
"MALAYALAM": True,
"String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
return True


def is_palindrome_traversal(s: str) -> bool:
"""
Return True if s is a palindrome otherwise return False.

>>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
True
"""
end = len(s) // 2
n = len(s)

# We need to traverse till half of the length of string
# as we can get access of the i'th last element from
# i'th index.
# eg: [0,1,2,3,4,5] => 4th index can be accessed
# with the help of 1st index (i==n-i-1)
# where n is length of string
return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
"""
Return True if s is a palindrome otherwise return False.

>>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
True
"""
if len(s) <= 1:
if len(s) <= 2:
return True
if s[0] == s[len(s) - 1]:
return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
return s == s[::-1]


def benchmark_function(name: str) -> None:
stmt = f"all({name}(key) is value for key, value in test_data.items())"
setup = f"from __main__ import test_data, {name}"
number = 500000
result = timeit(stmt=stmt, setup=setup, number=number)
print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
for key, value in test_data.items():
assert is_palindrome(key) is is_palindrome_recursive(key)
assert is_palindrome(key) is is_palindrome_slice(key)
print(f"{key:21} {value}")
print("a man a plan a canal panama")

# finished 500,000 runs in 0.46793 seconds
benchmark_function("is_palindrome_slice")
# finished 500,000 runs in 0.85234 seconds
benchmark_function("is_palindrome")
# finished 500,000 runs in 1.32028 seconds
benchmark_function("is_palindrome_recursive")
# finished 500,000 runs in 2.08679 seconds
benchmark_function("is_palindrome_traversal")
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all 
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Force GitHub README to respect dark mode
(function() {
var style = document.createElement('style');
style.textContent = '
.markdown-body {
color-scheme: dark light;
}
.markdown-body pre { background: #161b22 !important; }
.markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }
.markdown-body table th, .markdown-body table td { border-color: #30363d !important; }
.markdown-body img { background: #0d1117; }
.markdown-body blockquote { border-left-color: #8b949e; }
.markdown-body hr { border-color: #30363d; }
';
document.head.appendChild(style);
})();
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Highlight search terms from Google/DuckDuckGo/Bing referrer
(function() {
var ref = document.referrer;
var terms = [];
if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {
var url = new URL(ref);
var q = url.searchParams.get('q') || url.searchParams.get('p');
if (q) {
terms = q.split(/\s+/).filter(function(t) { return t.length > 2; });
}
}
if (terms.length === 0) return;
var style = document.createElement('style');
style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';
document.head.appendChild(style);
function highlight(node) {
if (node.nodeType === 3) { // text node
var text = node.textContent;
var found = false;
terms.forEach(function(term) {
var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi');
if (regex.test(text)) {
found = true;
var frag = document.createDocumentFragment();
var parts = text.split(regex);
parts.forEach(function(part, i) {
if (i % 2 === 0) {
frag.appendChild(document.createTextNode(part));
} else {
var span = document.createElement('span');
span.className = 'userscript-highlight';
span.textContent = part;
frag.appendChild(span);
}
});
node.parentNode.replaceChild(frag, node);
}
});
} else if (node.nodeType === 1 && node.childNodes) { // element
var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];
if (!skipTags.includes(node.tagName)) {
Array.from(node.childNodes).forEach(highlight);
}
}
}
highlight(document.body);
// Re-highlight on dynamic content
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1 || node.nodeType === 3) highlight(node);
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Strip utm_, fbclid, gclid, etc. from all links on page
(function() {
var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',
'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',
'ref', 'ref_src', 'source', 'medium', 'campaign'];
function cleanUrl(url) {
try {
var u = new URL(url, window.location.origin);
var changed = false;
trackingParams.forEach(function(p) {
if (u.searchParams.has(p)) {
u.searchParams.delete(p);
changed = true;
}
});
return changed ? u.toString() : url;
} catch (e) {
return url;
}
}
function cleanLinks() {
document.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
cleanLinks();
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1) {
if (node.tagName === 'A') cleanLinks();
node.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Auto-enable theater mode on YouTube
(function() {
function tryTheater() {
var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]');
if (btn && !btn.classList.contains('activated')) {
btn.click();
}
}
// Try immediately
tryTheater();
// Try after navigation (SPA)
var lastUrl = location.href;
setInterval(function() {
if (location.href !== lastUrl) {
lastUrl = location.href;
setTimeout(tryTheater, 500);
}
}, 1000);
// Also try on player load
var observer = new MutationObserver(tryTheater);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Remove or un-stick sticky/fixed headers that block content
(function() {
function unstick() {
document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) {
if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {
el.style.position = 'static';
el.style.top = 'auto';
el.style.zIndex = 'auto';
}
});
}
unstick();
var observer = new MutationObserver(unstick);
observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });
})();
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Universal Dark Mode - works on any site
(function() {
var enabled = true;
function applyDarkMode() {
if (!enabled) return;
// Create style element if it doesn't exist
var style = document.getElementById('universal-dark-mode-style');
if (!style) {
style = document.createElement('style');
style.id = 'universal-dark-mode-style';
document.head.appendChild(style);
}
// Dark mode CSS - inverts colors but preserves images/video
style.textContent = '
/* Invert everything except media */
html {
filter: invert(1) hue-rotate(180deg) !important;
background: #1a1a2e !important;
}
/* Restore images, videos, iframes, canvas */
img, video, iframe, canvas, svg, picture, [style*="background-image"] {
filter: invert(1) hue-rotate(180deg) !important;
}
/* Preserve specific elements that should not be inverted */
.no-dark-mode, .no-dark-mode *,
[data-theme="light"], [data-theme="light"],
.ace_editor, .ace_editor *,
.CodeMirror, .CodeMirror *,
.monaco-editor, .monaco-editor *,
.markdown-body pre, .markdown-body pre *,
.highlight, .highlight *,
pre code, pre code * {
filter: none !important;
}
/* Fix common UI elements */
.modal, .popup, .dropdown-menu, .tooltip, .popover {
filter: invert(1) hue-rotate(180deg) !important;
background: #2d2d44 !important;
border-color: #444 !important;
}
/* Scrollbars */
::-webkit-scrollbar { background: #1a1a2e !important; }
::-webkit-scrollbar-thumb { background: #444 !important; }
::-webkit-scrollbar-thumb:hover { background: #555 !important; }
/* Selection */
::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }
::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }
';
}
function removeDarkMode() {
var style = document.getElementById('universal-dark-mode-style');
if (style) style.remove();
}
// Toggle with Alt+Shift+D
document.addEventListener('keydown', function(e) {
if (e.altKey && e.shiftKey && e.key === 'D') {
e.preventDefault();
enabled = !enabled;
if (enabled) {
applyDarkMode();
console.log('[Universal Dark Mode] Enabled');
} else {
removeDarkMode();
console.log('[Universal Dark Mode] Disabled');
}
}
});
// Apply on load
applyDarkMode();
// Re-apply on dynamic content
var observer = new MutationObserver(function(mutations) {
if (enabled && !document.getElementById('universal-dark-mode-style')) {
applyDarkMode();
}
});
observer.observe(document.head, { childList: true });
console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');
})();
}
} catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); }
})();
})();
Merge and add benchmarks to palindrome algorithms in the strings/ directory by CaedenPH · Pull Request #8749 · TheAlgorithms/Python · GitHub
Skip to content
Merge and add benchmarks to palindrome algorithms in the strings/ directory#8749

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

cclauss
merged 7 commits into

from

May 25, 2023
 Merged


Merge and add benchmarks to palindrome algorithms in the strings/ directory
#8749
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


7 commits


Select commit
Hold shift + click to select a range
b42f504

refactor: Merge and add benchmarks to palindrome


CaedenPH May 19, 2023
b1f49ca

updating DIRECTORY.md

May 19, 2023
316fd04

chore: Fix failing tests


CaedenPH May 19, 2023
4454f58

Merge branch 'merge-palindromic-algorithms' of https://github.com/Cae…


CaedenPH May 19, 2023
da3003a

Update strings/palindrome.py


CaedenPH May 25, 2023
35ea03e

Update palindrome.py


cclauss May 25, 2023
c28fe2e

[pre-commit.ci] auto fixes from pre-commit.com hooks


pre-commit-ci[bot] May 25, 2023

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


2 changes: 1 addition & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -577,6 +577,7 @@
 * [Hexagonal Number](maths/hexagonal_number.py)
 * [Integration By Simpson Approx](maths/integration_by_simpson_approx.py)
 * [Is Ip V4 Address Valid](maths/is_ip_v4_address_valid.py)
 * [Is Palindrome](maths/is_palindrome.py)
Comment thread
CaedenPH marked this conversation as resolved.

 * [Is Square Free](maths/is_square_free.py)
 * [Jaccard Similarity](maths/jaccard_similarity.py)
 * [Juggler Sequence](maths/juggler_sequence.py)
Expand DownExpand Up@@ -1154,7 +1155,6 @@
 * [Indian Phone Validator](strings/indian_phone_validator.py)
 * [Is Contains Unique Chars](strings/is_contains_unique_chars.py)
 * [Is Isogram](strings/is_isogram.py)
 * [Is Palindrome](strings/is_palindrome.py)
 * [Is Pangram](strings/is_pangram.py)
 * [Is Spain National Id](strings/is_spain_national_id.py)
 * [Is Srilankan Phone Number](strings/is_srilankan_phone_number.py)
Expand Down

41 changes: 0 additions & 41 deletions
strings/is_palindrome.py

View file


Open in desktop


This file was deleted.


40 changes: 39 additions & 1 deletion
strings/palindrome.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
# Algorithms to determine if a string is palindrome

from timeit import timeit

test_data = {
 "MALAYALAM": True,
 "String": False,
Expand DownExpand Up@@ -33,14 +35,33 @@ def is_palindrome(s: str) -> bool:
 return True


def is_palindrome_traversal(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_traversal(key) is value for key, value in test_data.items())
 True
 """
 end = len(s) // 2
 n = len(s)

 # We need to traverse till half of the length of string
 # as we can get access of the i'th last element from
 # i'th index.
 # eg: [0,1,2,3,4,5] => 4th index can be accessed
 # with the help of 1st index (i==n-i-1)
 # where n is length of string
 return all(s[i] == s[n - i - 1] for i in range(end))


def is_palindrome_recursive(s: str) -> bool:
 """
 Return True if s is a palindrome otherwise return False.

 >>> all(is_palindrome_recursive(key) is value for key, value in test_data.items())
 True
 """
 if len(s) <= 1:
 if len(s) <= 2:
 return True
 if s[0] == s[len(s) - 1]:
 return is_palindrome_recursive(s[1:-1])
Expand All@@ -58,9 +79,26 @@ def is_palindrome_slice(s: str) -> bool:
 return s == s[::-1]


def benchmark_function(name: str) -> None:
 stmt = f"all({name}(key) is value for key, value in test_data.items())"
 setup = f"from __main__ import test_data, {name}"
 number = 500000
 result = timeit(stmt=stmt, setup=setup, number=number)
 print(f"{name:<35} finished {number:,} runs in {result:.5f} seconds")


if __name__ == "__main__":
 for key, value in test_data.items():
 assert is_palindrome(key) is is_palindrome_recursive(key)
 assert is_palindrome(key) is is_palindrome_slice(key)
 print(f"{key:21} {value}")
 print("a man a plan a canal panama")

 # finished 500,000 runs in 0.46793 seconds
 benchmark_function("is_palindrome_slice")
 # finished 500,000 runs in 0.85234 seconds
 benchmark_function("is_palindrome")
 # finished 500,000 runs in 1.32028 seconds
 benchmark_function("is_palindrome_recursive")
 # finished 500,000 runs in 2.08679 seconds
 benchmark_function("is_palindrome_traversal")