Guduly patch 1 2#1

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

Open
Guduly wants to merge 17 commits into
base:master
Choose a base branch
from
Open

Guduly patch 1 2 #1

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
17 commits
Select commit Hold shift + click to select a range
c39b7ea
updated the URL and HTML tags for scrapping yahoo finance (#8942)
Suman2023 Aug 12, 2023
4f2a346
Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…
MaximSmolskiy Aug 13, 2023
9d86d4e
Create wa-tor algorithm (#8899)
CaedenPH Aug 14, 2023
f24ab2c
Add: Two Regex match algorithm (Recursive & DP) (#6321)
itsamirhn Aug 14, 2023
02d89bd
Added implementation for Tribonacci sequence using dp (#6356)
ajinkyac03 Aug 14, 2023
c290dd6
Update run.py in machine_learning/forecasting (#8957)
p1utoze Aug 14, 2023
4b7ecb6
Create is valid email address algorithm (#8907)
CaedenPH Aug 14, 2023
ac68dc1
Fixed Pytest warnings for machine_learning/forecasting (#8958)
p1utoze Aug 14, 2023
2ab3bf2
Added functions to calculate temperature of an ideal gas and number o…
robertjcalistri Aug 14, 2023
fb1b939
Consolidate find_min and find_min recursive and find_max and find_max…
CaedenPH Aug 14, 2023
7021afd
[pre-commit.ci] pre-commit autoupdate (#8963)
pre-commit-ci[bot] Aug 15, 2023
7618a92
Remove a slash in path to save the file correctly on Linux (#8053)
Erfaniaa Aug 15, 2023
490e645
Fix minor typing errors in maths/ (#8959)
CaedenPH Aug 15, 2023
cecf1fd
Fix greedy_best_first (#8775)
JadeKim042386 Aug 15, 2023
efaf526
BST and RSA doctest (#8693)
isidroas Aug 15, 2023
f66568e
Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)
MaximSmolskiy Aug 15, 2023
86f7835
Update binary_to_decimal.py Added Spacing for visual purposes
Guduly Aug 16, 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
6 changes: 3 additions & 3 deletions .pre-commit-config.yaml
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
- id: auto-walrus

- repo: https://github.com/astral-sh/ruff-pre-commit
rev: v0.0.282
rev: v0.0.284
hooks:
- id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
- tomli

- repo: https://github.com/tox-dev/pyproject-fmt
rev: "0.13.0"
rev: "0.13.1"
hooks:
- id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
- id: validate-pyproject

- repo: https://github.com/pre-commit/mirrors-mypy
rev: v1.4.1
rev: v1.5.0
hooks:
- id: mypy
args:
Expand Down
6 changes: 4 additions & 2 deletions DIRECTORY.md
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
* [Game Of Life](cellular_automata/game_of_life.py)
* [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
* [One Dimensional](cellular_automata/one_dimensional.py)
* [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
* [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
* [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
* [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
* [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
* [Regex Match](dynamic_programming/regex_match.py)
* [Rod Cutting](dynamic_programming/rod_cutting.py)
* [Subset Generation](dynamic_programming/subset_generation.py)
* [Sum Of Subset](dynamic_programming/sum_of_subset.py)
* [Tribonacci](dynamic_programming/tribonacci.py)
* [Viterbi](dynamic_programming/viterbi.py)
* [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
* [Fermat Little Theorem](maths/fermat_little_theorem.py)
* [Fibonacci](maths/fibonacci.py)
* [Find Max](maths/find_max.py)
* [Find Max Recursion](maths/find_max_recursion.py)
* [Find Min](maths/find_min.py)
* [Find Min Recursion](maths/find_min_recursion.py)
* [Floor](maths/floor.py)
* [Gamma](maths/gamma.py)
* [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
* [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)
* [Is Valid Email Address](strings/is_valid_email_address.py)
* [Jaro Winkler](strings/jaro_winkler.py)
* [Join](strings/join.py)
* [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down
49 changes: 20 additions & 29 deletions boolean_algebra/quine_mc_cluskey.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
"""
list1 = list(string1)
list2 = list(string2)
count_n = 0
for i in range(len(list1)):
if list1[i] != list2[i]:
count_n += 1
count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
temp = []
select = [0] * len(chart)
for i in range(len(chart[0])):
count = 0
rem = -1
for j in range(len(chart)):
if chart[j][i] == 1:
count += 1
rem = j
count = sum(row[i] == 1 for row in chart)
if count == 1:
rem = max(j for j, row in enumerate(chart) if row[i] == 1)
select[rem] = 1
for i in range(len(select)):
if select[i] == 1:
for j in range(len(chart[0])):
if chart[i][j] == 1:
for k in range(len(chart)):
chart[k][j] = 0
temp.append(prime_implicants[i])
for i, item in enumerate(select):
if item != 1:
continue
for j in range(len(chart[0])):
if chart[i][j] != 1:
continue
for row in chart:
row[j] = 0
temp.append(prime_implicants[i])
while True:
max_n = 0
rem = -1
count_n = 0
for i in range(len(chart)):
count_n = chart[i].count(1)
if count_n > max_n:
max_n = count_n
rem = i
counts = [chart[i].count(1) for i in range(len(chart))]
max_n = max(counts)
rem = counts.index(max_n)

if max_n == 0:
return temp

temp.append(prime_implicants[rem])

for i in range(len(chart[0])):
if chart[rem][i] == 1:
for j in range(len(chart)):
chart[j][i] = 0
for j in range(len(chart[0])):
if chart[rem][j] != 1:
continue
for i in range(len(chart)):
chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { injectUserscript("// Add copy buttons to all 
 blocks\n(function() {\n function addCopyButtons() {\n document.querySelectorAll('pre code').forEach(function(codeBlock) {\n if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;\n codeBlock.parentElement.setAttribute('data-copy-added', 'true');\n \n var btn = document.createElement('button');\n btn.textContent = 'Copy';\n 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;';\n btn.onmouseover = function() { this.style.opacity = '1'; };\n btn.onmouseout = function() { this.style.opacity = '0.7'; };\n btn.onclick = function() {\n navigator.clipboard.writeText(codeBlock.textContent).then(function() {\n btn.textContent = 'Copied!';\n setTimeout(function() { btn.textContent = 'Copy'; }, 1500);\n });\n };\n codeBlock.parentElement.style.position = 'relative';\n codeBlock.parentElement.appendChild(btn);\n });\n }\n \n addCopyButtons();\n \n // Re-run on dynamic content\n var observer = new MutationObserver(addCopyButtons);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "Add Copy Buttons to Code Blocks");
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Force GitHub README to respect dark mode\n(function() {\n var style = document.createElement('style');\n style.textContent = '\n .markdown-body {\n color-scheme: dark light;\n }\n .markdown-body pre { background: #161b22 !important; }\n .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }\n .markdown-body table th, .markdown-body table td { border-color: #30363d !important; }\n .markdown-body img { background: #0d1117; }\n .markdown-body blockquote { border-left-color: #8b949e; }\n .markdown-body hr { border-color: #30363d; }\n ';\n document.head.appendChild(style);\n})();", "GitHub Dark Mode README Fix");
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading

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

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading

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

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Auto-enable theater mode on YouTube\n(function() {\n function tryTheater() {\n var btn = document.querySelector('button[aria-label=\"Theater mode\"], ytd-player #player button[title=\"Theater mode\"]');\n if (btn && !btn.classList.contains('activated')) {\n btn.click();\n }\n }\n \n // Try immediately\n tryTheater();\n \n // Try after navigation (SPA)\n var lastUrl = location.href;\n setInterval(function() {\n if (location.href !== lastUrl) {\n lastUrl = location.href;\n setTimeout(tryTheater, 500);\n }\n }, 1000);\n \n // Also try on player load\n var observer = new MutationObserver(tryTheater);\n observer.observe(document.body, { childList: true, subtree: true });\n})();", "YouTube Theater Mode Default");
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
injectUserscript("// Remove or un-stick sticky/fixed headers that block content\n(function() {\n function unstick() {\n document.querySelectorAll('header, nav, [role=\"banner\"], .header, .navbar, .sticky, .fixed-top, [style*=\"position: fixed\"], [style*=\"position:sticky\"]').forEach(function(el) {\n if (el.style.position === 'fixed' || el.style.position === 'sticky' || \n getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {\n el.style.position = 'static';\n el.style.top = 'auto';\n el.style.zIndex = 'auto';\n }\n });\n }\n \n unstick();\n \n var observer = new MutationObserver(unstick);\n observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });\n})();", "Kill Sticky Headers");
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading

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

Skip to content
Guduly patch 1 2#1

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

 Open

Guduly
wants to merge
17
commits into

base:master
Choose a base branch

from

 Open


Guduly patch 1 2
#1
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


17 commits


Select commit
Hold shift + click to select a range
c39b7ea

updated the URL and HTML tags for scrapping yahoo finance (#8942)


Suman2023 Aug 12, 2023
4f2a346

Reduce the complexity of linear_algebra/src/polynom_for_points.py (#8…


MaximSmolskiy Aug 13, 2023
9d86d4e

Create wa-tor algorithm (#8899)


CaedenPH Aug 14, 2023
f24ab2c

Add: Two Regex match algorithm (Recursive & DP) (#6321)


itsamirhn Aug 14, 2023
02d89bd

Added implementation for Tribonacci sequence using dp (#6356)


ajinkyac03 Aug 14, 2023
c290dd6

Update run.py in machine_learning/forecasting (#8957)


p1utoze Aug 14, 2023
4b7ecb6

Create is valid email address algorithm (#8907)


CaedenPH Aug 14, 2023
ac68dc1

Fixed Pytest warnings for machine_learning/forecasting (#8958)


p1utoze Aug 14, 2023
2ab3bf2

Added functions to calculate temperature of an ideal gas and number o…


robertjcalistri Aug 14, 2023
fb1b939

Consolidate find_min and find_min recursive and find_max and find_max…


CaedenPH Aug 14, 2023
7021afd

[pre-commit.ci] pre-commit autoupdate (#8963)


pre-commit-ci[bot] Aug 15, 2023
7618a92

Remove a slash in path to save the file correctly on Linux (#8053)


Erfaniaa Aug 15, 2023
490e645

Fix minor typing errors in maths/ (#8959)


CaedenPH Aug 15, 2023
cecf1fd

Fix greedy_best_first (#8775)


JadeKim042386 Aug 15, 2023
efaf526

BST and RSA doctest (#8693)


isidroas Aug 15, 2023
f66568e

Reduce the complexity of boolean_algebra/quine_mc_cluskey.py (#8604)


MaximSmolskiy Aug 15, 2023
86f7835

Update binary_to_decimal.py Added Spacing for visual purposes


Guduly Aug 16, 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


6 changes: 3 additions & 3 deletions
.pre-commit-config.yaml

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -16,7 +16,7 @@ repos:
 - id: auto-walrus

 - repo: https://github.com/astral-sh/ruff-pre-commit
 rev: v0.0.282
 rev: v0.0.284
 hooks:
 - id: ruff

Expand All@@ -33,7 +33,7 @@ repos:
 - tomli

 - repo: https://github.com/tox-dev/pyproject-fmt
 rev: "0.13.0"
 rev: "0.13.1"
 hooks:
 - id: pyproject-fmt

Expand All@@ -51,7 +51,7 @@ repos:
 - id: validate-pyproject

 - repo: https://github.com/pre-commit/mirrors-mypy
 rev: v1.4.1
 rev: v1.5.0
 hooks:
 - id: mypy
 args:
Expand Down

6 changes: 4 additions & 2 deletions
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,6 +74,7 @@
 * [Game Of Life](cellular_automata/game_of_life.py)
 * [Nagel Schrekenberg](cellular_automata/nagel_schrekenberg.py)
 * [One Dimensional](cellular_automata/one_dimensional.py)
 * [Wa Tor](cellular_automata/wa_tor.py)

## Ciphers
 * [A1Z26](ciphers/a1z26.py)
Expand DownExpand Up@@ -335,9 +336,11 @@
 * [Minimum Tickets Cost](dynamic_programming/minimum_tickets_cost.py)
 * [Optimal Binary Search Tree](dynamic_programming/optimal_binary_search_tree.py)
 * [Palindrome Partitioning](dynamic_programming/palindrome_partitioning.py)
 * [Regex Match](dynamic_programming/regex_match.py)
 * [Rod Cutting](dynamic_programming/rod_cutting.py)
 * [Subset Generation](dynamic_programming/subset_generation.py)
 * [Sum Of Subset](dynamic_programming/sum_of_subset.py)
 * [Tribonacci](dynamic_programming/tribonacci.py)
 * [Viterbi](dynamic_programming/viterbi.py)
 * [Word Break](dynamic_programming/word_break.py)

Expand DownExpand Up@@ -570,9 +573,7 @@
 * [Fermat Little Theorem](maths/fermat_little_theorem.py)
 * [Fibonacci](maths/fibonacci.py)
 * [Find Max](maths/find_max.py)
 * [Find Max Recursion](maths/find_max_recursion.py)
 * [Find Min](maths/find_min.py)
 * [Find Min Recursion](maths/find_min_recursion.py)
 * [Floor](maths/floor.py)
 * [Gamma](maths/gamma.py)
 * [Gamma Recursive](maths/gamma_recursive.py)
Expand DownExpand Up@@ -1169,6 +1170,7 @@
 * [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)
 * [Is Valid Email Address](strings/is_valid_email_address.py)
 * [Jaro Winkler](strings/jaro_winkler.py)
 * [Join](strings/join.py)
 * [Knuth Morris Pratt](strings/knuth_morris_pratt.py)
Expand Down

49 changes: 20 additions & 29 deletions
boolean_algebra/quine_mc_cluskey.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -74,10 +74,7 @@ def is_for_table(string1: str, string2: str, count: int) -> bool:
 """
 list1 = list(string1)
 list2 = list(string2)
 count_n = 0
 for i in range(len(list1)):
 if list1[i] != list2[i]:
 count_n += 1
 count_n = sum(item1 != item2 for item1, item2 in zip(list1, list2))
 return count_n == count


Expand All@@ -92,40 +89,34 @@ def selection(chart: list[list[int]], prime_implicants: list[str]) -> list[str]:
 temp = []
 select = [0] * len(chart)
 for i in range(len(chart[0])):
 count = 0
 rem = -1
 for j in range(len(chart)):
 if chart[j][i] == 1:
 count += 1
 rem = j
 count = sum(row[i] == 1 for row in chart)
 if count == 1:
 rem = max(j for j, row in enumerate(chart) if row[i] == 1)
 select[rem] = 1
 for i in range(len(select)):
 if select[i] == 1:
 for j in range(len(chart[0])):
 if chart[i][j] == 1:
 for k in range(len(chart)):
 chart[k][j] = 0
 temp.append(prime_implicants[i])
 for i, item in enumerate(select):
 if item != 1:
 continue
 for j in range(len(chart[0])):
 if chart[i][j] != 1:
 continue
 for row in chart:
 row[j] = 0
 temp.append(prime_implicants[i])
 while True:
 max_n = 0
 rem = -1
 count_n = 0
 for i in range(len(chart)):
 count_n = chart[i].count(1)
 if count_n > max_n:
 max_n = count_n
 rem = i
 counts = [chart[i].count(1) for i in range(len(chart))]
 max_n = max(counts)
 rem = counts.index(max_n)

 if max_n == 0:
 return temp

 temp.append(prime_implicants[rem])

 for i in range(len(chart[0])):
 if chart[rem][i] == 1:
 for j in range(len(chart)):
 chart[j][i] = 0
 for j in range(len(chart[0])):
 if chart[rem][j] != 1:
 continue
 for i in range(len(chart)):
 chart[i][j] = 0


def prime_implicant_chart(
Expand Down
Loading