./c² cagataycali

Hack the (things || ideas) with code, equipped with JS and coding skills which gained at an early age.

cagataycali / fast-coding.js

Last active November 16, 2021 00:22

[JavaScript] Binary tree find successor

	const assert = require('assert');

	// Finding successor means, traverse the tree by inorder and the selected node's previous node is successor.
	function findSuccessor(root, node) {
	// Right child exists, move to the left most child for right branch,
	// If the right child does not exists, successor will be rigth most parent,
	if (node.right !== null) return getLeftmostChild(node.right);

	return getRightmostParent(node);
	}

cagataycali / bst-min-height.js

Last active November 16, 2021 00:15

[JavaScript] Binary search tree find min height

	const assert = require('assert');

	// Write function that takes in a non-empty sorted array of distinct integers,
	// constructs a BST from the integers, and returns the root of the BST.
	function minHeightBst(array) {
	// Find the median of array,
	return constructMinHeightBST(array, 0, array.length - 1)
	}

	function constructMinHeightBST(array, startIndex, endIndex) {

cagataycali / traversal.js

Created November 13, 2021 23:18

[JavaScript] Binary search tree traversals

	const assert = require("assert");

	function BST(value) {
	this.value = value;
	this.left = null;
	this.right = null;
	}

	// Left, root, right - root is mid
	function inOrderTraverse(tree, array) {

cagataycali / auto-complete.html

Created November 13, 2021 22:48

[JavaScript] Auto complete

	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8" />
	<meta http-equiv="X-UA-Compatible" content="IE=edge" />
	<meta name="viewport" content="width=device-width, initial-scale=1.0" />
	<title>Auto complete</title>
	<style>
	.auto-complete {
	width: 300px;

cagataycali / accordion.html

Last active November 12, 2021 21:15

[JavaScript] Over engineered accordion

	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8" />
	<meta http-equiv="X-UA-Compatible" content="IE=edge" />
	<meta name="viewport" content="width=device-width, initial-scale=1.0" />
	<title>Accordion</title>
	<style>
	.accordion-wrapper {
	display: flex;

cagataycali / breath-first-search.js

Created November 8, 2021 23:07

[JavaScript] Graph breath first search

	class Node {
	constructor(name) {
	this.name = name;
	this.children = [];
	}

	addChild(name) {
	this.children.push(new Node(name));
	return this;
	}

cagataycali / single-cycle-check.js

Created November 8, 2021 21:40

[JavaScript] Graph single cycle check

	const assert = require('assert');

	function hasSingleCycle(array) {
	let numberOfVisitedNodes = 0;
	let currentIndex = 0;
	while (numberOfVisitedNodes < array.length) {
	// If we go back to the first element,
	// That shows, we have an infinite loop before our loop ends.
	if (currentIndex === 0 && numberOfVisitedNodes > 0) return false;
	currentIndex = jump(currentIndex, array);

cagataycali / depth-first-search.js

Created November 8, 2021 21:07

[JavaScript] Graph depth first search

	const assert = require("assert");

	class Node {
	constructor(name) {
	this.name = name;
	this.children = [];
	}

	addChild(name) {
	this.children.push(new Node(name));

cagataycali / merge-sorted-linked-lists.js

Last active November 6, 2021 19:32

[JavaScript] Merge two sorted linked lists

	function mergeLinkedLists(headOne, headTwo) {
	let p1 = headOne;
	let p1Prev = null;
	let p2 = headTwo;
	while (p1 !== null && p2 !== null) {
	// If our second linkedlist's pointer value is bigger
	if (p1.value < p2.value) {
	// Store the previous
	p1Prev = p1;
	// Move the pointer to next item.

cagataycali / word-ladder.js

Created November 5, 2021 17:39

[JavaScript] Word ladder

	const assert = require("assert");
	// Leetcode: https://leetcode.com/problems/word-ladder/
	// Leetcode: https://leetcode.com/problems/word-ladder-ii/

	// Inputs: beginWord = "hit", endWord = "cog", wordList = ["hot","dot","dog","lot","log","cog"]
	// Output: 5

	/*
	A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: