Skip to content

Instantly share code, notes, and snippets.

View rxluz's full-sized avatar

Ricardo Luz rxluz

268 followers · 18 following
View GitHub Profile
@rxluz
rxluz / DATA_STRUCTURES_priorityQueueUsingJSNativeFunctions.js
Last active January 29, 2019 04:47
JS Data Structures: Queues, see more at: https://medium.com/p/17f714057817
function PriorityQueue() {
let priority = []
let nonPriority = []
class PublicPriorityQueue {
size() {
return priority.length + nonPriority.length
}
isEmpty() {
@rxluz
rxluz / DATA_STRUCTURES_nextGreaterNumberWithStack.js
Last active January 29, 2019 04:48
JS Data Structures: Stacks, see more at: https://medium.com/p/7dcea711c091
function Stack() {
let items = []
class PublicStack {
peek() {
if (this.isEmpty()) throw new Error('Stack is empty')
const lastItemIndex = items.length - 1
return items[lastItemIndex]
}
@rxluz
rxluz / DATA_STRUCTURES_reverseStringUsingStack.js
Last active January 29, 2019 04:48
JS Data Structures: Stacks, see more at: https://medium.com/p/7dcea711c091
function Stack() {
let items = []
class PublicStack {
peek() {
if (this.isEmpty()) throw new Error('Stack is empty')
const lastItemIndex = items.length - 1
return items[lastItemIndex]
}
@rxluz
rxluz / DATA_STRUCTURES_decimalToBinaryUsingStacks.js
Last active January 29, 2019 04:49
JS Data Structures: Stacks, see more at: https://medium.com/p/7dcea711c091
function Stack() {
let items = []
class PublicStack {
peek() {
if (this.isEmpty()) throw new Error('Stack is empty')
const lastItemIndex = items.length - 1
return items[lastItemIndex]
}
@rxluz
rxluz / DATA_STRUCTURES_stackUsingNodes.js
Last active January 29, 2019 04:49
JS Data Structures: Stacks, see more at: https://medium.com/p/7dcea711c091
function Stack() {
let top = null
let size = 0
class Node {
constructor(data) {
this.data = data
this.previous = null
}
}
@rxluz
rxluz / DATA_STRUCTURES_stackUsingJSNativeMethods.js
Last active January 29, 2019 04:49
JS Data Structures: Stacks, see more at: https://medium.com/p/7dcea711c091
function Stack() {
let items = []
class PublicStack {
peek() {
if (this.isEmpty()) throw new Error('Stack is empty')
const lastItemIndex = items.length - 1
return items[lastItemIndex]
}
@rxluz
rxluz / DATA_STRUCTURES_reverseArray.js
Last active January 29, 2019 04:50
JS Data Structures: Arrays, see more at: https://medium.com/p/e1bc57bda950
const animals = ['elephant', 'monkey', 'snake', 'lion', 'zebra']
const reverseArray = currentArray => {
for (let index = 0; index < currentArray.length / 2; index++) {
const currentItem = currentArray[index]
const otherItem = currentArray[currentArray.length - 1 - index]
currentArray[index] = otherItem
currentArray[currentArray.length - 1 - index] = currentItem
}
@rxluz
rxluz / DATA_STRUCTURES_removingElementsInMiddleOfAnArray.js
Last active January 29, 2019 04:50
JS Data Structures: Arrays, see more at: https://medium.com/p/e1bc57bda950
const animals = ['elephant', 'monkey', 'snake', 'lion']
const desiredPositionToRemove = 2
for (var index = desiredPositionToRemove; index < animals.length; index++) {
animals[index] = animals[index + 1]
}
animals.length = animals.length - 1
@rxluz
rxluz / DATA_STRUCTURES_removingElementsInBeginingOfAnArray.js
Created January 21, 2019 08:49
JS Data Structures: Arrays, see more at: https://medium.com/p/e1bc57bda950
const animals = ["elephant", "monkey", "snake", "lion"];
for (let index = 0; index < animals.length; index++) {
animals[index] = animals[index + 1];
}
animals.length = animals.length - 1;
console.log(animals);
@rxluz
rxluz / DATA_STRUCTURES_addingElementsInMiddleOfAnArray.js
Created January 21, 2019 08:32
JS Data Structures: Arrays, see more at: https://medium.com/p/e1bc57bda950
const animals = ["elephant", "monkey", "snake", "lion"];
const positionToAddNewItem = 2;
for (let index = animals.length; index > positionToAddNewItem; index--) {
animals[index] = animals[index - 1];
}
animals[positionToAddNewItem] = "macaw";