laksh9950

GROKKING NOTES

The following problems are equvalent of Grokking the coding interview course, and solutions are also attached

Pattern: Sliding Window

• Maximum Subarray # Close enough -> Solution
• Minimum Size Subarray Sum -> Solution
• Longest Substring with At Most K Distinct Characters -> Solution
• Fruit Into Baskets -> [Solution](https://github.com/motaher13/Solved-OJ-problems/blob/master/LeetCode/Array/Fruit

laksh9950

All of the python 3.9 standard library

abc

• abc.ABC
• abc.ABCMeta
• abc.ABCMeta.register
• abc.ABCMeta.__subclasshook__
• abc.abstractmethod
• abc.abstractclassmethod

laksh9950

# Authors: Mathieu Blondel, Vlad Niculae
# License: BSD 3 clause

import numpy as np


def _gen_pairs(gen, max_iter, max_inner, random_state, verbose):
    rng = np.random.RandomState(random_state)

    # if tuple, interpret as randn

laksh9950

import os
import pandas as pd
from sklearn.model_selection import train_test_split, StratifiedKFold
from sklearn.metrics import classification_report, confusion_matrix, log_loss, accuracy_score, roc_auc_score
import numpy as np
from catboost import CatBoostClassifier, Pool, cv
from datetime import date, timedelta
#import shap
import matplotlib.pyplot as pl
#from imblearn.over_sampling import SMOTENC