# Tag: Data Structures

## Leetcode Problem 32: Trapping Rain Water in go

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. Example: Input: [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6… Read more »

## Problem: Container With Most Water

Container With Most Water Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0)…. Read more »

## Elixir Trickery: Cheating on Structs, And Why It Pays Off

While we can’t say cheating on anyone is okay, we’re not as absolutistic when it comes to cheating on Elixir at times. Structs are there for a reason (we’ll start… Read more »

## Go Slices Demystified

Slices are one of those types in Go that take a little bit of time and hands-on experience to really wrap your head around. There is a lot of material… Read more »

## Formula and Lazy Combinators

Formula Library We in Fintech often require to check the values for simple arithmetic conditions, like whether the exchange rate is greater than the desired value, or like. These conditions… Read more »

## Rearrange linked list into an alternating high – low values

Daily Coding Problem: Problem #256 [Medium] Given a linked list, rearrange the node values such that they appear in alternating low -> high -> low -> high … form. For example, given 1 -> 2… Read more »

## Test-Driven Development of Binary Search program in elixir

Binary search is one of the fundamental algorithms in computer science. In order to explore it, we’ll first build up a theoretical backbone, then use that to implement the algorithm… Read more »

## Apply Operations Over Items In A List

Introduction The most basic data structure in Python is the sequence. Each element of a sequence is assigned a number – its position or index. The first index is zero, the… Read more »

## Given an array of integers, return a new array where each element in the new array is the number of smaller elements to the right of that element in the original input array.

This problem was asked by Google. Given an array of integers, return a new array where each element in the new array is the number of smaller elements to the… Read more »

## An Introduction To Backtracking

Today I’d like to give you some tips on how to solve backtracking questions. Backtracking is an effective technique for solving algorithmic problems. In backtracking, we search depth-first for solutions,… Read more »