diff --git a/assets/js/09b34d89.20ed683f.js b/assets/js/09b34d89.20ed683f.js
new file mode 100644
index 00000000..5320c700
--- /dev/null
+++ b/assets/js/09b34d89.20ed683f.js
@@ -0,0 +1 @@
+"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[8906],{9109:(e,t,n)=>{n.r(t),n.d(t,{assets:()=>l,contentTitle:()=>i,default:()=>p,frontMatter:()=>a,metadata:()=>c,toc:()=>s});var r=n(4848),o=n(5680);const a={id:"leet-code",title:"Leet Code"},i=void 0,c={id:"leet-code/leet-code",title:"Leet Code",description:"I'm using this page to document my Leet Code journey. I'll be adding notes on different topics and problems that I solve on Leet Code.",source:"@site/my-brain/leet-code/index.md",sourceDirName:"leet-code",slug:"/leet-code/",permalink:"/my-brain/leet-code/",draft:!1,unlisted:!1,tags:[],version:"current",frontMatter:{id:"leet-code",title:"Leet Code"},sidebar:"myBrainSidebar",previous:{title:"Javascript",permalink:"/my-brain/javascript/"},next:{title:"Arrays and Hashing",permalink:"/my-brain/leet-code/arrays-and-hashing"}},l={},s=[];function d(e){const t={a:"a",p:"p",...(0,o.RP)(),...e.components};return(0,r.jsxs)(r.Fragment,{children:[(0,r.jsx)(t.p,{children:"I'm using this page to document my Leet Code journey. I'll be adding notes on different topics and problems that I solve on Leet Code."}),"\n",(0,r.jsx)(t.p,{children:(0,r.jsx)(t.a,{href:"https://neetcode.io/",children:"Neet Code"})})]})}function p(e={}){const{wrapper:t}={...(0,o.RP)(),...e.components};return t?(0,r.jsx)(t,{...e,children:(0,r.jsx)(d,{...e})}):d(e)}},5680:(e,t,n)=>{n.d(t,{RP:()=>s});var r=n(6540);function o(e,t,n){return t in e?Object.defineProperty(e,t,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[t]=n,e}function a(e,t){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(e);t&&(r=r.filter((function(t){return Object.getOwnPropertyDescriptor(e,t).enumerable}))),n.push.apply(n,r)}return n}function i(e){for(var t=1;t=0||(o[n]=e[n]);return o}(e,t);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);for(r=0;r=0||Object.prototype.propertyIsEnumerable.call(e,n)&&(o[n]=e[n])}return o}var l=r.createContext({}),s=function(e){var t=r.useContext(l),n=t;return e&&(n="function"==typeof e?e(t):i(i({},t),e)),n},d={inlineCode:"code",wrapper:function(e){var t=e.children;return r.createElement(r.Fragment,{},t)}},p=r.forwardRef((function(e,t){var n=e.components,o=e.mdxType,a=e.originalType,l=e.parentName,p=c(e,["components","mdxType","originalType","parentName"]),u=s(n),f=o,m=u["".concat(l,".").concat(f)]||u[f]||d[f]||a;return n?r.createElement(m,i(i({ref:t},p),{},{components:n})):r.createElement(m,i({ref:t},p))}));p.displayName="MDXCreateElement"}}]);
\ No newline at end of file
diff --git a/assets/js/8eb0b182.27844ae7.js b/assets/js/8eb0b182.27844ae7.js
new file mode 100644
index 00000000..482eb2f9
--- /dev/null
+++ b/assets/js/8eb0b182.27844ae7.js
@@ -0,0 +1 @@
+"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[4249],{9185:e=>{e.exports=JSON.parse('{"version":{"pluginId":"default","version":"current","label":"Next","banner":null,"badge":false,"noIndex":false,"className":"docs-version-current","isLast":true,"docsSidebars":{"myBrainSidebar":[{"type":"category","label":"Concurrent Programming","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Basic Synchronization Patterns","href":"/my-brain/concurrent-programming/basic-synchronization-patterns","docId":"concurrent-programming/basic-synchronization-patterns","unlisted":false},{"type":"link","label":"Classical Synchronization Problems","href":"/my-brain/concurrent-programming/classical-synchronization-problems","docId":"concurrent-programming/classical-synchronization-problems","unlisted":false},{"type":"link","label":"Concurrency vs Parallelism","href":"/my-brain/concurrent-programming/concurrency-vs-parallelism","docId":"concurrent-programming/concurrency-vs-parallelism","unlisted":false},{"type":"link","label":"Semaphore","href":"/my-brain/concurrent-programming/semaphore","docId":"concurrent-programming/semaphore","unlisted":false},{"type":"link","label":"Mutual Exclusion Algorithms","href":"/my-brain/concurrent-programming/some-algorithms","docId":"concurrent-programming/some-algorithms","unlisted":false},{"type":"link","label":"Threads and Process in Python","href":"/my-brain/concurrent-programming/threads-and-process-in-python","docId":"concurrent-programming/threads-and-process-in-python","unlisted":false}],"href":"/my-brain/concurrent-programming/"},{"type":"category","label":"Data Science","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Correlation","href":"/my-brain/data-science/correlation","docId":"data-science/correlation","unlisted":false},{"type":"link","label":"Histogram","href":"/my-brain/data-science/histogram","docId":"data-science/histogram","unlisted":false},{"type":"category","label":"Machine Learning","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"K-Means Clustering","href":"/my-brain/data-science/machine-learning/k-means-clustering","docId":"data-science/machine-learning/k-means-clustering","unlisted":false},{"type":"category","label":"Machine Learning Specialist Course","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Genetic Algorithms","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","unlisted":false},{"type":"link","label":"Introduction","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","unlisted":false},{"type":"link","label":"Support Vector Machine","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","unlisted":false},{"type":"link","label":"Unsupervised Machine Learning","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","unlisted":false}],"href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/"}],"href":"/my-brain/data-science/machine-learning/"}],"href":"/my-brain/data-science/"},{"type":"category","label":"Database","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Types of Data Model","href":"/my-brain/databases/data-model-types","docId":"databases/data-model-types","unlisted":false},{"type":"link","label":"Disk Storage, Basic File Structures and Hashing","href":"/my-brain/databases/disk-storage-file-structures-and-hashing","docId":"databases/disk-storage-file-structures-and-hashing","unlisted":false},{"type":"link","label":"SQLite","href":"/my-brain/databases/sqlite","docId":"databases/sqlite","unlisted":false}],"href":"/my-brain/databases/"},{"type":"category","label":"Gamedev with Godot","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Autoloads","href":"/my-brain/godot/godot-autoloads","docId":"godot/godot-autoloads","unlisted":false},{"type":"link","label":"Changing Scenes","href":"/my-brain/godot/changing-scenes","docId":"godot/changing-scenes","unlisted":false},{"type":"link","label":"Groups","href":"/my-brain/godot/godot-groups","docId":"godot/godot-groups","unlisted":false},{"type":"link","label":"Input Mapping","href":"/my-brain/godot/input-mapping","docId":"godot/input-mapping","unlisted":false},{"type":"link","label":"Nodes","href":"/my-brain/godot/godot-nodes","docId":"godot/godot-nodes","unlisted":false},{"type":"link","label":"Pausing","href":"/my-brain/godot/dogot-pausing","docId":"godot/dogot-pausing","unlisted":false},{"type":"link","label":"Scenes","href":"/my-brain/godot/godot-scenes","docId":"godot/godot-scenes","unlisted":false},{"type":"link","label":"Signals","href":"/my-brain/godot/godot-signals","docId":"godot/godot-signals","unlisted":false}],"href":"/my-brain/godot/"},{"type":"link","label":"inter-process-communication","href":"/my-brain/Inter-Process Communication","docId":"Inter-Process Communication","unlisted":false},{"type":"link","label":"Javascript","href":"/my-brain/javascript/","docId":"javascript/javascript","unlisted":false},{"type":"category","label":"Leet Code","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Arrays and Hashing","href":"/my-brain/leet-code/arrays-and-hashing","docId":"leet-code/arrays-and-hashing","unlisted":false}],"href":"/my-brain/leet-code/"},{"type":"category","label":"Linux","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Driver Development","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Make and Makefile","href":"/my-brain/linux/driver-development/make-and-makefile","docId":"linux/driver-development/make-and-makefile","unlisted":false}],"href":"/my-brain/linux/driver-development/"},{"type":"link","label":"Driver","href":"/my-brain/linux/driver","docId":"linux/driver","unlisted":false},{"type":"link","label":"Files","href":"/my-brain/linux/files","docId":"linux/files","unlisted":false},{"type":"link","label":"Linux Kernel","href":"/my-brain/linux/linux-kernel","docId":"linux/linux-kernel","unlisted":false},{"type":"link","label":"System Call","href":"/my-brain/linux/system-call","docId":"linux/system-call","unlisted":false}],"href":"/my-brain/linux/"},{"type":"category","label":"Machine Learning and Data Science from A to Z","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Classification","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"decision-tree","href":"/my-brain/machine-learning-and-data-science-course/classification/decision-trees/","docId":"machine-learning-and-data-science-course/classification/decision-trees/decision-tree","unlisted":false},{"type":"category","label":"naive-bayes","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"How it works","href":"/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","docId":"machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","unlisted":false}],"href":"/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/"}],"href":"/my-brain/machine-learning-and-data-science-course/classification/"},{"type":"link","label":"Computer Vision","href":"/my-brain/machine-learning-and-data-science-course/computer-vision","docId":"machine-learning-and-data-science-course/computer-vision","unlisted":false},{"type":"category","label":"Data Pre-processing","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Categorical Variables","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/categorical-variables","docId":"machine-learning-and-data-science-course/data-pre-processing/categorical-variables","unlisted":false},{"type":"link","label":"Data Standardization","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/data-standardization","docId":"machine-learning-and-data-science-course/data-pre-processing/data-standardization","unlisted":false},{"type":"link","label":"Handle Inconsistent Data","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","docId":"machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","unlisted":false},{"type":"link","label":"Split Data","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/split-data","docId":"machine-learning-and-data-science-course/data-pre-processing/split-data","unlisted":false},{"type":"link","label":"Variables Types","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/variables-types","docId":"machine-learning-and-data-science-course/data-pre-processing/variables-types","unlisted":false}],"href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/"},{"type":"link","label":"Dimensionality Reduction","href":"/my-brain/machine-learning-and-data-science-course/dimensionality-reduction","docId":"machine-learning-and-data-science-course/dimensionality-reduction","unlisted":false},{"type":"link","label":"Feature Engineering and Selection","href":"/my-brain/machine-learning-and-data-science-course/feature-engineering-and-selection","docId":"machine-learning-and-data-science-course/feature-engineering-and-selection","unlisted":false},{"type":"link","label":"Model Validation","href":"/my-brain/machine-learning-and-data-science-course/model-validation","docId":"machine-learning-and-data-science-course/model-validation","unlisted":false},{"type":"link","label":"Outliers","href":"/my-brain/machine-learning-and-data-science-course/outliers","docId":"machine-learning-and-data-science-course/outliers","unlisted":false},{"type":"link","label":"Resampling","href":"/my-brain/machine-learning-and-data-science-course/resampling","docId":"machine-learning-and-data-science-course/resampling","unlisted":false},{"type":"link","label":"Time Series","href":"/my-brain/machine-learning-and-data-science-course/time-series","docId":"machine-learning-and-data-science-course/time-series","unlisted":false}],"href":"/my-brain/machine-learning-and-data-science-course/"},{"type":"category","label":"Math","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Probability","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Bayes Theorem","href":"/my-brain/math/probability/bayes-theorem","docId":"math/probability/bayes-theorem","unlisted":false}],"href":"/my-brain/math/probability/"}],"href":"/my-brain/math/"},{"type":"link","label":"What I am learning","href":"/my-brain/what-i-am-learning","docId":"what-i-am-learning","unlisted":false},{"type":"link","label":"System Design","href":"/my-brain/system-design","docId":"system-design","unlisted":false}]},"docs":{"concurrent-programming/basic-synchronization-patterns":{"id":"concurrent-programming/basic-synchronization-patterns","title":"Basic Synchronization Patterns","description":"This are the basic synchronization patterns that can be used to solve a variety of synchronization problems.","sidebar":"myBrainSidebar"},"concurrent-programming/classical-synchronization-problems":{"id":"concurrent-programming/classical-synchronization-problems","title":"Classical Synchronization Problems","description":"Producer-Consumer Problem","sidebar":"myBrainSidebar"},"concurrent-programming/concurrency-vs-parallelism":{"id":"concurrent-programming/concurrency-vs-parallelism","title":"Concurrency vs Parallelism","description":"Alt text","sidebar":"myBrainSidebar"},"concurrent-programming/concurrent-programming":{"id":"concurrent-programming/concurrent-programming","title":"Concurrent Programming","description":"This section contains my notes take during my \\"Programa\xe7\xe3o Concorrente\\" classes at Universidade Federal de Campina Grande.","sidebar":"myBrainSidebar"},"concurrent-programming/semaphore":{"id":"concurrent-programming/semaphore","title":"Semaphore","description":"Before understand what is a semaphore, we need to understand some concepts:","sidebar":"myBrainSidebar"},"concurrent-programming/some-algorithms":{"id":"concurrent-programming/some-algorithms","title":"Mutual Exclusion Algorithms","description":"This Algorithms has the objective to solve the problem of the critical region, where only one process can be at a time to prevent race condition, deadlocks and data inconsistences. This is called Mutual Exclusion.","sidebar":"myBrainSidebar"},"concurrent-programming/threads-and-process-in-python":{"id":"concurrent-programming/threads-and-process-in-python","title":"Threads and Process in Python","description":"Introduction","sidebar":"myBrainSidebar"},"data-science/correlation":{"id":"data-science/correlation","title":"Correlation","description":"WORK IN PROGRESS","sidebar":"myBrainSidebar"},"data-science/data-science":{"id":"data-science/data-science","title":"Data Science","description":"Hera is a collection of notes about Data Science.","sidebar":"myBrainSidebar"},"data-science/histogram":{"id":"data-science/histogram","title":"Histogram","description":"Histogram is a graphical used to visualize the distribution of a numerical variable. It is a type of bar chart that shows the frequency of each value.","sidebar":"myBrainSidebar"},"data-science/machine-learning/k-means-clustering":{"id":"data-science/machine-learning/k-means-clustering","title":"K-Means Clustering","description":"K-Means Clustering is an unsupervided machine learning model, that belongs to the class of clustering algotithms.","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning":{"id":"data-science/machine-learning/machine-learning","title":"Machine Learning","description":"Hera is a collection of notes about Machine Learning.","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course","title":"Machine Learning Specialist Course","description":"This is the notes that I take during the course from Digital Innovation One.","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","title":"Genetic Algorithms","description":"What is a Genetic Algorithm?","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","title":"Introduction","description":"Introduction","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","title":"Support Vector Machine","description":"alt text","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","title":"Unsupervised Machine Learning","description":"It\'s used when we can\'t label the data, so the machine should work by it\'s own to find the patterns.","sidebar":"myBrainSidebar"},"databases/data-model-types":{"id":"databases/data-model-types","title":"Types of Data Model","description":"1. Conceptual Data Models","sidebar":"myBrainSidebar"},"databases/database":{"id":"databases/database","title":"Database","description":"This section is about databases.","sidebar":"myBrainSidebar"},"databases/disk-storage-file-structures-and-hashing":{"id":"databases/disk-storage-file-structures-and-hashing","title":"Disk Storage, Basic File Structures and Hashing","description":"This are the notes that I during a DB class on College","sidebar":"myBrainSidebar"},"databases/sqlite":{"id":"databases/sqlite","title":"SQLite","description":"Summary:","sidebar":"myBrainSidebar"},"godot/changing-scenes":{"id":"godot/changing-scenes","title":"Changing Scenes","description":"In Godot, we have two ways to change scenes:","sidebar":"myBrainSidebar"},"godot/dogot-pausing":{"id":"godot/dogot-pausing","title":"Pausing","description":"Godot has a built-in pausing system that can be used to pause the game. This is useful for when you want to pause the game when the player presses the pause button.","sidebar":"myBrainSidebar"},"godot/godot":{"id":"godot/godot","title":"Gamedev with Godot","description":"So I start to feel that I need to build a game, cause I always wanted to do it. So here is the road map that I am following to learn how to build games with Godot.","sidebar":"myBrainSidebar"},"godot/godot-autoloads":{"id":"godot/godot-autoloads","title":"Autoloads","description":"AutoLoads are a way to shared data between scenes in Godot.","sidebar":"myBrainSidebar"},"godot/godot-groups":{"id":"godot/godot-groups","title":"Groups","description":"In Godot, we can use groups to organize our nodes. We can add nodes to a group and then access all nodes in that group.","sidebar":"myBrainSidebar"},"godot/godot-nodes":{"id":"godot/godot-nodes","title":"Nodes","description":"Nodes are the smallest components of a scene.","sidebar":"myBrainSidebar"},"godot/godot-scenes":{"id":"godot/godot-scenes","title":"Scenes","description":"Scenes are the components/objects of the game. We can break down a game in a lot of reusable scenes. The scenes are composed of nodes, that can be anything from a sprite to a camera.","sidebar":"myBrainSidebar"},"godot/godot-signals":{"id":"godot/godot-signals","title":"Signals","description":"Signals are a way to communicate between nodes in Godot.","sidebar":"myBrainSidebar"},"godot/input-mapping":{"id":"godot/input-mapping","title":"Input Mapping","description":"Input Mapping is a way to map user inputs to actions in Godot. We can define input actions in the project settings and then use them in our scripts.","sidebar":"myBrainSidebar"},"Inter-Process Communication":{"id":"Inter-Process Communication","title":"inter-process-communication","description":"All the time the processes need to communicate with each other to exchange information, like a server with a database, this process is called Inter-Process Communication.","sidebar":"myBrainSidebar"},"javascript/javascript":{"id":"javascript/javascript","title":"Javascript","description":"Things that I wanna study:","sidebar":"myBrainSidebar"},"leet-code/arrays-and-hashing":{"id":"leet-code/arrays-and-hashing","title":"Arrays and Hashing","description":"Dynamic Array","sidebar":"myBrainSidebar"},"leet-code/leet-code":{"id":"leet-code/leet-code","title":"Leet Code","description":"I\'m using this page to document my Leet Code journey. I\'ll be adding notes on different topics and problems that I solve on Leet Code.","sidebar":"myBrainSidebar"},"linux/driver":{"id":"linux/driver","title":"Driver","description":"alt text","sidebar":"myBrainSidebar"},"linux/driver-development/drive-development":{"id":"linux/driver-development/drive-development","title":"Driver Development","description":"The most simple drive code had to have the functions moduleinit and moduleexit to initialize and finalize the module. This are C macros that are defined in the linux/init.h header file.","sidebar":"myBrainSidebar"},"linux/driver-development/make-and-makefile":{"id":"linux/driver-development/make-and-makefile","title":"Make and Makefile","description":"Make","sidebar":"myBrainSidebar"},"linux/files":{"id":"linux/files","title":"Files","description":"Files are a fundamental concept in Linux and other operating systems. They are used to store data, programs, and other information on disk. In Linux, files are organized into a hierarchical directory structure, with directories containing files and other directories. This structure is similar to a tree, with the root directory at the top and subdirectories branching off from it.","sidebar":"myBrainSidebar"},"linux/linux":{"id":"linux/linux","title":"Linux","description":"Some notes about Linux.","sidebar":"myBrainSidebar"},"linux/linux-kernel":{"id":"linux/linux-kernel","title":"Linux Kernel","description":"The Linux kernel is the core of the Linux operating system. It is responsible for managing hardware resources, scheduling processes, and providing a secure environment for applications to run.","sidebar":"myBrainSidebar"},"linux/system-call":{"id":"linux/system-call","title":"System Call","description":"System calls are the API interface between the user programs and the kernel. The kernel provides a set of system calls that user programs can use to request services from the kernel.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/classification":{"id":"machine-learning-and-data-science-course/classification/classification","title":"Classification","description":"- Pre-processing and preparation of the data for classification","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/decision-trees/decision-tree":{"id":"machine-learning-and-data-science-course/classification/decision-trees/decision-tree","title":"decision-tree","description":"Decision trees are a popular machine learning algorithm used for classification and regression tasks. They are easy to interpret and visualize, making them a popular choice for decision-making tasks.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/naive-bayes/how-it-works":{"id":"machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","title":"How it works","description":"1. We create a probability table for each class.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/naive-bayes/naive-bayes":{"id":"machine-learning-and-data-science-course/classification/naive-bayes/naive-bayes","title":"naive-bayes","description":"Naive Bayes is a classification algorithm based on Bayes\' theorem. It is simple and fast, and it is often used as a baseline for comparison with other more complex algorithms.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/computer-vision":{"id":"machine-learning-and-data-science-course/computer-vision","title":"Computer Vision","description":"Computer vision is a field of artificial intelligence that focuses on enabling computers to interpret and understand the visual world. It involves the development of algorithms and techniques that allow computers to extract information from images or videos.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/categorical-variables":{"id":"machine-learning-and-data-science-course/data-pre-processing/categorical-variables","title":"Categorical Variables","description":"To use some variables that are categorical we need to transform them into numerical values. This process is known as encoding or feature encoding.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/data-pre-processing":{"id":"machine-learning-and-data-science-course/data-pre-processing/data-pre-processing","title":"Data Pre-processing","description":"Data pre-processing is a crucial step in the data analysis process. It involves cleaning, transforming, and preparing raw data into a format suitable for analysis. The quality of the data and the accuracy of the results depend on the pre-processing steps. Here are some common data pre-processing techniques:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/data-standardization":{"id":"machine-learning-and-data-science-course/data-pre-processing/data-standardization","title":"Data Standardization","description":"Whem working with some algorithms, we need to standardize the data to a common scale, cause some algorithms are sensitive to the scale of the input data.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data":{"id":"machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","title":"Handle Inconsistent Data","description":"The best way to handle inconsistent values depends on the dataset and the problem you are trying to solve. Here are some common strategies:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/split-data":{"id":"machine-learning-and-data-science-course/data-pre-processing/split-data","title":"Split Data","description":"We need to split the data in previsor variables and target variable. We will use the previsor variables to predict the target variable. The target variable is the variable we are trying to predict.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/variables-types":{"id":"machine-learning-and-data-science-course/data-pre-processing/variables-types","title":"Variables Types","description":"We need to now the variables types to better use and choose the right algorithms.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/dimensionality-reduction":{"id":"machine-learning-and-data-science-course/dimensionality-reduction","title":"Dimensionality Reduction","description":"Feature selection X Feature extraction","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/feature-engineering-and-selection":{"id":"machine-learning-and-data-science-course/feature-engineering-and-selection","title":"Feature Engineering and Selection","description":"It\'s note true that more atributtes will make a model better.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/machine-learning-and-data-science-course":{"id":"machine-learning-and-data-science-course/machine-learning-and-data-science-course","title":"Machine Learning and Data Science from A to Z","description":"Part 1 - Classification","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/model-validation":{"id":"machine-learning-and-data-science-course/model-validation","title":"Model Validation","description":"Model validation is the process of evaluating the performance of a machine learning model. It is essential to ensure that the model generalizes well to new, unseen data. There are several techniques for model validation, including:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/outliers":{"id":"machine-learning-and-data-science-course/outliers","title":"Outliers","description":"Outliers are:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/resampling":{"id":"machine-learning-and-data-science-course/resampling","title":"Resampling","description":"alt text","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/time-series":{"id":"machine-learning-and-data-science-course/time-series","title":"Time Series","description":"Time series data is a sequence of data points collected at regular intervals over time. It is used in various fields such as finance, economics, weather forecasting, and signal processing. Time series analysis involves analyzing, modeling, and forecasting the patterns in the data.","sidebar":"myBrainSidebar"},"math/math":{"id":"math/math","title":"Math","description":"This section is about math.","sidebar":"myBrainSidebar"},"math/probability/bayes-theorem":{"id":"math/probability/bayes-theorem","title":"Bayes Theorem","description":"Bayes\' Theorem is a fundamental theorem in probability theory that describes the probability of an event, based on prior knowledge of conditions that might be related to the event.","sidebar":"myBrainSidebar"},"math/probability/probability":{"id":"math/probability/probability","title":"Probability","description":"Probability is the branch of mathematics that deals with how likely an event is to occur or how likely it is that a proposition is true.","sidebar":"myBrainSidebar"},"system-design":{"id":"system-design","title":"System Design","description":"Contents that I want to learn about distributed systems:","sidebar":"myBrainSidebar"},"what-i-am-learning":{"id":"what-i-am-learning","title":"What I am learning","description":"This section contains the info about what I am learning.","sidebar":"myBrainSidebar"}}}}')}}]);
\ No newline at end of file
diff --git a/assets/js/8eb0b182.a721ae14.js b/assets/js/8eb0b182.a721ae14.js
deleted file mode 100644
index 0dbc1fdb..00000000
--- a/assets/js/8eb0b182.a721ae14.js
+++ /dev/null
@@ -1 +0,0 @@
-"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[4249],{9185:e=>{e.exports=JSON.parse('{"version":{"pluginId":"default","version":"current","label":"Next","banner":null,"badge":false,"noIndex":false,"className":"docs-version-current","isLast":true,"docsSidebars":{"myBrainSidebar":[{"type":"category","label":"Concurrent Programming","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Basic Synchronization Patterns","href":"/my-brain/concurrent-programming/basic-synchronization-patterns","docId":"concurrent-programming/basic-synchronization-patterns","unlisted":false},{"type":"link","label":"Classical Synchronization Problems","href":"/my-brain/concurrent-programming/classical-synchronization-problems","docId":"concurrent-programming/classical-synchronization-problems","unlisted":false},{"type":"link","label":"Concurrency vs Parallelism","href":"/my-brain/concurrent-programming/concurrency-vs-parallelism","docId":"concurrent-programming/concurrency-vs-parallelism","unlisted":false},{"type":"link","label":"Semaphore","href":"/my-brain/concurrent-programming/semaphore","docId":"concurrent-programming/semaphore","unlisted":false},{"type":"link","label":"Mutual Exclusion Algorithms","href":"/my-brain/concurrent-programming/some-algorithms","docId":"concurrent-programming/some-algorithms","unlisted":false},{"type":"link","label":"Threads and Process in Python","href":"/my-brain/concurrent-programming/threads-and-process-in-python","docId":"concurrent-programming/threads-and-process-in-python","unlisted":false}],"href":"/my-brain/concurrent-programming/"},{"type":"category","label":"Data Science","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Correlation","href":"/my-brain/data-science/correlation","docId":"data-science/correlation","unlisted":false},{"type":"link","label":"Histogram","href":"/my-brain/data-science/histogram","docId":"data-science/histogram","unlisted":false},{"type":"category","label":"Machine Learning","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"K-Means Clustering","href":"/my-brain/data-science/machine-learning/k-means-clustering","docId":"data-science/machine-learning/k-means-clustering","unlisted":false},{"type":"category","label":"Machine Learning Specialist Course","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Genetic Algorithms","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","unlisted":false},{"type":"link","label":"Introduction","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","unlisted":false},{"type":"link","label":"Support Vector Machine","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","unlisted":false},{"type":"link","label":"Unsupervised Machine Learning","href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","docId":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","unlisted":false}],"href":"/my-brain/data-science/machine-learning/machine-learning-specialist-course/"}],"href":"/my-brain/data-science/machine-learning/"}],"href":"/my-brain/data-science/"},{"type":"category","label":"Database","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Types of Data Model","href":"/my-brain/databases/data-model-types","docId":"databases/data-model-types","unlisted":false},{"type":"link","label":"Disk Storage, Basic File Structures and Hashing","href":"/my-brain/databases/disk-storage-file-structures-and-hashing","docId":"databases/disk-storage-file-structures-and-hashing","unlisted":false},{"type":"link","label":"SQLite","href":"/my-brain/databases/sqlite","docId":"databases/sqlite","unlisted":false}],"href":"/my-brain/databases/"},{"type":"category","label":"Gamedev with Godot","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Autoloads","href":"/my-brain/godot/godot-autoloads","docId":"godot/godot-autoloads","unlisted":false},{"type":"link","label":"Changing Scenes","href":"/my-brain/godot/changing-scenes","docId":"godot/changing-scenes","unlisted":false},{"type":"link","label":"Groups","href":"/my-brain/godot/godot-groups","docId":"godot/godot-groups","unlisted":false},{"type":"link","label":"Input Mapping","href":"/my-brain/godot/input-mapping","docId":"godot/input-mapping","unlisted":false},{"type":"link","label":"Nodes","href":"/my-brain/godot/godot-nodes","docId":"godot/godot-nodes","unlisted":false},{"type":"link","label":"Pausing","href":"/my-brain/godot/dogot-pausing","docId":"godot/dogot-pausing","unlisted":false},{"type":"link","label":"Scenes","href":"/my-brain/godot/godot-scenes","docId":"godot/godot-scenes","unlisted":false},{"type":"link","label":"Signals","href":"/my-brain/godot/godot-signals","docId":"godot/godot-signals","unlisted":false}],"href":"/my-brain/godot/"},{"type":"link","label":"inter-process-communication","href":"/my-brain/Inter-Process Communication","docId":"Inter-Process Communication","unlisted":false},{"type":"link","label":"Javascript","href":"/my-brain/javascript/","docId":"javascript/javascript","unlisted":false},{"type":"category","label":"leet-code","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Arrays and Hashing","href":"/my-brain/leet-code/arrays-and-hashing","docId":"leet-code/arrays-and-hashing","unlisted":false}]},{"type":"category","label":"Linux","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Driver Development","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Make and Makefile","href":"/my-brain/linux/driver-development/make-and-makefile","docId":"linux/driver-development/make-and-makefile","unlisted":false}],"href":"/my-brain/linux/driver-development/"},{"type":"link","label":"Driver","href":"/my-brain/linux/driver","docId":"linux/driver","unlisted":false},{"type":"link","label":"Files","href":"/my-brain/linux/files","docId":"linux/files","unlisted":false},{"type":"link","label":"Linux Kernel","href":"/my-brain/linux/linux-kernel","docId":"linux/linux-kernel","unlisted":false},{"type":"link","label":"System Call","href":"/my-brain/linux/system-call","docId":"linux/system-call","unlisted":false}],"href":"/my-brain/linux/"},{"type":"category","label":"Machine Learning and Data Science from A to Z","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Classification","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"decision-tree","href":"/my-brain/machine-learning-and-data-science-course/classification/decision-trees/","docId":"machine-learning-and-data-science-course/classification/decision-trees/decision-tree","unlisted":false},{"type":"category","label":"naive-bayes","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"How it works","href":"/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","docId":"machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","unlisted":false}],"href":"/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/"}],"href":"/my-brain/machine-learning-and-data-science-course/classification/"},{"type":"link","label":"Computer Vision","href":"/my-brain/machine-learning-and-data-science-course/computer-vision","docId":"machine-learning-and-data-science-course/computer-vision","unlisted":false},{"type":"category","label":"Data Pre-processing","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Categorical Variables","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/categorical-variables","docId":"machine-learning-and-data-science-course/data-pre-processing/categorical-variables","unlisted":false},{"type":"link","label":"Data Standardization","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/data-standardization","docId":"machine-learning-and-data-science-course/data-pre-processing/data-standardization","unlisted":false},{"type":"link","label":"Handle Inconsistent Data","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","docId":"machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","unlisted":false},{"type":"link","label":"Split Data","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/split-data","docId":"machine-learning-and-data-science-course/data-pre-processing/split-data","unlisted":false},{"type":"link","label":"Variables Types","href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/variables-types","docId":"machine-learning-and-data-science-course/data-pre-processing/variables-types","unlisted":false}],"href":"/my-brain/machine-learning-and-data-science-course/data-pre-processing/"},{"type":"link","label":"Dimensionality Reduction","href":"/my-brain/machine-learning-and-data-science-course/dimensionality-reduction","docId":"machine-learning-and-data-science-course/dimensionality-reduction","unlisted":false},{"type":"link","label":"Feature Engineering and Selection","href":"/my-brain/machine-learning-and-data-science-course/feature-engineering-and-selection","docId":"machine-learning-and-data-science-course/feature-engineering-and-selection","unlisted":false},{"type":"link","label":"Model Validation","href":"/my-brain/machine-learning-and-data-science-course/model-validation","docId":"machine-learning-and-data-science-course/model-validation","unlisted":false},{"type":"link","label":"Outliers","href":"/my-brain/machine-learning-and-data-science-course/outliers","docId":"machine-learning-and-data-science-course/outliers","unlisted":false},{"type":"link","label":"Resampling","href":"/my-brain/machine-learning-and-data-science-course/resampling","docId":"machine-learning-and-data-science-course/resampling","unlisted":false},{"type":"link","label":"Time Series","href":"/my-brain/machine-learning-and-data-science-course/time-series","docId":"machine-learning-and-data-science-course/time-series","unlisted":false}],"href":"/my-brain/machine-learning-and-data-science-course/"},{"type":"category","label":"Math","collapsible":true,"collapsed":true,"items":[{"type":"category","label":"Probability","collapsible":true,"collapsed":true,"items":[{"type":"link","label":"Bayes Theorem","href":"/my-brain/math/probability/bayes-theorem","docId":"math/probability/bayes-theorem","unlisted":false}],"href":"/my-brain/math/probability/"}],"href":"/my-brain/math/"},{"type":"link","label":"What I am learning","href":"/my-brain/what-i-am-learning","docId":"what-i-am-learning","unlisted":false},{"type":"link","label":"System Design","href":"/my-brain/system-design","docId":"system-design","unlisted":false}]},"docs":{"concurrent-programming/basic-synchronization-patterns":{"id":"concurrent-programming/basic-synchronization-patterns","title":"Basic Synchronization Patterns","description":"This are the basic synchronization patterns that can be used to solve a variety of synchronization problems.","sidebar":"myBrainSidebar"},"concurrent-programming/classical-synchronization-problems":{"id":"concurrent-programming/classical-synchronization-problems","title":"Classical Synchronization Problems","description":"Producer-Consumer Problem","sidebar":"myBrainSidebar"},"concurrent-programming/concurrency-vs-parallelism":{"id":"concurrent-programming/concurrency-vs-parallelism","title":"Concurrency vs Parallelism","description":"Alt text","sidebar":"myBrainSidebar"},"concurrent-programming/concurrent-programming":{"id":"concurrent-programming/concurrent-programming","title":"Concurrent Programming","description":"This section contains my notes take during my \\"Programa\xe7\xe3o Concorrente\\" classes at Universidade Federal de Campina Grande.","sidebar":"myBrainSidebar"},"concurrent-programming/semaphore":{"id":"concurrent-programming/semaphore","title":"Semaphore","description":"Before understand what is a semaphore, we need to understand some concepts:","sidebar":"myBrainSidebar"},"concurrent-programming/some-algorithms":{"id":"concurrent-programming/some-algorithms","title":"Mutual Exclusion Algorithms","description":"This Algorithms has the objective to solve the problem of the critical region, where only one process can be at a time to prevent race condition, deadlocks and data inconsistences. This is called Mutual Exclusion.","sidebar":"myBrainSidebar"},"concurrent-programming/threads-and-process-in-python":{"id":"concurrent-programming/threads-and-process-in-python","title":"Threads and Process in Python","description":"Introduction","sidebar":"myBrainSidebar"},"data-science/correlation":{"id":"data-science/correlation","title":"Correlation","description":"WORK IN PROGRESS","sidebar":"myBrainSidebar"},"data-science/data-science":{"id":"data-science/data-science","title":"Data Science","description":"Hera is a collection of notes about Data Science.","sidebar":"myBrainSidebar"},"data-science/histogram":{"id":"data-science/histogram","title":"Histogram","description":"Histogram is a graphical used to visualize the distribution of a numerical variable. It is a type of bar chart that shows the frequency of each value.","sidebar":"myBrainSidebar"},"data-science/machine-learning/k-means-clustering":{"id":"data-science/machine-learning/k-means-clustering","title":"K-Means Clustering","description":"K-Means Clustering is an unsupervided machine learning model, that belongs to the class of clustering algotithms.","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning":{"id":"data-science/machine-learning/machine-learning","title":"Machine Learning","description":"Hera is a collection of notes about Machine Learning.","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course","title":"Machine Learning Specialist Course","description":"This is the notes that I take during the course from Digital Innovation One.","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","title":"Genetic Algorithms","description":"What is a Genetic Algorithm?","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","title":"Introduction","description":"Introduction","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","title":"Support Vector Machine","description":"alt text","sidebar":"myBrainSidebar"},"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning":{"id":"data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","title":"Unsupervised Machine Learning","description":"It\'s used when we can\'t label the data, so the machine should work by it\'s own to find the patterns.","sidebar":"myBrainSidebar"},"databases/data-model-types":{"id":"databases/data-model-types","title":"Types of Data Model","description":"1. Conceptual Data Models","sidebar":"myBrainSidebar"},"databases/database":{"id":"databases/database","title":"Database","description":"This section is about databases.","sidebar":"myBrainSidebar"},"databases/disk-storage-file-structures-and-hashing":{"id":"databases/disk-storage-file-structures-and-hashing","title":"Disk Storage, Basic File Structures and Hashing","description":"This are the notes that I during a DB class on College","sidebar":"myBrainSidebar"},"databases/sqlite":{"id":"databases/sqlite","title":"SQLite","description":"Summary:","sidebar":"myBrainSidebar"},"godot/changing-scenes":{"id":"godot/changing-scenes","title":"Changing Scenes","description":"In Godot, we have two ways to change scenes:","sidebar":"myBrainSidebar"},"godot/dogot-pausing":{"id":"godot/dogot-pausing","title":"Pausing","description":"Godot has a built-in pausing system that can be used to pause the game. This is useful for when you want to pause the game when the player presses the pause button.","sidebar":"myBrainSidebar"},"godot/godot":{"id":"godot/godot","title":"Gamedev with Godot","description":"So I start to feel that I need to build a game, cause I always wanted to do it. So here is the road map that I am following to learn how to build games with Godot.","sidebar":"myBrainSidebar"},"godot/godot-autoloads":{"id":"godot/godot-autoloads","title":"Autoloads","description":"AutoLoads are a way to shared data between scenes in Godot.","sidebar":"myBrainSidebar"},"godot/godot-groups":{"id":"godot/godot-groups","title":"Groups","description":"In Godot, we can use groups to organize our nodes. We can add nodes to a group and then access all nodes in that group.","sidebar":"myBrainSidebar"},"godot/godot-nodes":{"id":"godot/godot-nodes","title":"Nodes","description":"Nodes are the smallest components of a scene.","sidebar":"myBrainSidebar"},"godot/godot-scenes":{"id":"godot/godot-scenes","title":"Scenes","description":"Scenes are the components/objects of the game. We can break down a game in a lot of reusable scenes. The scenes are composed of nodes, that can be anything from a sprite to a camera.","sidebar":"myBrainSidebar"},"godot/godot-signals":{"id":"godot/godot-signals","title":"Signals","description":"Signals are a way to communicate between nodes in Godot.","sidebar":"myBrainSidebar"},"godot/input-mapping":{"id":"godot/input-mapping","title":"Input Mapping","description":"Input Mapping is a way to map user inputs to actions in Godot. We can define input actions in the project settings and then use them in our scripts.","sidebar":"myBrainSidebar"},"Inter-Process Communication":{"id":"Inter-Process Communication","title":"inter-process-communication","description":"All the time the processes need to communicate with each other to exchange information, like a server with a database, this process is called Inter-Process Communication.","sidebar":"myBrainSidebar"},"javascript/javascript":{"id":"javascript/javascript","title":"Javascript","description":"Things that I wanna study:","sidebar":"myBrainSidebar"},"leet-code/arrays-and-hashing":{"id":"leet-code/arrays-and-hashing","title":"Arrays and Hashing","description":"Dynamic Array","sidebar":"myBrainSidebar"},"linux/driver":{"id":"linux/driver","title":"Driver","description":"alt text","sidebar":"myBrainSidebar"},"linux/driver-development/drive-development":{"id":"linux/driver-development/drive-development","title":"Driver Development","description":"The most simple drive code had to have the functions moduleinit and moduleexit to initialize and finalize the module. This are C macros that are defined in the linux/init.h header file.","sidebar":"myBrainSidebar"},"linux/driver-development/make-and-makefile":{"id":"linux/driver-development/make-and-makefile","title":"Make and Makefile","description":"Make","sidebar":"myBrainSidebar"},"linux/files":{"id":"linux/files","title":"Files","description":"Files are a fundamental concept in Linux and other operating systems. They are used to store data, programs, and other information on disk. In Linux, files are organized into a hierarchical directory structure, with directories containing files and other directories. This structure is similar to a tree, with the root directory at the top and subdirectories branching off from it.","sidebar":"myBrainSidebar"},"linux/linux":{"id":"linux/linux","title":"Linux","description":"Some notes about Linux.","sidebar":"myBrainSidebar"},"linux/linux-kernel":{"id":"linux/linux-kernel","title":"Linux Kernel","description":"The Linux kernel is the core of the Linux operating system. It is responsible for managing hardware resources, scheduling processes, and providing a secure environment for applications to run.","sidebar":"myBrainSidebar"},"linux/system-call":{"id":"linux/system-call","title":"System Call","description":"System calls are the API interface between the user programs and the kernel. The kernel provides a set of system calls that user programs can use to request services from the kernel.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/classification":{"id":"machine-learning-and-data-science-course/classification/classification","title":"Classification","description":"- Pre-processing and preparation of the data for classification","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/decision-trees/decision-tree":{"id":"machine-learning-and-data-science-course/classification/decision-trees/decision-tree","title":"decision-tree","description":"Decision trees are a popular machine learning algorithm used for classification and regression tasks. They are easy to interpret and visualize, making them a popular choice for decision-making tasks.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/naive-bayes/how-it-works":{"id":"machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","title":"How it works","description":"1. We create a probability table for each class.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/classification/naive-bayes/naive-bayes":{"id":"machine-learning-and-data-science-course/classification/naive-bayes/naive-bayes","title":"naive-bayes","description":"Naive Bayes is a classification algorithm based on Bayes\' theorem. It is simple and fast, and it is often used as a baseline for comparison with other more complex algorithms.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/computer-vision":{"id":"machine-learning-and-data-science-course/computer-vision","title":"Computer Vision","description":"Computer vision is a field of artificial intelligence that focuses on enabling computers to interpret and understand the visual world. It involves the development of algorithms and techniques that allow computers to extract information from images or videos.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/categorical-variables":{"id":"machine-learning-and-data-science-course/data-pre-processing/categorical-variables","title":"Categorical Variables","description":"To use some variables that are categorical we need to transform them into numerical values. This process is known as encoding or feature encoding.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/data-pre-processing":{"id":"machine-learning-and-data-science-course/data-pre-processing/data-pre-processing","title":"Data Pre-processing","description":"Data pre-processing is a crucial step in the data analysis process. It involves cleaning, transforming, and preparing raw data into a format suitable for analysis. The quality of the data and the accuracy of the results depend on the pre-processing steps. Here are some common data pre-processing techniques:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/data-standardization":{"id":"machine-learning-and-data-science-course/data-pre-processing/data-standardization","title":"Data Standardization","description":"Whem working with some algorithms, we need to standardize the data to a common scale, cause some algorithms are sensitive to the scale of the input data.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data":{"id":"machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","title":"Handle Inconsistent Data","description":"The best way to handle inconsistent values depends on the dataset and the problem you are trying to solve. Here are some common strategies:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/split-data":{"id":"machine-learning-and-data-science-course/data-pre-processing/split-data","title":"Split Data","description":"We need to split the data in previsor variables and target variable. We will use the previsor variables to predict the target variable. The target variable is the variable we are trying to predict.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/data-pre-processing/variables-types":{"id":"machine-learning-and-data-science-course/data-pre-processing/variables-types","title":"Variables Types","description":"We need to now the variables types to better use and choose the right algorithms.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/dimensionality-reduction":{"id":"machine-learning-and-data-science-course/dimensionality-reduction","title":"Dimensionality Reduction","description":"Feature selection X Feature extraction","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/feature-engineering-and-selection":{"id":"machine-learning-and-data-science-course/feature-engineering-and-selection","title":"Feature Engineering and Selection","description":"It\'s note true that more atributtes will make a model better.","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/machine-learning-and-data-science-course":{"id":"machine-learning-and-data-science-course/machine-learning-and-data-science-course","title":"Machine Learning and Data Science from A to Z","description":"Part 1 - Classification","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/model-validation":{"id":"machine-learning-and-data-science-course/model-validation","title":"Model Validation","description":"Model validation is the process of evaluating the performance of a machine learning model. It is essential to ensure that the model generalizes well to new, unseen data. There are several techniques for model validation, including:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/outliers":{"id":"machine-learning-and-data-science-course/outliers","title":"Outliers","description":"Outliers are:","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/resampling":{"id":"machine-learning-and-data-science-course/resampling","title":"Resampling","description":"alt text","sidebar":"myBrainSidebar"},"machine-learning-and-data-science-course/time-series":{"id":"machine-learning-and-data-science-course/time-series","title":"Time Series","description":"Time series data is a sequence of data points collected at regular intervals over time. It is used in various fields such as finance, economics, weather forecasting, and signal processing. Time series analysis involves analyzing, modeling, and forecasting the patterns in the data.","sidebar":"myBrainSidebar"},"math/math":{"id":"math/math","title":"Math","description":"This section is about math.","sidebar":"myBrainSidebar"},"math/probability/bayes-theorem":{"id":"math/probability/bayes-theorem","title":"Bayes Theorem","description":"Bayes\' Theorem is a fundamental theorem in probability theory that describes the probability of an event, based on prior knowledge of conditions that might be related to the event.","sidebar":"myBrainSidebar"},"math/probability/probability":{"id":"math/probability/probability","title":"Probability","description":"Probability is the branch of mathematics that deals with how likely an event is to occur or how likely it is that a proposition is true.","sidebar":"myBrainSidebar"},"system-design":{"id":"system-design","title":"System Design","description":"Contents that I want to learn about distributed systems:","sidebar":"myBrainSidebar"},"what-i-am-learning":{"id":"what-i-am-learning","title":"What I am learning","description":"This section contains the info about what I am learning.","sidebar":"myBrainSidebar"}}}}')}}]);
\ No newline at end of file
diff --git a/assets/js/ea960cfb.24875044.js b/assets/js/ea960cfb.24875044.js
deleted file mode 100644
index d8b0a5e2..00000000
--- a/assets/js/ea960cfb.24875044.js
+++ /dev/null
@@ -1 +0,0 @@
-"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[7647],{8968:(e,r,n)=>{n.r(r),n.d(r,{assets:()=>s,contentTitle:()=>c,default:()=>u,frontMatter:()=>a,metadata:()=>o,toc:()=>l});var t=n(4848),i=n(5680);const a={id:"javascript",title:"Javascript"},c=void 0,o={id:"javascript/javascript",title:"Javascript",description:"Things that I wanna study:",source:"@site/my-brain/javascript/index.md",sourceDirName:"javascript",slug:"/javascript/",permalink:"/my-brain/javascript/",draft:!1,unlisted:!1,tags:[],version:"current",frontMatter:{id:"javascript",title:"Javascript"},sidebar:"myBrainSidebar",previous:{title:"inter-process-communication",permalink:"/my-brain/Inter-Process Communication"},next:{title:"Arrays and Hashing",permalink:"/my-brain/leet-code/arrays-and-hashing"}},s={},l=[];function p(e){const r={li:"li",p:"p",ul:"ul",...(0,i.RP)(),...e.components};return(0,t.jsxs)(t.Fragment,{children:[(0,t.jsx)(r.p,{children:"Things that I wanna study:"}),"\n",(0,t.jsxs)(r.ul,{children:["\n",(0,t.jsx)(r.li,{children:"event loop"}),"\n",(0,t.jsx)(r.li,{children:"concorr\xeancia e paralelismo"}),"\n",(0,t.jsx)(r.li,{children:"gerenciamento de mem\xf3ria"}),"\n",(0,t.jsx)(r.li,{children:"prototypes"}),"\n",(0,t.jsx)(r.li,{children:"type coersion"}),"\n",(0,t.jsx)(r.li,{children:"diferen\xe7a entre os runtimes (node, bun, V8 e etc)"}),"\n",(0,t.jsx)(r.li,{children:"o que \xe9 ECMAScript"}),"\n"]})]})}function u(e={}){const{wrapper:r}={...(0,i.RP)(),...e.components};return r?(0,t.jsx)(r,{...e,children:(0,t.jsx)(p,{...e})}):p(e)}},5680:(e,r,n)=>{n.d(r,{RP:()=>l});var t=n(6540);function i(e,r,n){return r in e?Object.defineProperty(e,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):e[r]=n,e}function a(e,r){var n=Object.keys(e);if(Object.getOwnPropertySymbols){var t=Object.getOwnPropertySymbols(e);r&&(t=t.filter((function(r){return Object.getOwnPropertyDescriptor(e,r).enumerable}))),n.push.apply(n,t)}return n}function c(e){for(var r=1;r=0||(i[n]=e[n]);return i}(e,r);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);for(t=0;t=0||Object.prototype.propertyIsEnumerable.call(e,n)&&(i[n]=e[n])}return i}var s=t.createContext({}),l=function(e){var r=t.useContext(s),n=r;return e&&(n="function"==typeof e?e(r):c(c({},r),e)),n},p={inlineCode:"code",wrapper:function(e){var r=e.children;return t.createElement(t.Fragment,{},r)}},u=t.forwardRef((function(e,r){var n=e.components,i=e.mdxType,a=e.originalType,s=e.parentName,u=o(e,["components","mdxType","originalType","parentName"]),d=l(n),m=i,f=d["".concat(s,".").concat(m)]||d[m]||p[m]||a;return n?t.createElement(f,c(c({ref:r},u),{},{components:n})):t.createElement(f,c({ref:r},u))}));u.displayName="MDXCreateElement"}}]);
\ No newline at end of file
diff --git a/assets/js/ea960cfb.cc4c9a6a.js b/assets/js/ea960cfb.cc4c9a6a.js
new file mode 100644
index 00000000..10fe27f5
--- /dev/null
+++ b/assets/js/ea960cfb.cc4c9a6a.js
@@ -0,0 +1 @@
+"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[7647],{8968:(e,r,t)=>{t.r(r),t.d(r,{assets:()=>s,contentTitle:()=>c,default:()=>u,frontMatter:()=>a,metadata:()=>o,toc:()=>l});var n=t(4848),i=t(5680);const a={id:"javascript",title:"Javascript"},c=void 0,o={id:"javascript/javascript",title:"Javascript",description:"Things that I wanna study:",source:"@site/my-brain/javascript/index.md",sourceDirName:"javascript",slug:"/javascript/",permalink:"/my-brain/javascript/",draft:!1,unlisted:!1,tags:[],version:"current",frontMatter:{id:"javascript",title:"Javascript"},sidebar:"myBrainSidebar",previous:{title:"inter-process-communication",permalink:"/my-brain/Inter-Process Communication"},next:{title:"Leet Code",permalink:"/my-brain/leet-code/"}},s={},l=[];function p(e){const r={li:"li",p:"p",ul:"ul",...(0,i.RP)(),...e.components};return(0,n.jsxs)(n.Fragment,{children:[(0,n.jsx)(r.p,{children:"Things that I wanna study:"}),"\n",(0,n.jsxs)(r.ul,{children:["\n",(0,n.jsx)(r.li,{children:"event loop"}),"\n",(0,n.jsx)(r.li,{children:"concorr\xeancia e paralelismo"}),"\n",(0,n.jsx)(r.li,{children:"gerenciamento de mem\xf3ria"}),"\n",(0,n.jsx)(r.li,{children:"prototypes"}),"\n",(0,n.jsx)(r.li,{children:"type coersion"}),"\n",(0,n.jsx)(r.li,{children:"diferen\xe7a entre os runtimes (node, bun, V8 e etc)"}),"\n",(0,n.jsx)(r.li,{children:"o que \xe9 ECMAScript"}),"\n"]})]})}function u(e={}){const{wrapper:r}={...(0,i.RP)(),...e.components};return r?(0,n.jsx)(r,{...e,children:(0,n.jsx)(p,{...e})}):p(e)}},5680:(e,r,t)=>{t.d(r,{RP:()=>l});var n=t(6540);function i(e,r,t){return r in e?Object.defineProperty(e,r,{value:t,enumerable:!0,configurable:!0,writable:!0}):e[r]=t,e}function a(e,r){var t=Object.keys(e);if(Object.getOwnPropertySymbols){var n=Object.getOwnPropertySymbols(e);r&&(n=n.filter((function(r){return Object.getOwnPropertyDescriptor(e,r).enumerable}))),t.push.apply(t,n)}return t}function c(e){for(var r=1;r=0||(i[t]=e[t]);return i}(e,r);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);for(n=0;n=0||Object.prototype.propertyIsEnumerable.call(e,t)&&(i[t]=e[t])}return i}var s=n.createContext({}),l=function(e){var r=n.useContext(s),t=r;return e&&(t="function"==typeof e?e(r):c(c({},r),e)),t},p={inlineCode:"code",wrapper:function(e){var r=e.children;return n.createElement(n.Fragment,{},r)}},u=n.forwardRef((function(e,r){var t=e.components,i=e.mdxType,a=e.originalType,s=e.parentName,u=o(e,["components","mdxType","originalType","parentName"]),d=l(t),m=i,f=d["".concat(s,".").concat(m)]||d[m]||p[m]||a;return t?n.createElement(f,c(c({ref:r},u),{},{components:t})):n.createElement(f,c({ref:r},u))}));u.displayName="MDXCreateElement"}}]);
\ No newline at end of file
diff --git a/assets/js/fe5b346b.30737d6f.js b/assets/js/fe5b346b.30737d6f.js
deleted file mode 100644
index 210a1e9e..00000000
--- a/assets/js/fe5b346b.30737d6f.js
+++ /dev/null
@@ -1 +0,0 @@
-"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[8652],{4546:(e,n,r)=>{r.r(n),r.d(n,{assets:()=>f,contentTitle:()=>t,default:()=>h,frontMatter:()=>s,metadata:()=>l,toc:()=>o});var a=r(4848),i=r(5680);const s={id:"arrays-and-hashing",title:"Arrays and Hashing"},t=void 0,l={id:"leet-code/arrays-and-hashing",title:"Arrays and Hashing",description:"Dynamic Array",source:"@site/my-brain/leet-code/arrays-and-hashing.md",sourceDirName:"leet-code",slug:"/leet-code/arrays-and-hashing",permalink:"/my-brain/leet-code/arrays-and-hashing",draft:!1,unlisted:!1,tags:[],version:"current",frontMatter:{id:"arrays-and-hashing",title:"Arrays and Hashing"},sidebar:"myBrainSidebar",previous:{title:"Javascript",permalink:"/my-brain/javascript/"},next:{title:"Linux",permalink:"/my-brain/linux/"}},f={},o=[{value:"Dynamic Array",id:"dynamic-array",level:2},{value:"Two Pointers",id:"two-pointers",level:2},{value:"Hash Usage",id:"hash-usage",level:2},{value:"Hash Implementation",id:"hash-implementation",level:2},{value:"Hash Collision",id:"hash-collision",level:2},{value:"Hash Set",id:"hash-set",level:2},{value:"Prefix Sums",id:"prefix-sums",level:2}];function d(e){const n={code:"code",h2:"h2",p:"p",pre:"pre",...(0,i.RP)(),...e.components};return(0,a.jsxs)(a.Fragment,{children:[(0,a.jsx)(n.h2,{id:"dynamic-array",children:"Dynamic Array"}),"\n",(0,a.jsx)(n.p,{children:"Dynamic array is an array that grows in size as more elements are added to it. It is implemented by creating a new array with double the size of the original array and copying the elements from the original array to the new array."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class DynamicArray:\n def __init__(self):\n self.capacity = 1\n self.size = 0\n self.arr = [0] * self.capacity\n\n def add(self, element):\n if self.size == self.capacity:\n self.capacity *= 2\n new_arr = [0] * self.capacity\n for i in range(self.size):\n new_arr[i] = self.arr[i]\n self.arr = new_arr\n self.arr[self.size] = element\n self.size += 1\n\n def get(self, index):\n if index < 0 or index >= self.size:\n return -1\n return self.arr[index]\n\n def remove(self, index):\n if index < 0 or index >= self.size:\n return\n for i in range(index, self.size - 1):\n self.arr[i] = self.arr[i+1]\n self.size -= 1\n"})}),"\n",(0,a.jsx)(n.h2,{id:"two-pointers",children:"Two Pointers"}),"\n",(0,a.jsx)(n.p,{children:"Two pointers is a technique where two pointers are used to solve a problem. The two pointers can be used to solve problems where we need to find a pair of elements that satisfy a condition."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"def two_pointers(arr, target):\n left = 0\n right = len(arr) - 1\n while left < right:\n if arr[left] + arr[right] == target:\n return [left, right]\n elif arr[left] + arr[right] < target:\n left += 1\n else:\n right -= 1\n return [-1, -1]\n"})}),"\n",(0,a.jsx)(n.h2,{id:"hash-usage",children:"Hash Usage"}),"\n",(0,a.jsx)(n.p,{children:"Hash is a data structure that stores key-value pairs. It is used to store elements in a way that allows for fast retrieval of elements."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:'hash_map = {}\nhash_map[1] = "one"\nhash_map[2] = "two"\nhash_map[3] = "three"\n\nprint(hash_map[1]) # one\nprint(hash_map[2]) # two\nprint(hash_map[3]) # three\n'})}),"\n",(0,a.jsx)(n.h2,{id:"hash-implementation",children:"Hash Implementation"}),"\n",(0,a.jsx)(n.p,{children:"Hash can be implemented using an array of linked lists. The key is hashed to an index in the array and the value is stored in the linked list at that index."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class Hash:\n def __init__(self):\n self.capacity = 10\n self.arr = [None] * self.capacity\n\n def hash(self, key):\n return key % self.capacity\n\n def put(self, key, value):\n index = self.hash(key)\n if self.arr[index] is None:\n self.arr[index] = []\n self.arr[index].append((key, value))\n\n def get(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return None\n for k, v in self.arr[index]:\n if k == key:\n return v\n return None\n\n def remove(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return\n for i, (k, v) in enumerate(self.arr[index]):\n if k == key:\n self.arr[index].pop(i)\n return\n"})}),"\n",(0,a.jsx)(n.h2,{id:"hash-collision",children:"Hash Collision"}),"\n",(0,a.jsx)(n.p,{children:"Hash collision is when two keys hash to the same index in the hash table. It can be resolved by using a linked list to store the key-value pairs at that index."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class Hash:\n def __init__(self):\n self.capacity = 10\n self.arr = [None] * self.capacity\n\n def hash(self, key):\n return key % self.capacity\n\n def put(self, key, value):\n index = self.hash(key)\n if self.arr[index] is None:\n self.arr[index] = []\n for i, (k, v) in enumerate(self.arr[index]):\n if k == key:\n self.arr[index][i] = (key, value)\n return\n self.arr[index].append((key, value))\n\n def get(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return None\n for k, v in self.arr[index]:\n if k == key:\n return v\n return None\n\n def remove(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return\n for i, (k, v) in enumerate(self.arr[index]):\n if k == key:\n self.arr[index].pop(i)\n return\n"})}),"\n",(0,a.jsx)(n.h2,{id:"hash-set",children:"Hash Set"}),"\n",(0,a.jsx)(n.p,{children:"Hash set is a set that stores unique elements. It is implemented using a hash table where the key is the element and the value is a dummy value."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class HashSet:\n def __init__(self):\n self.capacity = 10\n self.arr = [None] * self.capacity\n\n def hash(self, key):\n return key % self.capacity\n\n def add(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n self.arr[index] = []\n for k in self.arr[index]:\n if k == key:\n return\n self.arr[index].append(key)\n\n def contains(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return False\n for k in self.arr[index]:\n if k == key:\n return True\n return False\n\n def remove(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return\n for i, k in enumerate(self.arr[index]):\n if k == key:\n self.arr[index].pop(i)\n return\n"})}),"\n",(0,a.jsx)(n.h2,{id:"prefix-sums",children:"Prefix Sums"}),"\n",(0,a.jsx)(n.p,{children:"Prefix sums is a the technique of storing the sum of all elements in the array."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"\narr = [1, 2, 3, 4, 5]\nprefix_sum = [0] * len(arr)\n\nprefix_sum[0] = arr[0]\nfor i in range(1, len(arr)):\n prefix_sum[i] = prefix_sum[i-1] + arr[i]\n\nprint(prefix_sum[2]) # 6 = 3 + 3 = prefix_sum[1] + arr[2] = arr[0] + arr[1] + arr[2] = 1 + 2 + 3\nprint(prefix_sum[4]) # 15 = 10 + 5 = prefix_sum[3] + arr[4] = arr[0] + arr[1] + arr[2] + arr[3] + arr[4] = 1 + 2 + 3 + 4 + 5 \n"})})]})}function h(e={}){const{wrapper:n}={...(0,i.RP)(),...e.components};return n?(0,a.jsx)(n,{...e,children:(0,a.jsx)(d,{...e})}):d(e)}},5680:(e,n,r)=>{r.d(n,{RP:()=>o});var a=r(6540);function i(e,n,r){return n in e?Object.defineProperty(e,n,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[n]=r,e}function s(e,n){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);n&&(a=a.filter((function(n){return Object.getOwnPropertyDescriptor(e,n).enumerable}))),r.push.apply(r,a)}return r}function t(e){for(var n=1;n=0||(i[r]=e[r]);return i}(e,n);if(Object.getOwnPropertySymbols){var s=Object.getOwnPropertySymbols(e);for(a=0;a=0||Object.prototype.propertyIsEnumerable.call(e,r)&&(i[r]=e[r])}return i}var f=a.createContext({}),o=function(e){var n=a.useContext(f),r=n;return e&&(r="function"==typeof e?e(n):t(t({},n),e)),r},d={inlineCode:"code",wrapper:function(e){var n=e.children;return a.createElement(a.Fragment,{},n)}},h=a.forwardRef((function(e,n){var r=e.components,i=e.mdxType,s=e.originalType,f=e.parentName,h=l(e,["components","mdxType","originalType","parentName"]),c=o(r),p=i,u=c["".concat(f,".").concat(p)]||c[p]||d[p]||s;return r?a.createElement(u,t(t({ref:n},h),{},{components:r})):a.createElement(u,t({ref:n},h))}));h.displayName="MDXCreateElement"}}]);
\ No newline at end of file
diff --git a/assets/js/fe5b346b.485c8783.js b/assets/js/fe5b346b.485c8783.js
new file mode 100644
index 00000000..f847eb67
--- /dev/null
+++ b/assets/js/fe5b346b.485c8783.js
@@ -0,0 +1 @@
+"use strict";(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[8652],{4546:(e,n,r)=>{r.r(n),r.d(n,{assets:()=>f,contentTitle:()=>t,default:()=>h,frontMatter:()=>s,metadata:()=>l,toc:()=>o});var a=r(4848),i=r(5680);const s={id:"arrays-and-hashing",title:"Arrays and Hashing"},t=void 0,l={id:"leet-code/arrays-and-hashing",title:"Arrays and Hashing",description:"Dynamic Array",source:"@site/my-brain/leet-code/arrays-and-hashing.md",sourceDirName:"leet-code",slug:"/leet-code/arrays-and-hashing",permalink:"/my-brain/leet-code/arrays-and-hashing",draft:!1,unlisted:!1,tags:[],version:"current",frontMatter:{id:"arrays-and-hashing",title:"Arrays and Hashing"},sidebar:"myBrainSidebar",previous:{title:"Leet Code",permalink:"/my-brain/leet-code/"},next:{title:"Linux",permalink:"/my-brain/linux/"}},f={},o=[{value:"Dynamic Array",id:"dynamic-array",level:2},{value:"Two Pointers",id:"two-pointers",level:2},{value:"Hash Usage",id:"hash-usage",level:2},{value:"Hash Implementation",id:"hash-implementation",level:2},{value:"Hash Collision",id:"hash-collision",level:2},{value:"Hash Set",id:"hash-set",level:2},{value:"Prefix Sums",id:"prefix-sums",level:2}];function d(e){const n={code:"code",h2:"h2",p:"p",pre:"pre",...(0,i.RP)(),...e.components};return(0,a.jsxs)(a.Fragment,{children:[(0,a.jsx)(n.h2,{id:"dynamic-array",children:"Dynamic Array"}),"\n",(0,a.jsx)(n.p,{children:"Dynamic array is an array that grows in size as more elements are added to it. It is implemented by creating a new array with double the size of the original array and copying the elements from the original array to the new array."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class DynamicArray:\n def __init__(self):\n self.capacity = 1\n self.size = 0\n self.arr = [0] * self.capacity\n\n def add(self, element):\n if self.size == self.capacity:\n self.capacity *= 2\n new_arr = [0] * self.capacity\n for i in range(self.size):\n new_arr[i] = self.arr[i]\n self.arr = new_arr\n self.arr[self.size] = element\n self.size += 1\n\n def get(self, index):\n if index < 0 or index >= self.size:\n return -1\n return self.arr[index]\n\n def remove(self, index):\n if index < 0 or index >= self.size:\n return\n for i in range(index, self.size - 1):\n self.arr[i] = self.arr[i+1]\n self.size -= 1\n"})}),"\n",(0,a.jsx)(n.h2,{id:"two-pointers",children:"Two Pointers"}),"\n",(0,a.jsx)(n.p,{children:"Two pointers is a technique where two pointers are used to solve a problem. The two pointers can be used to solve problems where we need to find a pair of elements that satisfy a condition."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"def two_pointers(arr, target):\n left = 0\n right = len(arr) - 1\n while left < right:\n if arr[left] + arr[right] == target:\n return [left, right]\n elif arr[left] + arr[right] < target:\n left += 1\n else:\n right -= 1\n return [-1, -1]\n"})}),"\n",(0,a.jsx)(n.h2,{id:"hash-usage",children:"Hash Usage"}),"\n",(0,a.jsx)(n.p,{children:"Hash is a data structure that stores key-value pairs. It is used to store elements in a way that allows for fast retrieval of elements."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:'hash_map = {}\nhash_map[1] = "one"\nhash_map[2] = "two"\nhash_map[3] = "three"\n\nprint(hash_map[1]) # one\nprint(hash_map[2]) # two\nprint(hash_map[3]) # three\n'})}),"\n",(0,a.jsx)(n.h2,{id:"hash-implementation",children:"Hash Implementation"}),"\n",(0,a.jsx)(n.p,{children:"Hash can be implemented using an array of linked lists. The key is hashed to an index in the array and the value is stored in the linked list at that index."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class Hash:\n def __init__(self):\n self.capacity = 10\n self.arr = [None] * self.capacity\n\n def hash(self, key):\n return key % self.capacity\n\n def put(self, key, value):\n index = self.hash(key)\n if self.arr[index] is None:\n self.arr[index] = []\n self.arr[index].append((key, value))\n\n def get(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return None\n for k, v in self.arr[index]:\n if k == key:\n return v\n return None\n\n def remove(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return\n for i, (k, v) in enumerate(self.arr[index]):\n if k == key:\n self.arr[index].pop(i)\n return\n"})}),"\n",(0,a.jsx)(n.h2,{id:"hash-collision",children:"Hash Collision"}),"\n",(0,a.jsx)(n.p,{children:"Hash collision is when two keys hash to the same index in the hash table. It can be resolved by using a linked list to store the key-value pairs at that index."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class Hash:\n def __init__(self):\n self.capacity = 10\n self.arr = [None] * self.capacity\n\n def hash(self, key):\n return key % self.capacity\n\n def put(self, key, value):\n index = self.hash(key)\n if self.arr[index] is None:\n self.arr[index] = []\n for i, (k, v) in enumerate(self.arr[index]):\n if k == key:\n self.arr[index][i] = (key, value)\n return\n self.arr[index].append((key, value))\n\n def get(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return None\n for k, v in self.arr[index]:\n if k == key:\n return v\n return None\n\n def remove(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return\n for i, (k, v) in enumerate(self.arr[index]):\n if k == key:\n self.arr[index].pop(i)\n return\n"})}),"\n",(0,a.jsx)(n.h2,{id:"hash-set",children:"Hash Set"}),"\n",(0,a.jsx)(n.p,{children:"Hash set is a set that stores unique elements. It is implemented using a hash table where the key is the element and the value is a dummy value."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"class HashSet:\n def __init__(self):\n self.capacity = 10\n self.arr = [None] * self.capacity\n\n def hash(self, key):\n return key % self.capacity\n\n def add(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n self.arr[index] = []\n for k in self.arr[index]:\n if k == key:\n return\n self.arr[index].append(key)\n\n def contains(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return False\n for k in self.arr[index]:\n if k == key:\n return True\n return False\n\n def remove(self, key):\n index = self.hash(key)\n if self.arr[index] is None:\n return\n for i, k in enumerate(self.arr[index]):\n if k == key:\n self.arr[index].pop(i)\n return\n"})}),"\n",(0,a.jsx)(n.h2,{id:"prefix-sums",children:"Prefix Sums"}),"\n",(0,a.jsx)(n.p,{children:"Prefix sums is a the technique of storing the sum of all elements in the array."}),"\n",(0,a.jsx)(n.pre,{children:(0,a.jsx)(n.code,{className:"language-python",children:"\narr = [1, 2, 3, 4, 5]\nprefix_sum = [0] * len(arr)\n\nprefix_sum[0] = arr[0]\nfor i in range(1, len(arr)):\n prefix_sum[i] = prefix_sum[i-1] + arr[i]\n\nprint(prefix_sum[2]) # 6 = 3 + 3 = prefix_sum[1] + arr[2] = arr[0] + arr[1] + arr[2] = 1 + 2 + 3\nprint(prefix_sum[4]) # 15 = 10 + 5 = prefix_sum[3] + arr[4] = arr[0] + arr[1] + arr[2] + arr[3] + arr[4] = 1 + 2 + 3 + 4 + 5 \n"})})]})}function h(e={}){const{wrapper:n}={...(0,i.RP)(),...e.components};return n?(0,a.jsx)(n,{...e,children:(0,a.jsx)(d,{...e})}):d(e)}},5680:(e,n,r)=>{r.d(n,{RP:()=>o});var a=r(6540);function i(e,n,r){return n in e?Object.defineProperty(e,n,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[n]=r,e}function s(e,n){var r=Object.keys(e);if(Object.getOwnPropertySymbols){var a=Object.getOwnPropertySymbols(e);n&&(a=a.filter((function(n){return Object.getOwnPropertyDescriptor(e,n).enumerable}))),r.push.apply(r,a)}return r}function t(e){for(var n=1;n=0||(i[r]=e[r]);return i}(e,n);if(Object.getOwnPropertySymbols){var s=Object.getOwnPropertySymbols(e);for(a=0;a=0||Object.prototype.propertyIsEnumerable.call(e,r)&&(i[r]=e[r])}return i}var f=a.createContext({}),o=function(e){var n=a.useContext(f),r=n;return e&&(r="function"==typeof e?e(n):t(t({},n),e)),r},d={inlineCode:"code",wrapper:function(e){var n=e.children;return a.createElement(a.Fragment,{},n)}},h=a.forwardRef((function(e,n){var r=e.components,i=e.mdxType,s=e.originalType,f=e.parentName,h=l(e,["components","mdxType","originalType","parentName"]),c=o(r),p=i,u=c["".concat(f,".").concat(p)]||c[p]||d[p]||s;return r?a.createElement(u,t(t({ref:n},h),{},{components:r})):a.createElement(u,t({ref:n},h))}));h.displayName="MDXCreateElement"}}]);
\ No newline at end of file
diff --git a/assets/js/main.ca278fd2.js b/assets/js/main.ca278fd2.js
new file mode 100644
index 00000000..318e3cc8
--- /dev/null
+++ b/assets/js/main.ca278fd2.js
@@ -0,0 +1,2 @@
+/*! For license information please see main.ca278fd2.js.LICENSE.txt */
+(self.webpackChunkpaulohernane_me=self.webpackChunkpaulohernane_me||[]).push([[8792],{8328:(e,t,n)=>{"use strict";n.d(t,{A:()=>p});n(6540);var a=n(3259),r=n.n(a),o=n(4054);const i={"00471c28":[()=>n.e(2058).then(n.bind(n,3238)),"@site/blog/2023-08-26-day-12-100-days-of-code.md?truncated=true",3238],"00b56270":[()=>n.e(9045).then(n.t.bind(n,3382,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-data-model-58e.json",3382],"010e533d":[()=>n.e(1390).then(n.bind(n,2412)),"@site/blog/2023-08-25-day-11-100-days-of-code.md?truncated=true",2412],"0185af2f":[()=>n.e(1518).then(n.t.bind(n,8953,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-imbalanced-data-8d0.json",8953],"01a85c17":[()=>Promise.all([n.e(1869),n.e(8209)]).then(n.bind(n,9140)),"@theme/BlogTagsListPage",9140],"021122aa":[()=>n.e(6145).then(n.bind(n,7503)),"@site/blog/2023-08-17-day-4-100-days-of-code.md",7503],"0254aa6b":[()=>n.e(4268).then(n.bind(n,6396)),"@site/blog/2023-08-06-how-to-code-everyday.md",6396],"05a0423f":[()=>n.e(9344).then(n.bind(n,1180)),"@site/my-brain/machine-learning-and-data-science-course/feature-engineering-and-selection.md",1180],"07d2ba2d":[()=>n.e(1055).then(n.t.bind(n,3917,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-reusable-barrier-48d.json",3917],"080ef472":[()=>n.e(8883).then(n.bind(n,2124)),"@site/blog/2023-09-11-day-22-100-days-of-code.md",2124],"08584cdd":[()=>n.e(5695).then(n.t.bind(n,383,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-database-management-system-165.json",383],"0902c6ba":[()=>n.e(2312).then(n.t.bind(n,9780,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-go-099.json",9780],"09b34d89":[()=>n.e(8906).then(n.bind(n,9109)),"@site/my-brain/leet-code/index.md",9109],"0a9b1ddc":[()=>n.e(5571).then(n.t.bind(n,9400,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-zod-b72.json",9400],"0b544d69":[()=>n.e(993).then(n.t.bind(n,3751,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-object-tables-da9.json",3751],"0ba7110a":[()=>n.e(642).then(n.bind(n,6155)),"@site/blog/2023-08-29-day-15-100-days-of-code.md",6155],"0ce9a96b":[()=>n.e(3116).then(n.bind(n,1867)),"@site/my-brain/concurrent-programming/some-algorithms.md",1867],"0f23b9c1":[()=>n.e(5963).then(n.t.bind(n,4607,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-english-2ce.json",4607],"0f5f4ab4":[()=>n.e(3055).then(n.bind(n,2545)),"@site/blog/2023-08-30-day-16-100-days-of-code.md",2545],"0fc1f80a":[()=>n.e(1622).then(n.t.bind(n,682,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-database-b87.json",682],"1011f9d9":[()=>n.e(4752).then(n.bind(n,2648)),"@site/my-brain/data-science/machine-learning/machine-learning-specialist-course/genetic-algorithms.md",2648],"10a70376":[()=>n.e(9732).then(n.t.bind(n,9311,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-silhouette-analysis-040.json",9311],"122acf02":[()=>n.e(3308).then(n.bind(n,3640)),"@site/blog/2023-09-10-day-21-100-days-of-code.md?truncated=true",3640],13812668:[()=>n.e(2396).then(n.bind(n,5619)),"@site/my-brain/linux/driver-development/make-and-makefile.md",5619],"145e2e31":[()=>n.e(2961).then(n.bind(n,9743)),"@site/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/how-it-works.md",9743],17741138:[()=>n.e(2481).then(n.t.bind(n,9244,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-oracle-e61.json",9244],17896441:[()=>Promise.all([n.e(1869),n.e(1388),n.e(8401)]).then(n.bind(n,2447)),"@theme/DocItem",2447],"18c2f3ae":[()=>n.e(2768).then(n.t.bind(n,6568,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-process-3f6.json",6568],"18d55103":[()=>n.e(476).then(n.t.bind(n,3711,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-development-309.json",3711],"18d7dd02":[()=>n.e(8717).then(n.t.bind(n,9546,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-outliers-95e.json",9546],"18f43df0":[()=>n.e(9861).then(n.bind(n,3065)),"@site/my-brain/linux/driver.md",3065],"19aa9265":[()=>n.e(6869).then(n.t.bind(n,4290,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-system-call-161.json",4290],"1c002b62":[()=>n.e(8627).then(n.bind(n,8218)),"@site/my-brain/concurrent-programming/index.md",8218],"1df93b7f":[()=>Promise.all([n.e(1869),n.e(4583)]).then(n.bind(n,8198)),"@site/src/pages/index.tsx",8198],"1f391b9e":[()=>Promise.all([n.e(1869),n.e(1388),n.e(6061)]).then(n.bind(n,7973)),"@theme/MDXPage",7973],"1fc87498":[()=>n.e(9589).then(n.t.bind(n,4578,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-programming-1aa.json",4578],"207e0450":[()=>n.e(7138).then(n.bind(n,6828)),"@site/my-brain/system-design.md",6828],"208ffa87":[()=>n.e(587).then(n.t.bind(n,1470,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-mutex-ef8.json",1470],"209d9281":[()=>n.e(4530).then(n.t.bind(n,2997,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-logic-data-model-e72.json",2997],"20ad9edb":[()=>n.e(930).then(n.t.bind(n,9971,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-sqlite-03b.json",9971],"225e0e6c":[()=>n.e(5841).then(n.bind(n,3223)),"@site/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/index.md",3223],"22d2c3aa":[()=>n.e(4225).then(n.bind(n,7045)),"@site/my-brain/math/index.md",7045],"24daede1":[()=>n.e(6913).then(n.t.bind(n,4037,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-concurrent-programming-d4d.json",4037],"25003e4f":[()=>n.e(2838).then(n.t.bind(n,4351,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-archive-80c.json",4351],"2590134c":[()=>n.e(1988).then(n.t.bind(n,4883,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-database-administrator-82b.json",4883],"28a898e4":[()=>n.e(722).then(n.t.bind(n,5732,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-node-js-2dd.json",5732],"290b85e4":[()=>n.e(320).then(n.bind(n,4932)),"@site/my-brain/data-science/machine-learning/machine-learning-specialist-course/unsupervised-machine-learning.md",4932],"2b25e3a0":[()=>n.e(6567).then(n.bind(n,4224)),"@site/my-brain/concurrent-programming/semaphore.md",4224],"2ba346f1":[()=>n.e(7010).then(n.t.bind(n,2419,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-concurrent-programming-556.json",2419],"2ca02478":[()=>n.e(3126).then(n.bind(n,4923)),"@site/my-brain/machine-learning-and-data-science-course/computer-vision.md",4923],"2d8c7ff7":[()=>n.e(4204).then(n.t.bind(n,7315,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-prettier-97d.json",7315],"2efb0cfc":[()=>n.e(8446).then(n.bind(n,9782)),"@site/my-brain/data-science/histogram.md",9782],"2f503145":[()=>n.e(2141).then(n.t.bind(n,5141,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-mer-fc8.json",5141],"2fa290c7":[()=>n.e(5979).then(n.t.bind(n,5052,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-next-js-0e0.json",5052],"3010a3b3":[()=>n.e(2600).then(n.bind(n,7006)),"@site/my-brain/machine-learning-and-data-science-course/outliers.md",7006],31813681:[()=>n.e(8392).then(n.t.bind(n,5214,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-make-8f9.json",5214],31821126:[()=>n.e(7883).then(n.t.bind(n,7272,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-react-native-757.json",7272],"32300f2b":[()=>n.e(1935).then(n.t.bind(n,6773,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-typescript-2e3.json",6773],"333a9305":[()=>n.e(5728).then(n.bind(n,2334)),"@site/my-brain/interprocess-communication.md",2334],"33a4d502":[()=>n.e(8433).then(n.t.bind(n,4266,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-distributed-systems-90a.json",4266],"33b1fae6":[()=>n.e(1124).then(n.bind(n,3502)),"@site/my-brain/concurrent-programming/concurrency-vs-parallelism.md",3502],"351f2e94":[()=>n.e(5210).then(n.bind(n,6279)),"@site/my-brain/databases/sqlite.md",6279],"355e1a50":[()=>n.e(2140).then(n.t.bind(n,8652,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-forecasting-05f.json",8652],"35847f67":[()=>n.e(393).then(n.t.bind(n,8478,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-100-days-of-code-page-3-f07.json",8478],"36994c47":[()=>n.e(9858).then(n.t.bind(n,5516,19)),"@generated/docusaurus-plugin-content-blog/default/__plugin.json",5516],"3720c009":[()=>Promise.all([n.e(1869),n.e(4787)]).then(n.bind(n,2194)),"@theme/DocTagsListPage",2194],"38294d9b":[()=>n.e(6168).then(n.t.bind(n,4540,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-es-lint-862.json",4540],"38a6ce7f":[()=>n.e(9644).then(n.bind(n,5935)),"@site/blog/2023-08-18-day-5-100-days-of-code.md?truncated=true",5935],"3bd2b188":[()=>n.e(2457).then(n.bind(n,7384)),"@site/my-brain/data-science/machine-learning/machine-learning-specialist-course/introduction.md",7384],"3d0699be":[()=>n.e(8897).then(n.t.bind(n,6254,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-hashing-22b.json",6254],"3d575689":[()=>n.e(4646).then(n.bind(n,6703)),"@site/my-brain/concurrent-programming/classical-synchronization-problems.md",6703],"404e42f6":[()=>n.e(7960).then(n.t.bind(n,1678,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-page-2-677.json",1678],"41243d2f":[()=>n.e(8489).then(n.t.bind(n,8826,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-synchronization-patterns-49a.json",8826],"41756ce8":[()=>n.e(9616).then(n.t.bind(n,5205,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-037.json",5205],"44ff1f49":[()=>n.e(7527).then(n.t.bind(n,1550,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-procedures-53a.json",1550],"451ccd6b":[()=>n.e(7495).then(n.t.bind(n,3955,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-linux-d18.json",3955],"46df77c7":[()=>n.e(4799).then(n.t.bind(n,6209,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-xml-model-cb9.json",6209],"4775eea6":[()=>n.e(303).then(n.t.bind(n,6344,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-routine-156.json",6344],"482c029f":[()=>n.e(5869).then(n.t.bind(n,3971,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-seaborn-872.json",3971],"48db4f83":[()=>n.e(4540).then(n.bind(n,7019)),"@site/blog/2023-08-27-day-13-100-days-of-code.md",7019],"48fd5280":[()=>n.e(7832).then(n.t.bind(n,4774,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-feature-engineering-a43.json",4774],"4aea0eb8":[()=>n.e(3599).then(n.t.bind(n,339,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-100-days-of-code-page-2-421.json",339],"4b1b253b":[()=>n.e(408).then(n.bind(n,5874)),"@site/blog/2023-08-28-day-14-100-days-of-code.md?truncated=true",5874],"4c879a0c":[()=>n.e(2246).then(n.bind(n,1308)),"@site/my-brain/godot/index.md",1308],"4e8293f5":[()=>n.e(8275).then(n.t.bind(n,9684,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-ipc-7a6.json",9684],"4f42efe0":[()=>n.e(1857).then(n.t.bind(n,4498,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-code-452.json",4498],"4fa62239":[()=>n.e(256).then(n.t.bind(n,4727,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-data-science-578.json",4727],"506f0359":[()=>n.e(785).then(n.t.bind(n,4866,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-routine-db2.json",4866],"51373b82":[()=>n.e(3050).then(n.t.bind(n,7946,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-dbms-0fd.json",7946],"53a3e6dc":[()=>n.e(6261).then(n.t.bind(n,922,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-c06.json",922],"53adacb1":[()=>n.e(6523).then(n.t.bind(n,4522,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-react-575.json",4522],"5440313f":[()=>n.e(9876).then(n.bind(n,9763)),"@site/my-brain/godot/scenes.md",9763],"54c84294":[()=>n.e(1588).then(n.t.bind(n,1835,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-v-array-98d.json",1835],"552bc755":[()=>n.e(7849).then(n.t.bind(n,9720,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-race-condition-6ed.json",9720],"574725fd":[()=>n.e(3261).then(n.bind(n,2485)),"@site/my-brain/concurrent-programming/threads-and-process-in-python.md",2485],"58cf0085":[()=>n.e(3290).then(n.bind(n,7352)),"@site/blog/2023-08-21-day-8-100-days-of-code.md",7352],"5909ba9c":[()=>n.e(5511).then(n.t.bind(n,6933,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-object-relational-database-082.json",6933],"5969fe12":[()=>n.e(8804).then(n.t.bind(n,4243,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-signalizing-1cf.json",4243],"5a167133":[()=>n.e(5470).then(n.t.bind(n,2113,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-clustering-cd8.json",2113],"5da680c6":[()=>n.e(998).then(n.bind(n,5094)),"@site/my-brain/linux/driver-development/index.md",5094],"5e95c892":[()=>n.e(9647).then(n.bind(n,7121)),"@theme/DocsRoot",7121],"5e9f5e1a":[()=>Promise.resolve().then(n.bind(n,4784)),"@generated/docusaurus.config",4784],"5f2e81f6":[()=>n.e(8440).then(n.bind(n,4714)),"@site/blog/2023-09-02-day-19-100-days-of-code.md?truncated=true",4714],"5f531633":[()=>n.e(5009).then(n.bind(n,642)),"@site/src/pages/about-me.tsx",642],"5fa55b07":[()=>n.e(7262).then(n.t.bind(n,8095,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-busy-waiting-1f5.json",8095],"5ff4493f":[()=>n.e(4346).then(n.bind(n,4457)),"@site/blog/2023-08-19-day-6-100-days-of-code.md?truncated=true",4457],"60d8ddcf":[()=>n.e(2018).then(n.bind(n,4207)),"@site/my-brain/math/probability/bayes-theorem.md",4207],"60de135a":[()=>n.e(9046).then(n.t.bind(n,5249,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-godot-88f.json",5249],63220496:[()=>n.e(467).then(n.t.bind(n,9845,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-dba-f73.json",9845],"650b24a1":[()=>n.e(1054).then(n.t.bind(n,2127,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-python-667.json",2127],"667b7994":[()=>n.e(6007).then(n.bind(n,1722)),"@site/blog/2023-09-01-day-18-100-days-of-code.md?truncated=true",1722],"6682f571":[()=>n.e(7118).then(n.bind(n,8627)),"@site/my-brain/data-science/machine-learning/index.md",8627],"6875c492":[()=>Promise.all([n.e(1869),n.e(1388),n.e(3242),n.e(4813)]).then(n.bind(n,3069)),"@theme/BlogTagsPostsPage",3069],"6895174b":[()=>n.e(8121).then(n.t.bind(n,295,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-uml-663.json",295],"6a43ec1b":[()=>n.e(4794).then(n.t.bind(n,8849,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-process-23e.json",8849],"6a923224":[()=>n.e(8344).then(n.bind(n,4666)),"@site/blog/2023-08-22-day-9-100-days-of-code.md?truncated=true",4666],"6b35adbd":[()=>n.e(1846).then(n.t.bind(n,8259,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-distributed-systems-a84.json",8259],"72531eee":[()=>n.e(8232).then(n.bind(n,7509)),"@site/my-brain/data-science/machine-learning/machine-learning-specialist-course/support-vector-machine.md",7509],"72c0900d":[()=>n.e(8286).then(n.t.bind(n,1335,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-physical-data-model-7ae.json",1335],"74206f9b":[()=>n.e(7777).then(n.t.bind(n,4987,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-functions-552.json",4987],"7484695c":[()=>n.e(5117).then(n.t.bind(n,5128,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-files-a0d.json",5128],"770fff4c":[()=>n.e(2160).then(n.bind(n,7649)),"@site/my-brain/databases/disk-storage-file-structures-and-hashing.md",7649],"78040f3c":[()=>n.e(5638).then(n.t.bind(n,6665,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-feature-extraction-cb8.json",6665],"79a0b437":[()=>n.e(6716).then(n.bind(n,6682)),"@site/blog/2023-08-24-day-10-100-days-of-code.md?truncated=true",6682],"7d6ff6c6":[()=>n.e(6793).then(n.t.bind(n,1543,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-synchronization-patterns-09d.json",1543],"7f0e6173":[()=>n.e(2440).then(n.bind(n,4225)),"@site/blog/2023-08-31-day-17-100-days-of-code..md",4225],"809aef81":[()=>n.e(1929).then(n.bind(n,9475)),"@site/my-brain/databases/index.md",9475],"80dfc6dc":[()=>n.e(5997).then(n.t.bind(n,4468,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-object-oriented-model-200.json",4468],"814f3328":[()=>n.e(7472).then(n.t.bind(n,5513,19)),"~blog/default/blog-post-list-prop-default.json",5513],85630072:[()=>n.e(9584).then(n.bind(n,4454)),"@site/blog/2023-08-24-day-10-100-days-of-code.md",4454],"85a612f0":[()=>n.e(2120).then(n.bind(n,464)),"@site/my-brain/data-science/machine-learning/k-means-clustering.md",464],"86ca433b":[()=>n.e(8457).then(n.bind(n,9362)),"@site/blog/2023-08-26-day-12-100-days-of-code.md",9362],"8714d579":[()=>n.e(854).then(n.t.bind(n,3226,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-sampling-252.json",3226],"872632b5":[()=>n.e(5436).then(n.t.bind(n,5666,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-machine-learning-79f.json",5666],"8892a95d":[()=>n.e(4059).then(n.bind(n,1129)),"@site/my-brain/godot/signals.md",1129],"88f7b34c":[()=>n.e(8660).then(n.t.bind(n,1041,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-relational-model-239.json",1041],"8980fd50":[()=>n.e(3903).then(n.t.bind(n,5754,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-object-types-069.json",5754],"89a2fb89":[()=>n.e(2662).then(n.t.bind(n,4450,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-em-algorithm-1d7.json",4450],"8a63dea0":[()=>n.e(7193).then(n.t.bind(n,2757,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-makefile-3aa.json",2757],"8b0a862a":[()=>n.e(2309).then(n.bind(n,3479)),"@site/blog/2023-08-14-day-1-100-days-of-code.md?truncated=true",3479],"8b78d9af":[()=>n.e(2028).then(n.bind(n,9859)),"@site/src/pages/laliga/inimigos.md",9859],"8cd09f00":[()=>n.e(5637).then(n.bind(n,2079)),"@site/my-brain/studying.md",2079],"8d1a8758":[()=>n.e(2637).then(n.t.bind(n,4523,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-100-days-of-code-7d5.json",4523],"8eb0b182":[()=>n.e(4249).then(n.t.bind(n,9185,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-e90.json",9185],"90199c54":[()=>n.e(4461).then(n.t.bind(n,6467,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-page-3-fd4.json",6467],"90fc5ed3":[()=>n.e(5780).then(n.bind(n,312)),"@site/blog/2023-08-06-how-to-code-everyday.md?truncated=true",312],"9553a4b9":[()=>n.e(7421).then(n.bind(n,7363)),"@site/blog/2023-08-30-day-16-100-days-of-code.md?truncated=true",7363],"95dd7c50":[()=>n.e(9544).then(n.t.bind(n,4794,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-db-4c1.json",4794],"95df591e":[()=>n.e(5407).then(n.t.bind(n,1130,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-database-d10.json",1130],"96f6cfdd":[()=>n.e(5469).then(n.t.bind(n,980,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-computer-vision-008.json",980],"9767caa6":[()=>n.e(6964).then(n.bind(n,5857)),"@site/my-brain/machine-learning-and-data-science-course/data-pre-processing/split-data.md",5857],"980f9f12":[()=>n.e(5258).then(n.t.bind(n,3651,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-thread-113.json",3651],"9a1af2b2":[()=>n.e(6095).then(n.bind(n,215)),"@site/my-brain/linux/index.md",215],"9a1b5dad":[()=>n.e(2332).then(n.t.bind(n,8444,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-system-design-dc3.json",8444],"9a8ad7a8":[()=>n.e(7516).then(n.t.bind(n,9730,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-data-preprocessing-5bf.json",9730],"9c9ec0f8":[()=>n.e(5914).then(n.t.bind(n,3242,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-parallelism-c76.json",3242],"9d0ca925":[()=>n.e(1446).then(n.t.bind(n,2550,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-parallelism-a50.json",2550],"9e4087bc":[()=>n.e(2711).then(n.bind(n,9331)),"@theme/BlogArchivePage",9331],"9edd3b5f":[()=>n.e(6071).then(n.t.bind(n,6538,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-rendezvous-1c9.json",6538],"9f8c93e0":[()=>n.e(4286).then(n.bind(n,227)),"@site/blog/2023-08-16-day-3-100-days-of-code.md?truncated=true",227],"9fa23911":[()=>n.e(8329).then(n.t.bind(n,3722,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-design-patterns-556.json",3722],"9fb7b81b":[()=>n.e(5364).then(n.t.bind(n,7925,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-correlation-c5c.json",7925],a1a42f29:[()=>n.e(7649).then(n.bind(n,8400)),"@site/my-brain/godot/autoloads.md",8400],a1aada45:[()=>n.e(8351).then(n.bind(n,1824)),"@site/my-brain/machine-learning-and-data-science-course/dimensionality-reduction.md",1824],a28b2fc1:[()=>n.e(6423).then(n.bind(n,1581)),"@site/my-brain/godot/input_mapping.md",1581],a6aa9e1f:[()=>Promise.all([n.e(1869),n.e(1388),n.e(3242),n.e(7643)]).then(n.bind(n,5124)),"@theme/BlogListPage",5124],a6b37577:[()=>n.e(1701).then(n.bind(n,7563)),"@site/my-brain/machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data.md",7563],a7456010:[()=>n.e(1235).then(n.t.bind(n,8552,19)),"@generated/docusaurus-plugin-content-pages/default/__plugin.json",8552],a7bd4aaa:[()=>n.e(7098).then(n.bind(n,4532)),"@theme/DocVersionRoot",4532],a80570b8:[()=>n.e(7706).then(n.t.bind(n,9724,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-histogram-248.json",9724],a8d1eae7:[()=>n.e(4707).then(n.bind(n,3421)),"@site/blog/2023-08-18-day-5-100-days-of-code.md",3421],a8f03678:[()=>Promise.all([n.e(1869),n.e(9064)]).then(n.bind(n,7276)),"@site/src/pages/projects.tsx",7276],a94703ab:[()=>Promise.all([n.e(1869),n.e(9048)]).then(n.bind(n,2559)),"@theme/DocRoot",2559],a9faa526:[()=>n.e(872).then(n.t.bind(n,8716,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-seaborn-42b.json",8716],aa22b93e:[()=>n.e(6086).then(n.bind(n,4585)),"@site/my-brain/godot/nodes.md",4585],aa77e7c9:[()=>n.e(3715).then(n.bind(n,724)),"@site/blog/2023-08-27-day-13-100-days-of-code.md?truncated=true",724],aa96ca0e:[()=>n.e(6313).then(n.t.bind(n,769,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-math-91a.json",769],aaecaddb:[()=>n.e(1656).then(n.t.bind(n,9753,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-naive-bayes-eb8.json",9753],ab19f028:[()=>n.e(956).then(n.t.bind(n,4588,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-multiplex-58a.json",4588],ab732117:[()=>n.e(1087).then(n.bind(n,1313)),"@site/my-brain/concurrent-programming/basic-synchronization-patterns.md",1313],aba21aa0:[()=>n.e(5742).then(n.t.bind(n,7093,19)),"@generated/docusaurus-plugin-content-docs/default/__plugin.json",7093],abb9f566:[()=>n.e(878).then(n.bind(n,8456)),"@site/my-brain/data-science/correlation.md",8456],ac117325:[()=>n.e(9372).then(n.bind(n,2076)),"@site/my-brain/machine-learning-and-data-science-course/classification/index.md",2076],ac4e53aa:[()=>n.e(9536).then(n.t.bind(n,8374,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-entity-relationship-model-71f.json",8374],acecf23e:[()=>n.e(1903).then(n.t.bind(n,1912,19)),"~blog/default/blogMetadata-default.json",1912],b0e76a05:[()=>n.e(4795).then(n.t.bind(n,72,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-python-ef3.json",72],b2891ec6:[()=>n.e(7075).then(n.bind(n,5200)),"@site/my-brain/machine-learning-and-data-science-course/data-pre-processing/index.md",5200],b41f0793:[()=>n.e(2799).then(n.t.bind(n,4994,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-elbow-method-47d.json",4994],b69878a2:[()=>n.e(6408).then(n.bind(n,7583)),"@site/my-brain/machine-learning-and-data-science-course/classification/decision-trees/index.md",7583],b7025452:[()=>n.e(4238).then(n.t.bind(n,8345,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-barrier-0d6.json",8345],b7c35e21:[()=>n.e(3177).then(n.t.bind(n,4139,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-resampling-24e.json",4139],b7e098cd:[()=>n.e(9079).then(n.t.bind(n,2888,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-pandas-616.json",2888],b7fc746c:[()=>n.e(1807).then(n.t.bind(n,8554,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-dimensionality-reduction-fd3.json",8554],b869578f:[()=>n.e(4664).then(n.bind(n,9806)),"@site/my-brain/data-science/machine-learning/machine-learning-specialist-course/index.md",9806],b8c57c6b:[()=>n.e(4099).then(n.bind(n,6167)),"@site/blog/2023-08-19-day-6-100-days-of-code.md",6167],bc0c5737:[()=>n.e(2775).then(n.bind(n,6685)),"@site/my-brain/math/probability/index.md",6685],bc7f526c:[()=>n.e(3713).then(n.t.bind(n,7480,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-d1d.json",7480],bd9b808d:[()=>n.e(5944).then(n.bind(n,900)),"@site/blog/2023-08-21-day-8-100-days-of-code.md?truncated=true",900],bde65b9a:[()=>n.e(2687).then(n.bind(n,8998)),"@site/blog/2023-09-02-day-19-100-days-of-code.md",8998],be133805:[()=>n.e(7452).then(n.bind(n,9347)),"@site/my-brain/machine-learning-and-data-science-course/resampling.md",9347],bfce852e:[()=>n.e(6149).then(n.bind(n,1637)),"@site/my-brain/machine-learning-and-data-science-course/data-pre-processing/variables-types.md",1637],c14d7f21:[()=>n.e(9147).then(n.t.bind(n,1200,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-decision-trees-a09.json",1200],c201cedb:[()=>n.e(8219).then(n.t.bind(n,6288,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-concurrency-cf6.json",6288],c3706649:[()=>n.e(2669).then(n.bind(n,1831)),"@site/blog/2023-08-15-day-2-100-days-of-code.md",1831],c55742d2:[()=>n.e(223).then(n.bind(n,6747)),"@site/blog/2023-09-11-day-22-100-days-of-code.md?truncated=true",6747],c5bb191f:[()=>n.e(7708).then(n.t.bind(n,1932,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-driver-3d7.json",1932],c79410ce:[()=>n.e(1781).then(n.t.bind(n,9116,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-inter-process-communication-104.json",9116],c87c3b2d:[()=>n.e(3437).then(n.t.bind(n,8339,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-classification-c75.json",8339],ca49161f:[()=>n.e(9930).then(n.t.bind(n,3082,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-odb-ce5.json",3082],caa10b48:[()=>n.e(8823).then(n.t.bind(n,1350,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-conceptual-data-model-874.json",1350],ccc49370:[()=>Promise.all([n.e(1869),n.e(1388),n.e(3242),n.e(3249)]).then(n.bind(n,3858)),"@theme/BlogPostPage",3858],cd46b3e1:[()=>n.e(6915).then(n.bind(n,8003)),"@site/blog/2023-08-31-day-17-100-days-of-code..md?truncated=true",8003],cd91772f:[()=>n.e(9834).then(n.bind(n,6973)),"@site/my-brain/godot/pausing.md",6973],cdad2653:[()=>n.e(4705).then(n.bind(n,4023)),"@site/my-brain/databases/data-model-types.md",4023],ce907eda:[()=>n.e(8065).then(n.bind(n,1190)),"@site/blog/2023-08-22-day-9-100-days-of-code.md",1190],cf256994:[()=>n.e(2063).then(n.t.bind(n,3388,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-image-processing-9f4.json",3388],d15734cb:[()=>n.e(3336).then(n.t.bind(n,2207,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-unified-modeling-language-b37.json",2207],d3379949:[()=>n.e(6205).then(n.t.bind(n,7188,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-scikit-learn-5cb.json",7188],d3520f42:[()=>n.e(2877).then(n.bind(n,2709)),"@site/blog/2023-08-14-day-1-100-days-of-code.md",2709],d43f6cab:[()=>n.e(5376).then(n.bind(n,7830)),"@site/blog/2023-09-01-day-18-100-days-of-code.md",7830],d467121d:[()=>n.e(5404).then(n.bind(n,5452)),"@site/my-brain/machine-learning-and-data-science-course/data-pre-processing/categorical-variables.md",5452],d48bc2ee:[()=>n.e(4928).then(n.t.bind(n,6579,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-expo-b83.json",6579],d594504c:[()=>n.e(3057).then(n.bind(n,1920)),"@site/my-brain/machine-learning-and-data-science-course/model-validation.md",1920],d5ee58cb:[()=>n.e(336).then(n.t.bind(n,9262,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-feature-selection-75a.json",9262],d6dcbb61:[()=>n.e(7805).then(n.t.bind(n,6931,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-data-science-d5e.json",6931],d8c773fe:[()=>n.e(708).then(n.bind(n,7473)),"@site/blog/2023-08-17-day-4-100-days-of-code.md?truncated=true",7473],d940aa85:[()=>n.e(5813).then(n.t.bind(n,2184,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-methods-ad9.json",2184],d9ae0365:[()=>n.e(8240).then(n.t.bind(n,6141,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-unsupervised-learning-f18.json",6141],dc879e83:[()=>n.e(8266).then(n.bind(n,6947)),"@site/blog/2023-09-03-day-20-100-days-of-code.md?truncated=true",6947],de2f1cfb:[()=>n.e(4122).then(n.t.bind(n,3279,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-databases-db9.json",3279],de7748d1:[()=>n.e(7625).then(n.bind(n,1875)),"@site/my-brain/machine-learning-and-data-science-course/index.md",1875],df203c0f:[()=>Promise.all([n.e(1869),n.e(4279)]).then(n.bind(n,5921)),"@theme/DocTagDocListPage",5921],dfad0d7c:[()=>n.e(1304).then(n.t.bind(n,2881,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-disk-storage-c38.json",2881],e0f4b4b0:[()=>n.e(5498).then(n.t.bind(n,4914,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-swc-d0e.json",4914],e23606c1:[()=>n.e(8795).then(n.t.bind(n,5029,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-time-series-732.json",5029],e2f6577b:[()=>n.e(7657).then(n.t.bind(n,1221,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-expectation-maximization-882.json",1221],e849eeb6:[()=>n.e(8399).then(n.bind(n,144)),"@site/my-brain/machine-learning-and-data-science-course/data-pre-processing/data-standardization.md",144],e9fed4cc:[()=>n.e(4348).then(n.bind(n,9777)),"@site/my-brain/godot/changing_scenes.md",9777],ea73a08f:[()=>n.e(8154).then(n.bind(n,4798)),"@site/blog/2023-08-20-day-7-100-days-of-code.md",4798],ea960cfb:[()=>n.e(7647).then(n.bind(n,8968)),"@site/my-brain/javascript/index.md",8968],eb347ae2:[()=>n.e(7990).then(n.t.bind(n,8981,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-ord-18e.json",8981],ec3e36c3:[()=>n.e(6938).then(n.t.bind(n,6387,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-k-means-72f.json",6387],ed0217bd:[()=>n.e(3244).then(n.t.bind(n,9682,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-nested-tables-c19.json",9682],ed0dd1a9:[()=>n.e(9395).then(n.t.bind(n,9893,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-deep-learning-b26.json",9893],ed2b6bad:[()=>n.e(1799).then(n.bind(n,9537)),"@site/blog/2023-08-16-day-3-100-days-of-code.md",9537],edd09643:[()=>n.e(7186).then(n.t.bind(n,9157,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-file-structures-194.json",9157],edf03cef:[()=>n.e(2505).then(n.bind(n,569)),"@site/blog/2023-08-15-day-2-100-days-of-code.md?truncated=true",569],ee7cd563:[()=>n.e(1747).then(n.t.bind(n,8564,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-model-validation-f56.json",8564],f0e4631f:[()=>n.e(970).then(n.t.bind(n,8660,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-semaphore-b8d.json",8660],f1238b38:[()=>n.e(7477).then(n.bind(n,2066)),"@site/my-brain/linux/systems-call.md",2066],f1e8f4f1:[()=>n.e(3978).then(n.bind(n,2946)),"@site/blog/2023-08-20-day-7-100-days-of-code.md?truncated=true",2946],f2da583d:[()=>n.e(2896).then(n.bind(n,6736)),"@site/blog/2023-08-25-day-11-100-days-of-code.md",6736],f3f0a98f:[()=>n.e(6780).then(n.t.bind(n,5303,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-exclusion-35a.json",5303],f4970b8d:[()=>n.e(3483).then(n.bind(n,2462)),"@site/blog/2023-08-28-day-14-100-days-of-code.md",2462],f4c8f530:[()=>n.e(2854).then(n.bind(n,6640)),"@site/my-brain/data-science/index.md",6640],f569f199:[()=>n.e(402).then(n.bind(n,7124)),"@site/blog/2023-08-29-day-15-100-days-of-code.md?truncated=true",7124],f5f61b79:[()=>n.e(6413).then(n.t.bind(n,6422,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-statistics-b32.json",6422],fa17bbfa:[()=>n.e(8571).then(n.bind(n,8388)),"@site/my-brain/linux/files.md",8388],fc574813:[()=>n.e(1710).then(n.t.bind(n,7816,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-conditional-variables-611.json",7816],fc8586db:[()=>n.e(4127).then(n.bind(n,1292)),"@site/blog/2023-09-10-day-21-100-days-of-code.md",1292],fc970f3e:[()=>n.e(9224).then(n.t.bind(n,1761,19)),"@generated/docusaurus-plugin-content-blog/default/p/blog-tags-data-structures-4a1.json",1761],fca1c61f:[()=>n.e(1966).then(n.bind(n,3809)),"@site/blog/2023-09-03-day-20-100-days-of-code.md",3809],fd28d966:[()=>n.e(5918).then(n.t.bind(n,4048,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-thread-165.json",4048],fd32e9ba:[()=>n.e(7427).then(n.t.bind(n,1471,19)),"@generated/docusaurus-plugin-content-docs/default/p/my-brain-tags-concurrency-f42.json",1471],fe5b346b:[()=>n.e(8652).then(n.bind(n,4546)),"@site/my-brain/leet-code/arrays-and-hashing.md",4546],ff1743d5:[()=>n.e(3893).then(n.bind(n,2454)),"@site/my-brain/linux/kernel.md",2454],ff3c3fb6:[()=>n.e(7854).then(n.bind(n,9946)),"@site/my-brain/machine-learning-and-data-science-course/time-series.md",9946],ffe04193:[()=>n.e(8761).then(n.bind(n,4466)),"@site/my-brain/godot/groups.md",4466]};var s=n(4848);function l(e){let{error:t,retry:n,pastDelay:a}=e;return t?(0,s.jsxs)("div",{style:{textAlign:"center",color:"#fff",backgroundColor:"#fa383e",borderColor:"#fa383e",borderStyle:"solid",borderRadius:"0.25rem",borderWidth:"1px",boxSizing:"border-box",display:"block",padding:"1rem",flex:"0 0 50%",marginLeft:"25%",marginRight:"25%",marginTop:"5rem",maxWidth:"50%",width:"100%"},children:[(0,s.jsx)("p",{children:String(t)}),(0,s.jsx)("div",{children:(0,s.jsx)("button",{type:"button",onClick:n,children:"Retry"})})]}):a?(0,s.jsx)("div",{style:{display:"flex",justifyContent:"center",alignItems:"center",height:"100vh"},children:(0,s.jsx)("svg",{id:"loader",style:{width:128,height:110,position:"absolute",top:"calc(100vh - 64%)"},viewBox:"0 0 45 45",xmlns:"http://www.w3.org/2000/svg",stroke:"#61dafb",children:(0,s.jsxs)("g",{fill:"none",fillRule:"evenodd",transform:"translate(1 1)",strokeWidth:"2",children:[(0,s.jsxs)("circle",{cx:"22",cy:"22",r:"6",strokeOpacity:"0",children:[(0,s.jsx)("animate",{attributeName:"r",begin:"1.5s",dur:"3s",values:"6;22",calcMode:"linear",repeatCount:"indefinite"}),(0,s.jsx)("animate",{attributeName:"stroke-opacity",begin:"1.5s",dur:"3s",values:"1;0",calcMode:"linear",repeatCount:"indefinite"}),(0,s.jsx)("animate",{attributeName:"stroke-width",begin:"1.5s",dur:"3s",values:"2;0",calcMode:"linear",repeatCount:"indefinite"})]}),(0,s.jsxs)("circle",{cx:"22",cy:"22",r:"6",strokeOpacity:"0",children:[(0,s.jsx)("animate",{attributeName:"r",begin:"3s",dur:"3s",values:"6;22",calcMode:"linear",repeatCount:"indefinite"}),(0,s.jsx)("animate",{attributeName:"stroke-opacity",begin:"3s",dur:"3s",values:"1;0",calcMode:"linear",repeatCount:"indefinite"}),(0,s.jsx)("animate",{attributeName:"stroke-width",begin:"3s",dur:"3s",values:"2;0",calcMode:"linear",repeatCount:"indefinite"})]}),(0,s.jsx)("circle",{cx:"22",cy:"22",r:"8",children:(0,s.jsx)("animate",{attributeName:"r",begin:"0s",dur:"1.5s",values:"6;1;2;3;4;5;6",calcMode:"linear",repeatCount:"indefinite"})})]})})}):null}var c=n(6921),u=n(3102);function d(e,t){if("*"===e)return r()({loading:l,loader:()=>n.e(2237).then(n.bind(n,2237)),modules:["@theme/NotFound"],webpack:()=>[2237],render(e,t){const n=e.default;return(0,s.jsx)(u.W,{value:{plugin:{name:"native",id:"default"}},children:(0,s.jsx)(n,{...t})})}});const a=o[`${e}-${t}`],d={},p=[],f=[],m=(0,c.A)(a);return Object.entries(m).forEach((e=>{let[t,n]=e;const a=i[n];a&&(d[t]=a[0],p.push(a[1]),f.push(a[2]))})),r().Map({loading:l,loader:d,modules:p,webpack:()=>f,render(t,n){const r=JSON.parse(JSON.stringify(a));Object.entries(t).forEach((t=>{let[n,a]=t;const o=a.default;if(!o)throw new Error(`The page component at ${e} doesn't have a default export. This makes it impossible to render anything. Consider default-exporting a React component.`);"object"!=typeof o&&"function"!=typeof o||Object.keys(a).filter((e=>"default"!==e)).forEach((e=>{o[e]=a[e]}));let i=r;const s=n.split(".");s.slice(0,-1).forEach((e=>{i=i[e]})),i[s[s.length-1]]=o}));const o=r.__comp;delete r.__comp;const i=r.__context;delete r.__context;const l=r.__props;return delete r.__props,(0,s.jsx)(u.W,{value:i,children:(0,s.jsx)(o,{...r,...l,...n})})}})}const p=[{path:"/about-me",component:d("/about-me","344"),exact:!0},{path:"/blog",component:d("/blog","f59"),exact:!0},{path:"/blog/archive",component:d("/blog/archive","245"),exact:!0},{path:"/blog/day-1-100-days-of-code",component:d("/blog/day-1-100-days-of-code","5d7"),exact:!0},{path:"/blog/day-10-100-days-of-code",component:d("/blog/day-10-100-days-of-code","351"),exact:!0},{path:"/blog/day-11-100-days-of-code",component:d("/blog/day-11-100-days-of-code","520"),exact:!0},{path:"/blog/day-12-100-days-of-code",component:d("/blog/day-12-100-days-of-code","3d1"),exact:!0},{path:"/blog/day-13-100-days-of-code",component:d("/blog/day-13-100-days-of-code","504"),exact:!0},{path:"/blog/day-14-100-days-of-code",component:d("/blog/day-14-100-days-of-code","fed"),exact:!0},{path:"/blog/day-15-100-days-of-code",component:d("/blog/day-15-100-days-of-code","dd0"),exact:!0},{path:"/blog/day-16-100-days-of-code",component:d("/blog/day-16-100-days-of-code","b79"),exact:!0},{path:"/blog/day-17-100-days-of-code",component:d("/blog/day-17-100-days-of-code","647"),exact:!0},{path:"/blog/day-18-100-days-of-code",component:d("/blog/day-18-100-days-of-code","ea5"),exact:!0},{path:"/blog/day-19-100-days-of-code",component:d("/blog/day-19-100-days-of-code","39a"),exact:!0},{path:"/blog/day-2-100-days-of-code",component:d("/blog/day-2-100-days-of-code","8e1"),exact:!0},{path:"/blog/day-20-100-days-of-code",component:d("/blog/day-20-100-days-of-code","457"),exact:!0},{path:"/blog/day-21-100-days-of-code",component:d("/blog/day-21-100-days-of-code","313"),exact:!0},{path:"/blog/day-22-100-days-of-code",component:d("/blog/day-22-100-days-of-code","a4a"),exact:!0},{path:"/blog/day-3-100-days-of-code",component:d("/blog/day-3-100-days-of-code","ee6"),exact:!0},{path:"/blog/day-4-100-days-of-code",component:d("/blog/day-4-100-days-of-code","7d5"),exact:!0},{path:"/blog/day-5-100-days-of-code",component:d("/blog/day-5-100-days-of-code","6b1"),exact:!0},{path:"/blog/day-6-100-days-of-code",component:d("/blog/day-6-100-days-of-code","3b1"),exact:!0},{path:"/blog/day-7-100-days-of-code",component:d("/blog/day-7-100-days-of-code","7b2"),exact:!0},{path:"/blog/day-8-100-days-of-code",component:d("/blog/day-8-100-days-of-code","66d"),exact:!0},{path:"/blog/day-9-100-days-of-code",component:d("/blog/day-9-100-days-of-code","ee7"),exact:!0},{path:"/blog/how-to-code-everyday",component:d("/blog/how-to-code-everyday","076"),exact:!0},{path:"/blog/page/2",component:d("/blog/page/2","f40"),exact:!0},{path:"/blog/page/3",component:d("/blog/page/3","bec"),exact:!0},{path:"/blog/tags",component:d("/blog/tags","4c4"),exact:!0},{path:"/blog/tags/100-days-of-code",component:d("/blog/tags/100-days-of-code","275"),exact:!0},{path:"/blog/tags/100-days-of-code/page/2",component:d("/blog/tags/100-days-of-code/page/2","d89"),exact:!0},{path:"/blog/tags/100-days-of-code/page/3",component:d("/blog/tags/100-days-of-code/page/3","e6d"),exact:!0},{path:"/blog/tags/code",component:d("/blog/tags/code","863"),exact:!0},{path:"/blog/tags/concurrency",component:d("/blog/tags/concurrency","fa7"),exact:!0},{path:"/blog/tags/concurrent-programming",component:d("/blog/tags/concurrent-programming","308"),exact:!0},{path:"/blog/tags/data-science",component:d("/blog/tags/data-science","f67"),exact:!0},{path:"/blog/tags/data-structures",component:d("/blog/tags/data-structures","f84"),exact:!0},{path:"/blog/tags/database",component:d("/blog/tags/database","f4c"),exact:!0},{path:"/blog/tags/db",component:d("/blog/tags/db","0a0"),exact:!0},{path:"/blog/tags/distributed-systems",component:d("/blog/tags/distributed-systems","77e"),exact:!0},{path:"/blog/tags/english",component:d("/blog/tags/english","437"),exact:!0},{path:"/blog/tags/es-lint",component:d("/blog/tags/es-lint","19c"),exact:!0},{path:"/blog/tags/expo",component:d("/blog/tags/expo","5a8"),exact:!0},{path:"/blog/tags/functions",component:d("/blog/tags/functions","992"),exact:!0},{path:"/blog/tags/go",component:d("/blog/tags/go","275"),exact:!0},{path:"/blog/tags/godot",component:d("/blog/tags/godot","0b9"),exact:!0},{path:"/blog/tags/methods",component:d("/blog/tags/methods","f75"),exact:!0},{path:"/blog/tags/nested-tables",component:d("/blog/tags/nested-tables","533"),exact:!0},{path:"/blog/tags/next-js",component:d("/blog/tags/next-js","20c"),exact:!0},{path:"/blog/tags/node-js",component:d("/blog/tags/node-js","caf"),exact:!0},{path:"/blog/tags/object-relational-database",component:d("/blog/tags/object-relational-database","659"),exact:!0},{path:"/blog/tags/object-tables",component:d("/blog/tags/object-tables","aa2"),exact:!0},{path:"/blog/tags/object-types",component:d("/blog/tags/object-types","9ae"),exact:!0},{path:"/blog/tags/odb",component:d("/blog/tags/odb","1a4"),exact:!0},{path:"/blog/tags/oracle",component:d("/blog/tags/oracle","dc3"),exact:!0},{path:"/blog/tags/ord",component:d("/blog/tags/ord","00c"),exact:!0},{path:"/blog/tags/pandas",component:d("/blog/tags/pandas","464"),exact:!0},{path:"/blog/tags/parallelism",component:d("/blog/tags/parallelism","dfc"),exact:!0},{path:"/blog/tags/prettier",component:d("/blog/tags/prettier","003"),exact:!0},{path:"/blog/tags/procedures",component:d("/blog/tags/procedures","063"),exact:!0},{path:"/blog/tags/process",component:d("/blog/tags/process","536"),exact:!0},{path:"/blog/tags/programming",component:d("/blog/tags/programming","62c"),exact:!0},{path:"/blog/tags/python",component:d("/blog/tags/python","b20"),exact:!0},{path:"/blog/tags/react",component:d("/blog/tags/react","ba4"),exact:!0},{path:"/blog/tags/react-native",component:d("/blog/tags/react-native","edc"),exact:!0},{path:"/blog/tags/routine",component:d("/blog/tags/routine","976"),exact:!0},{path:"/blog/tags/seaborn",component:d("/blog/tags/seaborn","59d"),exact:!0},{path:"/blog/tags/swc",component:d("/blog/tags/swc","98d"),exact:!0},{path:"/blog/tags/synchronization-patterns",component:d("/blog/tags/synchronization-patterns","9b7"),exact:!0},{path:"/blog/tags/thread",component:d("/blog/tags/thread","f5f"),exact:!0},{path:"/blog/tags/typescript",component:d("/blog/tags/typescript","665"),exact:!0},{path:"/blog/tags/v-array",component:d("/blog/tags/v-array","4cf"),exact:!0},{path:"/blog/tags/zod",component:d("/blog/tags/zod","6fb"),exact:!0},{path:"/laliga/inimigos",component:d("/laliga/inimigos","957"),exact:!0},{path:"/projects",component:d("/projects","21b"),exact:!0},{path:"/my-brain",component:d("/my-brain","f6e"),routes:[{path:"/my-brain",component:d("/my-brain","1f1"),routes:[{path:"/my-brain/tags",component:d("/my-brain/tags","2c4"),exact:!0},{path:"/my-brain/tags/barrier",component:d("/my-brain/tags/barrier","c08"),exact:!0},{path:"/my-brain/tags/busy-waiting",component:d("/my-brain/tags/busy-waiting","05b"),exact:!0},{path:"/my-brain/tags/classification",component:d("/my-brain/tags/classification","e4d"),exact:!0},{path:"/my-brain/tags/clustering",component:d("/my-brain/tags/clustering","c3a"),exact:!0},{path:"/my-brain/tags/computer-vision",component:d("/my-brain/tags/computer-vision","8a3"),exact:!0},{path:"/my-brain/tags/conceptual-data-model",component:d("/my-brain/tags/conceptual-data-model","e5c"),exact:!0},{path:"/my-brain/tags/concurrency",component:d("/my-brain/tags/concurrency","ba7"),exact:!0},{path:"/my-brain/tags/concurrent-programming",component:d("/my-brain/tags/concurrent-programming","ff3"),exact:!0},{path:"/my-brain/tags/conditional-variables",component:d("/my-brain/tags/conditional-variables","2c9"),exact:!0},{path:"/my-brain/tags/correlation",component:d("/my-brain/tags/correlation","108"),exact:!0},{path:"/my-brain/tags/data-model",component:d("/my-brain/tags/data-model","4d6"),exact:!0},{path:"/my-brain/tags/data-preprocessing",component:d("/my-brain/tags/data-preprocessing","ec5"),exact:!0},{path:"/my-brain/tags/data-science",component:d("/my-brain/tags/data-science","52c"),exact:!0},{path:"/my-brain/tags/database",component:d("/my-brain/tags/database","e66"),exact:!0},{path:"/my-brain/tags/database-administrator",component:d("/my-brain/tags/database-administrator","ab5"),exact:!0},{path:"/my-brain/tags/database-management-system",component:d("/my-brain/tags/database-management-system","4e4"),exact:!0},{path:"/my-brain/tags/databases",component:d("/my-brain/tags/databases","169"),exact:!0},{path:"/my-brain/tags/dba",component:d("/my-brain/tags/dba","cfd"),exact:!0},{path:"/my-brain/tags/dbms",component:d("/my-brain/tags/dbms","3e5"),exact:!0},{path:"/my-brain/tags/decision-trees",component:d("/my-brain/tags/decision-trees","872"),exact:!0},{path:"/my-brain/tags/deep-learning",component:d("/my-brain/tags/deep-learning","b2d"),exact:!0},{path:"/my-brain/tags/design-patterns",component:d("/my-brain/tags/design-patterns","60b"),exact:!0},{path:"/my-brain/tags/development",component:d("/my-brain/tags/development","dd2"),exact:!0},{path:"/my-brain/tags/dimensionality-reduction",component:d("/my-brain/tags/dimensionality-reduction","566"),exact:!0},{path:"/my-brain/tags/disk-storage",component:d("/my-brain/tags/disk-storage","1fb"),exact:!0},{path:"/my-brain/tags/distributed-systems",component:d("/my-brain/tags/distributed-systems","494"),exact:!0},{path:"/my-brain/tags/driver",component:d("/my-brain/tags/driver","bf4"),exact:!0},{path:"/my-brain/tags/elbow-method",component:d("/my-brain/tags/elbow-method","5b9"),exact:!0},{path:"/my-brain/tags/em-algorithm",component:d("/my-brain/tags/em-algorithm","13b"),exact:!0},{path:"/my-brain/tags/entity-relationship-model",component:d("/my-brain/tags/entity-relationship-model","04c"),exact:!0},{path:"/my-brain/tags/exclusion",component:d("/my-brain/tags/exclusion","c83"),exact:!0},{path:"/my-brain/tags/expectation-maximization",component:d("/my-brain/tags/expectation-maximization","4f3"),exact:!0},{path:"/my-brain/tags/feature-engineering",component:d("/my-brain/tags/feature-engineering","7d7"),exact:!0},{path:"/my-brain/tags/feature-extraction",component:d("/my-brain/tags/feature-extraction","6e3"),exact:!0},{path:"/my-brain/tags/feature-selection",component:d("/my-brain/tags/feature-selection","fe4"),exact:!0},{path:"/my-brain/tags/file-structures",component:d("/my-brain/tags/file-structures","9df"),exact:!0},{path:"/my-brain/tags/files",component:d("/my-brain/tags/files","80e"),exact:!0},{path:"/my-brain/tags/forecasting",component:d("/my-brain/tags/forecasting","305"),exact:!0},{path:"/my-brain/tags/hashing",component:d("/my-brain/tags/hashing","2a7"),exact:!0},{path:"/my-brain/tags/histogram",component:d("/my-brain/tags/histogram","c91"),exact:!0},{path:"/my-brain/tags/image-processing",component:d("/my-brain/tags/image-processing","f3e"),exact:!0},{path:"/my-brain/tags/imbalanced-data",component:d("/my-brain/tags/imbalanced-data","156"),exact:!0},{path:"/my-brain/tags/inter-process-communication",component:d("/my-brain/tags/inter-process-communication","74d"),exact:!0},{path:"/my-brain/tags/ipc",component:d("/my-brain/tags/ipc","06d"),exact:!0},{path:"/my-brain/tags/k-means",component:d("/my-brain/tags/k-means","b32"),exact:!0},{path:"/my-brain/tags/linux",component:d("/my-brain/tags/linux","996"),exact:!0},{path:"/my-brain/tags/logic-data-model",component:d("/my-brain/tags/logic-data-model","4c0"),exact:!0},{path:"/my-brain/tags/machine-learning",component:d("/my-brain/tags/machine-learning","81d"),exact:!0},{path:"/my-brain/tags/make",component:d("/my-brain/tags/make","1cb"),exact:!0},{path:"/my-brain/tags/makefile",component:d("/my-brain/tags/makefile","8cf"),exact:!0},{path:"/my-brain/tags/math",component:d("/my-brain/tags/math","49c"),exact:!0},{path:"/my-brain/tags/mer",component:d("/my-brain/tags/mer","471"),exact:!0},{path:"/my-brain/tags/model-validation",component:d("/my-brain/tags/model-validation","cbf"),exact:!0},{path:"/my-brain/tags/multiplex",component:d("/my-brain/tags/multiplex","615"),exact:!0},{path:"/my-brain/tags/mutex",component:d("/my-brain/tags/mutex","927"),exact:!0},{path:"/my-brain/tags/naive-bayes",component:d("/my-brain/tags/naive-bayes","139"),exact:!0},{path:"/my-brain/tags/object-oriented-model",component:d("/my-brain/tags/object-oriented-model","2e7"),exact:!0},{path:"/my-brain/tags/outliers",component:d("/my-brain/tags/outliers","f61"),exact:!0},{path:"/my-brain/tags/parallelism",component:d("/my-brain/tags/parallelism","30b"),exact:!0},{path:"/my-brain/tags/physical-data-model",component:d("/my-brain/tags/physical-data-model","c6c"),exact:!0},{path:"/my-brain/tags/process",component:d("/my-brain/tags/process","5e5"),exact:!0},{path:"/my-brain/tags/python",component:d("/my-brain/tags/python","ee5"),exact:!0},{path:"/my-brain/tags/race-condition",component:d("/my-brain/tags/race-condition","949"),exact:!0},{path:"/my-brain/tags/relational-model",component:d("/my-brain/tags/relational-model","ddd"),exact:!0},{path:"/my-brain/tags/rendezvous",component:d("/my-brain/tags/rendezvous","d4d"),exact:!0},{path:"/my-brain/tags/resampling",component:d("/my-brain/tags/resampling","dda"),exact:!0},{path:"/my-brain/tags/reusable-barrier",component:d("/my-brain/tags/reusable-barrier","d3b"),exact:!0},{path:"/my-brain/tags/routine",component:d("/my-brain/tags/routine","e91"),exact:!0},{path:"/my-brain/tags/sampling",component:d("/my-brain/tags/sampling","e00"),exact:!0},{path:"/my-brain/tags/scikit-learn",component:d("/my-brain/tags/scikit-learn","d2b"),exact:!0},{path:"/my-brain/tags/seaborn",component:d("/my-brain/tags/seaborn","c0a"),exact:!0},{path:"/my-brain/tags/semaphore",component:d("/my-brain/tags/semaphore","b3c"),exact:!0},{path:"/my-brain/tags/signalizing",component:d("/my-brain/tags/signalizing","87e"),exact:!0},{path:"/my-brain/tags/silhouette-analysis",component:d("/my-brain/tags/silhouette-analysis","23d"),exact:!0},{path:"/my-brain/tags/sqlite",component:d("/my-brain/tags/sqlite","91b"),exact:!0},{path:"/my-brain/tags/statistics",component:d("/my-brain/tags/statistics","29e"),exact:!0},{path:"/my-brain/tags/synchronization-patterns",component:d("/my-brain/tags/synchronization-patterns","ec6"),exact:!0},{path:"/my-brain/tags/system-call",component:d("/my-brain/tags/system-call","e56"),exact:!0},{path:"/my-brain/tags/system-design",component:d("/my-brain/tags/system-design","0df"),exact:!0},{path:"/my-brain/tags/thread",component:d("/my-brain/tags/thread","b6b"),exact:!0},{path:"/my-brain/tags/time-series",component:d("/my-brain/tags/time-series","d57"),exact:!0},{path:"/my-brain/tags/uml",component:d("/my-brain/tags/uml","1b1"),exact:!0},{path:"/my-brain/tags/unified-modeling-language",component:d("/my-brain/tags/unified-modeling-language","8d0"),exact:!0},{path:"/my-brain/tags/unsupervised-learning",component:d("/my-brain/tags/unsupervised-learning","53f"),exact:!0},{path:"/my-brain/tags/xml-model",component:d("/my-brain/tags/xml-model","03d"),exact:!0},{path:"/my-brain",component:d("/my-brain","50b"),routes:[{path:"/my-brain/concurrent-programming",component:d("/my-brain/concurrent-programming","7e2"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/concurrent-programming/basic-synchronization-patterns",component:d("/my-brain/concurrent-programming/basic-synchronization-patterns","b86"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/concurrent-programming/classical-synchronization-problems",component:d("/my-brain/concurrent-programming/classical-synchronization-problems","590"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/concurrent-programming/concurrency-vs-parallelism",component:d("/my-brain/concurrent-programming/concurrency-vs-parallelism","c7f"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/concurrent-programming/semaphore",component:d("/my-brain/concurrent-programming/semaphore","f5a"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/concurrent-programming/some-algorithms",component:d("/my-brain/concurrent-programming/some-algorithms","243"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/concurrent-programming/threads-and-process-in-python",component:d("/my-brain/concurrent-programming/threads-and-process-in-python","297"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science",component:d("/my-brain/data-science","756"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/correlation",component:d("/my-brain/data-science/correlation","e37"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/histogram",component:d("/my-brain/data-science/histogram","224"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning",component:d("/my-brain/data-science/machine-learning","0f5"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning/k-means-clustering",component:d("/my-brain/data-science/machine-learning/k-means-clustering","098"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning/machine-learning-specialist-course",component:d("/my-brain/data-science/machine-learning/machine-learning-specialist-course","4ce"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms",component:d("/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-genetic-algorithms","eee"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction",component:d("/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-introduction","180"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm",component:d("/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-svm","1b3"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning",component:d("/my-brain/data-science/machine-learning/machine-learning-specialist-course/machine-learning-specialist-course-unsupervised-machine-learning","1d4"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/databases",component:d("/my-brain/databases","c06"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/databases/data-model-types",component:d("/my-brain/databases/data-model-types","a1e"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/databases/disk-storage-file-structures-and-hashing",component:d("/my-brain/databases/disk-storage-file-structures-and-hashing","0f4"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/databases/sqlite",component:d("/my-brain/databases/sqlite","8e4"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot",component:d("/my-brain/godot","506"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/changing-scenes",component:d("/my-brain/godot/changing-scenes","d49"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/dogot-pausing",component:d("/my-brain/godot/dogot-pausing","e22"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/godot-autoloads",component:d("/my-brain/godot/godot-autoloads","ee6"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/godot-groups",component:d("/my-brain/godot/godot-groups","a29"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/godot-nodes",component:d("/my-brain/godot/godot-nodes","862"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/godot-scenes",component:d("/my-brain/godot/godot-scenes","f13"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/godot-signals",component:d("/my-brain/godot/godot-signals","e35"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/godot/input-mapping",component:d("/my-brain/godot/input-mapping","218"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/Inter-Process Communication",component:d("/my-brain/Inter-Process Communication","21e"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/javascript",component:d("/my-brain/javascript","f62"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/leet-code",component:d("/my-brain/leet-code","bd8"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/leet-code/arrays-and-hashing",component:d("/my-brain/leet-code/arrays-and-hashing","891"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux",component:d("/my-brain/linux","9d1"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux/driver",component:d("/my-brain/linux/driver","9ff"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux/driver-development",component:d("/my-brain/linux/driver-development","1a9"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux/driver-development/make-and-makefile",component:d("/my-brain/linux/driver-development/make-and-makefile","cab"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux/files",component:d("/my-brain/linux/files","72e"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux/linux-kernel",component:d("/my-brain/linux/linux-kernel","73f"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/linux/system-call",component:d("/my-brain/linux/system-call","f42"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course",component:d("/my-brain/machine-learning-and-data-science-course","f77"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/classification",component:d("/my-brain/machine-learning-and-data-science-course/classification","f99"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/classification/decision-trees",component:d("/my-brain/machine-learning-and-data-science-course/classification/decision-trees","9ff"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/classification/naive-bayes",component:d("/my-brain/machine-learning-and-data-science-course/classification/naive-bayes","1b4"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/how-it-works",component:d("/my-brain/machine-learning-and-data-science-course/classification/naive-bayes/how-it-works","b9f"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/computer-vision",component:d("/my-brain/machine-learning-and-data-science-course/computer-vision","219"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/data-pre-processing",component:d("/my-brain/machine-learning-and-data-science-course/data-pre-processing","fee"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/data-pre-processing/categorical-variables",component:d("/my-brain/machine-learning-and-data-science-course/data-pre-processing/categorical-variables","bd5"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/data-pre-processing/data-standardization",component:d("/my-brain/machine-learning-and-data-science-course/data-pre-processing/data-standardization","d39"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data",component:d("/my-brain/machine-learning-and-data-science-course/data-pre-processing/handle-inconsistent-data","36a"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/data-pre-processing/split-data",component:d("/my-brain/machine-learning-and-data-science-course/data-pre-processing/split-data","40f"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/data-pre-processing/variables-types",component:d("/my-brain/machine-learning-and-data-science-course/data-pre-processing/variables-types","c89"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/dimensionality-reduction",component:d("/my-brain/machine-learning-and-data-science-course/dimensionality-reduction","867"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/feature-engineering-and-selection",component:d("/my-brain/machine-learning-and-data-science-course/feature-engineering-and-selection","84b"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/model-validation",component:d("/my-brain/machine-learning-and-data-science-course/model-validation","66b"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/outliers",component:d("/my-brain/machine-learning-and-data-science-course/outliers","568"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/resampling",component:d("/my-brain/machine-learning-and-data-science-course/resampling","03a"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/machine-learning-and-data-science-course/time-series",component:d("/my-brain/machine-learning-and-data-science-course/time-series","679"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/math",component:d("/my-brain/math","8ff"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/math/probability",component:d("/my-brain/math/probability","ad5"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/math/probability/bayes-theorem",component:d("/my-brain/math/probability/bayes-theorem","e49"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/system-design",component:d("/my-brain/system-design","bf5"),exact:!0,sidebar:"myBrainSidebar"},{path:"/my-brain/what-i-am-learning",component:d("/my-brain/what-i-am-learning","5a4"),exact:!0,sidebar:"myBrainSidebar"}]}]}]},{path:"/",component:d("/","e5f"),exact:!0},{path:"*",component:d("*")}]},6125:(e,t,n)=>{"use strict";n.d(t,{o:()=>o,x:()=>i});var a=n(6540),r=n(4848);const o=a.createContext(!1);function i(e){let{children:t}=e;const[n,i]=(0,a.useState)(!1);return(0,a.useEffect)((()=>{i(!0)}),[]),(0,r.jsx)(o.Provider,{value:n,children:t})}},8536:(e,t,n)=>{"use strict";var a=n(6540),r=n(5338),o=n(4625),i=n(545),s=n(8193);const l=[n(119),n(6134),n(6294),n(1043)];var c=n(8328),u=n(6347),d=n(2831),p=n(4848);function f(e){let{children:t}=e;return(0,p.jsx)(p.Fragment,{children:t})}var m=n(5260),g=n(4586),b=n(6025),h=n(6342),y=n(1213),v=n(2131),_=n(4090),x=n(2967),w=n(440),k=n(1463);function S(){const{i18n:{currentLocale:e,defaultLocale:t,localeConfigs:n}}=(0,g.A)(),a=(0,v.o)(),r=n[e].htmlLang,o=e=>e.replace("-","_");return(0,p.jsxs)(m.A,{children:[Object.entries(n).map((e=>{let[t,{htmlLang:n}]=e;return(0,p.jsx)("link",{rel:"alternate",href:a.createUrl({locale:t,fullyQualified:!0}),hrefLang:n},t)})),(0,p.jsx)("link",{rel:"alternate",href:a.createUrl({locale:t,fullyQualified:!0}),hrefLang:"x-default"}),(0,p.jsx)("meta",{property:"og:locale",content:o(r)}),Object.values(n).filter((e=>r!==e.htmlLang)).map((e=>(0,p.jsx)("meta",{property:"og:locale:alternate",content:o(e.htmlLang)},`meta-og-${e.htmlLang}`)))]})}function E(e){let{permalink:t}=e;const{siteConfig:{url:n}}=(0,g.A)(),a=function(){const{siteConfig:{url:e,baseUrl:t,trailingSlash:n}}=(0,g.A)(),{pathname:a}=(0,u.zy)();return e+(0,w.applyTrailingSlash)((0,b.A)(a),{trailingSlash:n,baseUrl:t})}(),r=t?`${n}${t}`:a;return(0,p.jsxs)(m.A,{children:[(0,p.jsx)("meta",{property:"og:url",content:r}),(0,p.jsx)("link",{rel:"canonical",href:r})]})}function A(){const{i18n:{currentLocale:e}}=(0,g.A)(),{metadata:t,image:n}=(0,h.p)();return(0,p.jsxs)(p.Fragment,{children:[(0,p.jsxs)(m.A,{children:[(0,p.jsx)("meta",{name:"twitter:card",content:"summary_large_image"}),(0,p.jsx)("body",{className:_.w})]}),n&&(0,p.jsx)(y.be,{image:n}),(0,p.jsx)(E,{}),(0,p.jsx)(S,{}),(0,p.jsx)(k.A,{tag:x.Cy,locale:e}),(0,p.jsx)(m.A,{children:t.map(((e,t)=>(0,p.jsx)("meta",{...e},t)))})]})}const C=new Map;var T=n(6125),N=n(6988),j=n(205);function O(e){for(var t=arguments.length,n=new Array(t>1?t-1:0),a=1;a{const a=t.default?.[e]??t[e];return a?.(...n)}));return()=>r.forEach((e=>e?.()))}const P=function(e){let{children:t,location:n,previousLocation:a}=e;return(0,j.A)((()=>{a!==n&&(!function(e){let{location:t,previousLocation:n}=e;if(!n)return;const a=t.pathname===n.pathname,r=t.hash===n.hash,o=t.search===n.search;if(a&&r&&!o)return;const{hash:i}=t;if(i){const e=decodeURIComponent(i.substring(1)),t=document.getElementById(e);t?.scrollIntoView()}else window.scrollTo(0,0)}({location:n,previousLocation:a}),O("onRouteDidUpdate",{previousLocation:a,location:n}))}),[a,n]),t};function L(e){const t=Array.from(new Set([e,decodeURI(e)])).map((e=>(0,d.u)(c.A,e))).flat();return Promise.all(t.map((e=>e.route.component.preload?.())))}class R extends a.Component{previousLocation;routeUpdateCleanupCb;constructor(e){super(e),this.previousLocation=null,this.routeUpdateCleanupCb=s.A.canUseDOM?O("onRouteUpdate",{previousLocation:null,location:this.props.location}):()=>{},this.state={nextRouteHasLoaded:!0}}shouldComponentUpdate(e,t){if(e.location===this.props.location)return t.nextRouteHasLoaded;const n=e.location;return this.previousLocation=this.props.location,this.setState({nextRouteHasLoaded:!1}),this.routeUpdateCleanupCb=O("onRouteUpdate",{previousLocation:this.previousLocation,location:n}),L(n.pathname).then((()=>{this.routeUpdateCleanupCb(),this.setState({nextRouteHasLoaded:!0})})).catch((e=>{console.warn(e),window.location.reload()})),!1}render(){const{children:e,location:t}=this.props;return(0,p.jsx)(P,{previousLocation:this.previousLocation,location:t,children:(0,p.jsx)(u.qh,{location:t,render:()=>e})})}}const I=R,F="__docusaurus-base-url-issue-banner-container",D="__docusaurus-base-url-issue-banner",z="__docusaurus-base-url-issue-banner-suggestion-container";function B(e){return`\ndocument.addEventListener('DOMContentLoaded', function maybeInsertBanner() {\n var shouldInsert = typeof window['docusaurus'] === 'undefined';\n shouldInsert && insertBanner();\n});\n\nfunction insertBanner() {\n var bannerContainer = document.createElement('div');\n bannerContainer.id = '${F}';\n var bannerHtml = ${JSON.stringify(function(e){return`\n