Enable ruff EXE001 rule

bit_manipulation/single_bit_manipulation_operations.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """Provide the functionality to manipulate a single bit."""
 
 

ciphers/bifid.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 The Bifid Cipher uses a Polybius Square to encipher a message in a way that
 makes it fairly difficult to decipher without knowing the secret.

ciphers/decrypt_caesar_with_chi_squared.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 from __future__ import annotations
 
 

ciphers/morse_code.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 Python program to translate to and from Morse code.
 

ciphers/polybius.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 A Polybius Square is a table that allows someone to translate letters into numbers.
 

data_structures/arrays/pairs_with_given_sum.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 Given an array of integers and an integer req_sum, find the number of pairs of array
 elements whose sum is equal to req_sum.

data_structures/binary_tree/merge_two_binary_trees.py

@@ -1,4 +1,3 @@
-#!/usr/local/bin/python3
 """
 Problem Description: Given two binary tree, return the merged tree.
 The rule for merging is that if two nodes overlap, then put the value sum of

data_structures/hashing/double_hash.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 """
 Double hashing is a collision resolving technique in Open Addressed Hash tables.
 Double hashing uses the idea of applying a second hash function to key when a collision

data_structures/hashing/hash_table.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 from .number_theory.prime_numbers import next_prime
 
 

data_structures/hashing/number_theory/prime_numbers.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 """
 module to operations with prime numbers
 """

data_structures/hashing/quadratic_probing.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 from .hash_table import HashTable
 
 

data_structures/heap/randomized_heap.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 from __future__ import annotations
 
 import random

data_structures/heap/skew_heap.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 from __future__ import annotations
 
 from collections.abc import Iterable, Iterator

dynamic_programming/climbing_stairs.py

@@ -1,6 +1,3 @@
-#!/usr/bin/env python3
-
-
 def climb_stairs(number_of_steps: int) -> int:
     """
     LeetCdoe No.70: Climbing Stairs

dynamic_programming/fast_fibonacci.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 This program calculates the nth Fibonacci number in O(log(n)).
 It's possible to calculate F(1_000_000) in less than a second.

dynamic_programming/optimal_binary_search_tree.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 # This Python program implements an optimal binary search tree (abbreviated BST)
 # building dynamic programming algorithm that delivers O(n^2) performance.
 #

graphs/breadth_first_search.py

@@ -1,5 +1,3 @@
-#!/usr/bin/python
-
 """Author: OMKAR PATHAK"""
 
 from __future__ import annotations

graphs/depth_first_search_2.py

@@ -1,5 +1,3 @@
-#!/usr/bin/python
-
 """Author: OMKAR PATHAK"""
 
 

graphs/graph_adjacency_list.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 """
 Author: Vikram Nithyanandam
 

graphs/graph_adjacency_matrix.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 """
 Author: Vikram Nithyanandam
 

graphs/graph_list.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 # Author: OMKAR PATHAK, Nwachukwu Chidiebere
 
 # Use a Python dictionary to construct the graph.

machine_learning/logistic_regression.py

@@ -1,5 +1,3 @@
-#!/usr/bin/python
-
 # Logistic Regression from scratch
 
 # In[62]:

maths/entropy.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 Implementation of entropy of information
 https://en.wikipedia.org/wiki/Entropy_(information_theory)

neural_network/back_propagation_neural_network.py

@@ -1,5 +1,3 @@
-#!/usr/bin/python
-
 """
 
 A Framework of Back Propagation Neural Network（BP） model

other/davis_putnam_logemann_loveland.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based
 search algorithm for deciding the satisfiability of propositional logic formulae in

other/doomsday.py

@@ -1,4 +1,3 @@
-#!/bin/python3
 # Doomsday algorithm info: https://en.wikipedia.org/wiki/Doomsday_rule
 
 DOOMSDAY_LEAP = [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]

other/fischer_yates_shuffle.py

@@ -1,4 +1,3 @@
-#!/usr/bin/python
 """
 The Fisher–Yates shuffle is an algorithm for generating a random permutation of a
 finite sequence.

pyproject.toml

@@ -4,7 +4,6 @@ lint.ignore = [    # `ruff rule S101` for a description of that rule
   "B905",     # `zip()` without an explicit `strict=` parameter -- FIX ME
   "E741",     # Ambiguous variable name 'l' -- FIX ME
   "EM101",    # Exception must not use a string literal, assign to variable first
-  "EXE001",   # Shebang is present but file is not executable" -- FIX ME
   "G004",     # Logging statement uses f-string
   "INP001",   # File `x/y/z.py` is part of an implicit namespace package. Add an `__init__.py`. -- FIX ME
   "PGH003",   # Use specific rule codes when ignoring type issues -- FIX ME

searches/binary_search.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 Pure Python implementations of binary search algorithms
 

sorts/bucket_sort.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 """
 Illustrate how to implement bucket sort algorithm.
 

sorts/external_sort.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python
-
 #
 # Sort large text files in a minimum amount of memory
 #

web_programming/fetch_github_info.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 """
 Created by sarathkaul on 14/11/19
 Updated by lawric1 on 24/11/20

web_programming/giphy.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 import requests
 
 giphy_api_key = "YOUR API KEY"

web_programming/instagram_crawler.py

@@ -1,4 +1,3 @@
-#!/usr/bin/env python3
 from __future__ import annotations
 
 import json

web_programming/world_covid19_stats.py

@@ -1,5 +1,3 @@
-#!/usr/bin/env python3
-
 """
 Provide the current worldwide COVID-19 statistics.
 This data is being scrapped from 'https://www.worldometers.info/coronavirus/'.