diff --git a/notes/BGOONZ_BLOG_2.0.wiki/Data-Structures.md b/notes/BGOONZ_BLOG_2.0.wiki/Data-Structures.md index fe32d2c8ef..5d51b90159 100644 --- a/notes/BGOONZ_BLOG_2.0.wiki/Data-Structures.md +++ b/notes/BGOONZ_BLOG_2.0.wiki/Data-Structures.md @@ -186,19 +186,11 @@ Disadvantages Each hash table can be very different, from the types of the keys and values, to the way their hash functions work. Due to these differences and the multi-layered aspects of a hash table, it is nearly impossible to encapsulate so generally. - - - ## Data structure interview questions -
- 🔥See Interview Questions - - - - + 🔥See Interview Questions For many developers and programmers, data structures are most important for [cracking Javascript coding interviews](https://www.educative.io/blog/acing-the-javascript-interview-top-questions-explained). Questions and problems on data structures are fundamental to modern-day coding interviews. In fact, they have a lot to say over your hireability and entry-level rate as a candidate. @@ -225,18 +217,17 @@ There are two ways you could solve this coding problem in an interview. Let's di #### Solution #1: Doing it "by hand" ```js -function removeEven( arr ) { - const odds = []; - for ( let number of arr ) { - if ( number % 2 != 0 ) - // Check if the item in the list is NOT even ('%' is the modulus symbol!) - odds.push( number ); //If it isn't even append it to the empty list - } - return odds; // Return the new list +function removeEven(arr) { + const odds = []; + for (let number of arr) { + if (number % 2 != 0) + // Check if the item in the list is NOT even ('%' is the modulus symbol!) + odds.push(number); //If it isn't even append it to the empty list + } + return odds; // Return the new list } -let example = removeEven( [ 3, 2, 41, 3, 34 ] ); -console.log( 'EXAMPLE:', example ); //EXAMPLE: [ 3, 41, 3 ] - +let example = removeEven([3, 2, 41, 3, 34]); +console.log('EXAMPLE:', example); //EXAMPLE: [ 3, 41, 3 ] ``` This approach starts with the first element of the array. If that current element is not even, it pushes this element into a new array. If it is even, it will move to the next element, repeating until it reaches the end of the array. In regards to time complexity, since the entire array has to be iterated over, this solution is in _O(n)O(n)._ @@ -484,39 +475,36 @@ BinarySearchTree.js Node.js ```js - -"use strict"; -const Node = require( './Node.js' ); +'use strict'; +const Node = require('./Node.js'); module.exports = class BinarySearchTree { - constructor ( rootValue ) { - this.root = new Node( rootValue ); + constructor(rootValue) { + this.root = new Node(rootValue); } - insert( currentNode, newValue ) { - if ( currentNode === null ) { - currentNode = new Node( newValue ); - } else if ( newValue < currentNode.val ) { - currentNode.leftChild = this.insert( currentNode.leftChild, newValue ); + insert(currentNode, newValue) { + if (currentNode === null) { + currentNode = new Node(newValue); + } else if (newValue < currentNode.val) { + currentNode.leftChild = this.insert(currentNode.leftChild, newValue); } else { - currentNode.rightChild = this.insert( currentNode.rightChild, newValue ); + currentNode.rightChild = this.insert(currentNode.rightChild, newValue); } return currentNode; } - insertBST( newValue ) { - if ( this.root == null ) { - this.root = new Node( newValue ); + insertBST(newValue) { + if (this.root == null) { + this.root = new Node(newValue); return; } - this.insert( this.root, newValue ); + this.insert(this.root, newValue); } - preOrderPrint( currentNode ) { - if ( currentNode !== null ) { - console.log( currentNode.val ); - this.preOrderPrint( currentNode.leftChild ); + preOrderPrint(currentNode) { + if (currentNode !== null) { + console.log(currentNode.val); + this.preOrderPrint(currentNode.leftChild); } } -} - - +}; ``` --- @@ -539,8 +527,6 @@ Output: A graph with the edge between the source and the destination removed. removeEdge(graph, 2, 3); ``` - - ![widget](https://www.educative.io/cdn-cgi/image/f=auto,fit=contain,w=600/api/page/6094484883374080/image/download/6038590984290304) ![widget](https://www.educative.io/cdn-cgi/image/f=auto,fit=contain,w=300,q=10/api/page/6094484883374080/image/download/6038590984290304) @@ -556,32 +542,30 @@ LinkedList.js Node.js ```js -const LinkedList = require( './LinkedList.js' ); -const Node = require( './Node.js' ); +const LinkedList = require('./LinkedList.js'); +const Node = require('./Node.js'); module.exports = class Graph { - constructor( vertices ) { - this.vertices = vertices; - this.list = []; - let it; - for ( it = 0; it < vertices; it++ ) { - let temp = new LinkedList(); - this.list.push( temp ); + constructor(vertices) { + this.vertices = vertices; + this.list = []; + let it; + for (it = 0; it < vertices; it++) { + let temp = new LinkedList(); + this.list.push(temp); + } } - } - addEdge( source, destination ) { - if ( source < this.vertices && destination < this.vertices ) - this.list[ source ].insertAtHead( destination ); - return this; - } - printGraph() { - console.log( ">>Adjacency List of Directed Graph<<" ); - let i; - for ( i = 0; i < this.list.length; i++ ) { - process.stdout.write( `|${String( i )}| => ` ); + addEdge(source, destination) { + if (source < this.vertices && destination < this.vertices) this.list[source].insertAtHead(destination); + return this; } - } -} - + printGraph() { + console.log('>>Adjacency List of Directed Graph<<'); + let i; + for (i = 0; i < this.list.length; i++) { + process.stdout.write(`|${String(i)}| => `); + } + } +}; ``` --- @@ -607,25 +591,22 @@ result = [-2, 1, 5, 9, 4, 6, 7]; To solve this problem, we must min heapify all parent nodes. Take a look. ```js - -function minHeapify( heap, index ) { - const left = index * 2; - const right = ( index * 2 ) + 1; - let smallest = index; - if ( ( heap.length > left ) && ( heap[ smallest ] > heap[ left ] ) ) { - smallest = left - } - if ( ( heap.length > right ) && ( heap[ smallest ] > heap[ right ] ) ) - smallest = right; - if ( smallest != index ) { - const tmp = heap[ smallest ]; - heap[ smallest ] = heap[ index ] - heap[ index ] = tmp - minHeapify( heap, smallest ) - } - return heap; +function minHeapify(heap, index) { + const left = index * 2; + const right = index * 2 + 1; + let smallest = index; + if (heap.length > left && heap[smallest] > heap[left]) { + smallest = left; + } + if (heap.length > right && heap[smallest] > heap[right]) smallest = right; + if (smallest != index) { + const tmp = heap[smallest]; + heap[smallest] = heap[index]; + heap[index] = tmp; + minHeapify(heap, smallest); + } + return heap; } - ``` --- @@ -646,5 +627,4 @@ console.log(convertMax(maxHeap)); We consider `maxHeap` to be a regular array and reorder it to accurately represent a min-heap. You can see this done in the code above. The `convertMax()` function then restores the heap property on all nodes from the lowest parent node by calling the `minHeapify()` function. In regards to time complexity, this solution takes _O(nlog(n))O(nlog(n))_ time. -
diff --git a/notes/BGOONZ_BLOG_2.0.wiki/anatomy-of-search-engine.md b/notes/BGOONZ_BLOG_2.0.wiki/anatomy-of-search-engine.md index 215becb572..95aa9098a2 100644 --- a/notes/BGOONZ_BLOG_2.0.wiki/anatomy-of-search-engine.md +++ b/notes/BGOONZ_BLOG_2.0.wiki/anatomy-of-search-engine.md @@ -26,8 +26,8 @@ Computer Science Department, Stanford University, Stanford, CA 94305 ### Abstract > In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at [http://google.stanford.edu/](http://google.stanford.edu/) -> To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. -> Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want. +> To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. +> Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want. > > **Keywords**: World Wide Web, Search Engines, Information Retrieval, PageRank, Google diff --git a/notes/BGOONZ_BLOG_2.0.wiki/articles/anatomy-of-search-engine.md.md b/notes/BGOONZ_BLOG_2.0.wiki/articles/anatomy-of-search-engine.md.md index 215becb572..95aa9098a2 100644 --- a/notes/BGOONZ_BLOG_2.0.wiki/articles/anatomy-of-search-engine.md.md +++ b/notes/BGOONZ_BLOG_2.0.wiki/articles/anatomy-of-search-engine.md.md @@ -26,8 +26,8 @@ Computer Science Department, Stanford University, Stanford, CA 94305 ### Abstract > In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at [http://google.stanford.edu/](http://google.stanford.edu/) -> To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. -> Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want. +> To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description we know of to date. +> Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want. > > **Keywords**: World Wide Web, Search Engines, Information Retrieval, PageRank, Google diff --git a/notes/BGOONZ_BLOG_2.0.wiki/inject5.md b/notes/BGOONZ_BLOG_2.0.wiki/inject5.md index c397805f87..e5a47cc17c 100644 --- a/notes/BGOONZ_BLOG_2.0.wiki/inject5.md +++ b/notes/BGOONZ_BLOG_2.0.wiki/inject5.md @@ -2,15 +2,17 @@ created: 2022-01-16T11:01:24 (UTC -05:00) tags: [] source: https://app.netlify.com/sites/bgoonz-blog/settings/deploys -author: +author: --- # Build & deploy | Site settings > ## Excerpt +> > Settings for Continuous Deployment from a Git repository --- + ## [Continuous Deployment](https://app.netlify.com/sites/bgoonz-blog/settings/deploys#continuous-deployment) Settings for Continuous Deployment from a Git repository @@ -30,29 +32,28 @@ Enabled Build hooks give you a unique URL you can use to trigger a build. - **stackbit-build-hook** - + https://api.netlify.com/build\_hooks/609b2d9f66af5127803b19c3 - + Send a POST request to this webhook to trigger a deploy from [master](https://github.com/stackbit-projects/best-celery-b2d7c/tree/master). - + Example using cURL: - + ``` curl -X POST -d {} https://api.netlify.com/build_hooks/609b2d9f66af5127803b19c3 ``` - + - **gitter** - + https://api.netlify.com/build\_hooks/61dccb6ed7c12040ccc2daef - + Send a POST request to this webhook to trigger a deploy from [master](https://github.com/stackbit-projects/best-celery-b2d7c/tree/master). - + Example using cURL: - + ``` curl -X POST -d {} https://api.netlify.com/build_hooks/61dccb6ed7c12040ccc2daef ``` - [Learn more about build hooks in the docs](https://www.netlify.com/docs/webhooks/#incoming-webhooks) @@ -83,9 +84,9 @@ Control the post processing and optimizations Netlify can do for you Inject analytics or other scripts into the HTML of your site. - before `` - + gtag-n-firebase - + ``` - + - + - + - + ``` - + - before `` - + gtag-in-body - + ``` ``` - + - before `` - + original-analytics - + ``` @@ -146,7 +147,7 @@ Inject analytics or other scripts into the HTML of your site. - + @@ -154,28 +155,28 @@ Inject analytics or other scripts into the HTML of your site. window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); - + gtag('config', 'G-4W5MG3DG4T'); - + ``` - + - before `` - + goback - + ``` ``` - + - before `` - + mdn-style - + ``` ``` - + - before `` - + algolia-head - + ``` @@ -425,28 +426,28 @@ Inject analytics or other scripts into the HTML of your site. }); ``` - + - before `` - + stackbit-widget - + ``` ``` - + - before `` - + addthis - + ``` ``` - + - before `` - + meta - + ``` @@ -474,11 +475,11 @@ Inject analytics or other scripts into the HTML of your site. ``` - + - before `` - + search - + ``` ``` - + - before `` - + mailchimp - + ``` ``` - + - before `` - + google-adds - + ``` @@ -515,7 +516,7 @@ Inject analytics or other scripts into the HTML of your site. window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); - + gtag('config', 'AW-389525629'); @@ -523,40 +524,40 @@ Inject analytics or other scripts into the HTML of your site. gtag('event', 'conversion', {'send_to': 'AW-389525629/_TJRCMyNpIsDEP3g3rkB'}); ``` - + - before `` - + google-search - + ```
``` - + - before `` - + gs-head-script - + ``` ``` - + - before `` - + jquery - + ``` ``` - + - before `` - + search2 - + ``` - + - + ``` - + - before `` - + netlify-identity - + ``` ``` - + - before `` - + netlify-identity - + ``` - - + + ``` - + - before `` - + search - + ``` ``` - + - before `` - + sb-search - + ```
@@ -720,14 +721,14 @@ Inject analytics or other scripts into the HTML of your site. font-weight: 400; font-style: normal } - + #sb-search-example p { font-family: sans-serif; font-size: 18px; line-height: 12px; margin: 0; } - + #sb-search-example { position: static; bottom: 0; @@ -740,8 +741,8 @@ Inject analytics or other scripts into the HTML of your site. flex-shrink: initial; flex-grow: initial; } - - + + #sb-search-example .sb-icon { font: normal normal 400 26px font-sb; align-items: center; @@ -754,7 +755,7 @@ Inject analytics or other scripts into the HTML of your site. cursor: pointer; margin: 0; } - + #sb-search-example .sb-search-icon { box-sizing: border-box; border: 0px; @@ -769,7 +770,6 @@ Inject analytics or other scripts into the HTML of your site.
``` - [Learn more about snippet injection in the docs](https://www.netlify.com/docs/inject-analytics-snippets) diff --git a/notes/BGOONZ_BLOG_2.0.wiki/internal-links.md b/notes/BGOONZ_BLOG_2.0.wiki/internal-links.md index 552314677d..4d8c61eb9a 100644 --- a/notes/BGOONZ_BLOG_2.0.wiki/internal-links.md +++ b/notes/BGOONZ_BLOG_2.0.wiki/internal-links.md @@ -1,10 +1,6 @@ - - - -
- Website Links + Website Links https://bgoonz-blog.netlify.app/ https://bgoonz-blog.netlify.app/javascript diff --git a/package-lock.json b/package-lock.json index 3dda5f04a9..b0ea5e7b8c 100644 --- a/package-lock.json +++ b/package-lock.json @@ -11,7 +11,7 @@ "dependencies": { "@stackbit/gatsby-plugin-menus": "0.0.4", "@stackbit/stackbit-medium-importer": "^0.2.0", - "axios": "^0.16.2", + "axios": "^0.21.2", "babel-runtime": "6.26.0", "chokidar": "3.4.0", "classnames": "2.2.6", @@ -2183,13 +2183,11 @@ } }, "node_modules/axios": { - "version": "0.16.2", - "resolved": "https://registry.npmjs.org/axios/-/axios-0.16.2.tgz", - "integrity": "sha1-uk+S8XFn37q0CYN4VFS5rBScPG0=", - "deprecated": "Critical security vulnerability fixed in v0.21.1. For more information, see https://github.com/axios/axios/pull/3410", + "version": "0.21.2", + "resolved": "https://registry.npmjs.org/axios/-/axios-0.21.2.tgz", + "integrity": "sha512-87otirqUw3e8CzHTMO+/9kh/FSgXt/eVDvipijwDtEuwbkySWZ9SBm6VEubmJ/kLKEoLQV/POhxXFb66bfekfg==", "dependencies": { - "follow-redirects": "^1.2.3", - "is-buffer": "^1.1.5" + "follow-redirects": "^1.14.0" } }, "node_modules/babel-core": { @@ -32035,12 +32033,11 @@ "version": "0.7.0" }, "axios": { - "version": "0.16.2", - "resolved": "https://registry.npmjs.org/axios/-/axios-0.16.2.tgz", - "integrity": "sha1-uk+S8XFn37q0CYN4VFS5rBScPG0=", + "version": "0.21.2", + "resolved": "https://registry.npmjs.org/axios/-/axios-0.21.2.tgz", + "integrity": "sha512-87otirqUw3e8CzHTMO+/9kh/FSgXt/eVDvipijwDtEuwbkySWZ9SBm6VEubmJ/kLKEoLQV/POhxXFb66bfekfg==", "requires": { - "follow-redirects": "^1.2.3", - "is-buffer": "^1.1.5" + "follow-redirects": "^1.14.0" } }, "babel-core": { diff --git a/package.json b/package.json index 82843a39b5..4f35e7115c 100644 --- a/package.json +++ b/package.json @@ -12,7 +12,7 @@ "dependencies": { "@stackbit/gatsby-plugin-menus": "0.0.4", "@stackbit/stackbit-medium-importer": "^0.2.0", - "axios": "^0.16.2", + "axios": "^0.21.2", "babel-runtime": "6.26.0", "chokidar": "3.4.0", "classnames": "2.2.6", diff --git a/src/sass/imports/_docs.scss b/src/sass/imports/_docs.scss index 75a582d239..fddf70c578 100644 --- a/src/sass/imports/_docs.scss +++ b/src/sass/imports/_docs.scss @@ -271,7 +271,7 @@ } } -@media only screen and (min-width: 801px) { +@media only screen and (min-width: 950px) { .docs-content { display: -ms-flexbox; display: flex; @@ -298,12 +298,12 @@ } .docs-nav { - padding-right: 1.5em; + padding-right: 1em; width: 12.5em; } #page-nav { - padding-left: 1.5em; + padding-left: 1em; width: 7.5em; } diff --git a/src/sass/imports/_general.scss b/src/sass/imports/_general.scss index c761a6c820..c67a497955 100644 --- a/src/sass/imports/_general.scss +++ b/src/sass/imports/_general.scss @@ -19,6 +19,7 @@ body { text-rendering: optimizeLegibility; -moz-osx-font-smoothing: grayscale; -webkit-font-smoothing: antialiased; + font-family: Georgia, Cambria, 'Times New Roman', Times, serif; } a { @@ -82,6 +83,16 @@ p { margin: 0 0 1em; } + section p { + margin-bottom: 27px; + font-size: 20px; + line-height: 1.6; + color: #333; + } + + section img { + max-width: 640px; + } mark, ins { background: $yellow-pale;