<ul><li>Class Inheritance: A class is like a blueprint — a description of the object to be created. Classes inherit from classes and create subclass relationships: hierarchical class taxonomies.</li><li>Prototypal Inheritance: A prototype is a working object instance. Objects inherit directly from other objects.</li></ul>

What’s the Difference Between Class & Prototypal Inheritance?

<ul><li>The tight coupling problem (class inheritance is the tightest coupling available in oo design), which leads to the next one…</li><li>The fragile base class problem</li><li>Inflexible hierarchy problem (eventually, all evolving hierarchies are wrong for new uses)</li><li>The duplication by necessity problem (due to inflexible hierarchies, new use cases are often shoe-horned in by duplicating, rather than adapting existing code)</li><li>The Gorilla/banana problem (What you wanted was a banana, but what you got was a gorilla holding the banana, and the entire jungle).</li></ul>

Class Inheritance Causes Many Problems

<ul><li>Concatenative inheritance: The process of inheriting features directly from one object to another by copying the source objects properties.&nbsp;</li><li>Prototype delegation: If a property is not found on the object, the lookup is delegated to the delegate prototype, which may have a link to its own delegate prototype, and so on up the chain until you arrive at `Object.prototype`, which is the root delegate.&nbsp;</li><li>Functional inheritance: In JavaScript, any function can create an object. When that function is not a constructor (or `class`), it’s called a factory function.&nbsp;</li></ul>

There Are Three Kinds of Prototypal OO

Objects are frequently used in JavaScript, and understanding how to work with them effectively will be a huge win for your productivity. In fact, poor OO design can potentially lead to project…

Stashed ideas

Master the JavaScript Interview: What’s the Difference Between Class & Prototypal Inheritance?

A weighted graph is interesting because it has little to do with whether the graph is directed, undirected, or contains cycles.&nbsp;At its core, a weighted graph is a graph whose edges have some sort of value that is associated with them. The value that is attached to an edge is what gives the edge its “weight”.

Graphs that weigh heavy on your mind

Dijkstra’s algorithm can be used to determine the shortest path from one node in a graph to every other node within the same graph data structure, provided that the nodes are reachable from the starting node.

Dijkstra’s algorithm

The abstracted rules are as follows:&nbsp;<ul><li>Every time that we set out to visit a new node, we will choose the node with the smallest known distance/cost to visit first.&nbsp;</li><li>Once we’ve moved to the node we’re going to visit, we will check each of its neighboring nodes.&nbsp;</li><li>For each neighboring Node, we’ll calculate the Distance/Cost by summing the cost of the edges that lead to the Node we’re checking.</li><li>Finally, if the distance/cost to a node is less than a known distance, we’ll update the shortest distance that we have on file for that vertex.&nbsp;</li></ul>

Rules of Dijkstra’s game

If you spend enough time reading about programming or computer science, there’s a good chance that you’ll encounter the same ideas, terms, concepts, and names, time and again. Some of them start to…

Finding The Shortest Path, With A Little Help From Dijkstra

Returns an infinite iterator that produces evenly spaced values starting with number start.It's often used in combination with map() to generate consecutive data points, and with zip() to add sequence numbers.

itertools.count(start=0, step=1)

Assume you have three lists and you want to turn them into a table-like structure, where each row has a numeric ID.You can combine count() with zip() to add sequence numbers to the resulting tuples. See code in image.

Add sequence numbers

Software Development

Python's Infinite Count Generator

Here are some of the popular array-based coding interview questions for your practice:&nbsp;<ul><li>How do you find the missing number in a given integer array of 1 to 100?&nbsp;&nbsp;</li><li>How do you find the duplicate number on a given integer array?&nbsp;&nbsp;</li><li>How do you find the largest and smallest number in an unsorted integer array?&nbsp;&nbsp;</li><li>How do you find all pairs of an integer array whose sum is equal to a given number?&nbsp;&nbsp;</li><li>How do you find duplicate numbers in an array if it contains multiple duplicates?&nbsp;&nbsp;</li><li>How are duplicates removed from a given array in Java?&nbsp;&nbsp;</li></ul>

Array Coding Interview Questions

Here are some of the most common and popular linked list interview questions and their solutions:&nbsp;<ul><li>How do you find the middle element of a singly linked list in one pass?&nbsp;&nbsp;</li><li>How do you check if a given linked list contains a cycle? How do you find the starting node of the cycle?&nbsp;&nbsp;</li><li>How do you reverse a linked list? ( solution )&nbsp;&nbsp;</li><li>How do you reverse a singly linked list without recursion?&nbsp;&nbsp;</li><li>How are duplicate nodes removed in an unsorted linked list?&nbsp;&nbsp;</li><li>How do you find the length of a singly linked list?&nbsp;&nbsp;</li></ul>

Linked List Programming Interview Questions

Here is my list of frequently asked string coding questions from programming job interviews:&nbsp;<ul><li>How do you print duplicate characters from a string?&nbsp;&nbsp;</li><li>How do you check if two strings are anagrams of each other?&nbsp;&nbsp;</li><li>How do you print the first non-repeated character from a string?&nbsp;&nbsp;</li><li>How can a given string be reversed using recursion?&nbsp;&nbsp;</li><li>How do you check if a string contains only digits?&nbsp;&nbsp;</li><li>How are duplicate characters found in a string?&nbsp;&nbsp;</li><li>How do you count the number of vowels and consonants in a given string?&nbsp;&nbsp;</li></ul>

String Coding Interview Questions

Here is a list of popular binary tree-based coding questions from software engineer or developer job interviews:&nbsp;<ul><li>How is a binary search tree implemented?&nbsp;&nbsp;</li><li>How do you perform preorder traversal in a given binary tree?&nbsp;&nbsp;</li><li>How do you traverse a given binary tree in preorder without recursion?&nbsp;&nbsp;</li><li>How do you perform an inorder traversal in a given binary tree?&nbsp;&nbsp;</li><li>How do you print all nodes of a given binary tree using inorder traversal without recursion?&nbsp;&nbsp;</li><li>How do you implement a postorder traversal algorithm?&nbsp;&nbsp;</li></ul>

Binary Tree Coding Interview Questions

<ul><li>How is a bubble sort algorithm implemented?&nbsp;&nbsp;</li><li>How is an iterative quicksort algorithm implemented?&nbsp;&nbsp;</li><li>How do you implement an insertion sort algorithm?&nbsp;&nbsp;</li><li>How is a merge sort algorithm implemented?&nbsp;&nbsp;</li><li>How do you implement a bucket sort algorithm?&nbsp;&nbsp;</li><li>How do you implement a counting sort algorithm?&nbsp;&nbsp;</li><li>How is a radix sort algorithm implemented?&nbsp;&nbsp;</li><li>How do you swap two numbers without using the third variable?&nbsp;&nbsp;</li></ul>

Miscellaneous Coding Interview Questions

There are a lot of computer science graduates and programmers applying for programming, coding, and software development roles at startups like Uber and Netflix; big organizations like Amazon…

Top 50 Data Structure and Algorithms Interview Questions for Programmers | by javinpaul | Javarevisited | Medium

Functional programming (often abbreviated FP) is the process of building software by composing pure functions, avoiding shared state, mutable data, and side effects. Functional programming is declarative rather than imperative, and application state flows through pure functions. Contrast with object oriented programming, where application state is usually shared and colocated with methods in objects.Functional programming is a programming paradigm, meaning that it is a way of thinking about software construction based on some fundamental, defining principles&nbsp;

Functional Programming

A pure function is a function which:<ul><li>Given the same inputs, always returns the same output, and</li><li>Has no side-effects</li></ul>Pure functions have lots of properties that are important in functional programming.Function composition is the process of combining two or more functions in order to produce a new function or perform some computation.

Functions

Shared state is any variable, object, or memory space that exists in a shared scope, or as the property of an object being passed between scopes.&nbsp;A shared scope can include global scope or closure scopes. Often, in object oriented programming, objects are shared between scopes by adding properties to other objects.

Shared State

An immutable object is an object that can’t be modified after it’s created. Conversely, a mutable object is any object which can be modified after it’s created.Immutability is a central concept of functional programming because, without it, the data flow in your program is lossy.&nbsp;

Immutability

A side effect is any application state change that is observable outside the called function other than its return value. Side effects include:<ul><li>Modifying any external variable or object property (e.g., a global variable, or a variable in the parent function scope chain)</li><li>Logging to the console</li><li>Writing to the screen</li><li>Writing to a file</li><li>Writing to the network</li><li>Triggering any external process</li><li>Calling any other functions with side-effects.</li></ul>

Side Effects

A higher order function is any function that takes a function as an argument, returns a function, or both. Higher order functions are often used to:<ul><li>Abstract or isolate actions, effects, or async flow control using callback functions, promises, monads, etc…</li><li>Create utilities which can act on a wide variety of data types</li><li>Partially apply a function to its arguments or create a curried function for the purpose of reuse or function composition</li><li>Take a list of functions and return some composition of those input functions.</li></ul>

Reusability Through Higher Order Functions

Functional programming is a declarative paradigm, meaning that the program logic is expressed without explicitly describing the flow control.<ul><li>Imperative programs spend lines of code describing the specific steps used to achieve the desired results — the flow control: How to do things.</li><li>Declarative programs abstract the flow control process, and instead spend lines of code describing the data flow: What to do. The how gets abstracted away.</li></ul>

Declarative vs Imperative

Functional programming has become a really hot topic in the JavaScript world. Just a few years ago, few JavaScript programmers even knew what functional programming is, but every large application…

datascience

What’s the Difference Between Class & Prototypal Inheritance?

Master the JavaScript Interview: What’s the Difference Between Class & Prototypal Inheritance?

Graphs that weigh heavy on your mind

Finding The Shortest Path, With A Little Help From Dijkstra