problem-solving - ayoubed.com

Sign in Subscribe

problem-solving

A collection of 9 posts

Segment Trees, and how you can crack range queries problems

problem-solving

Segment Trees, and how you can crack range queries problems

A quick refresher on segment trees A segment tree is a data structure that allows answering range queries like the sum of subarray a[[l...r] or the minimum element in such a range in O(log n). The segment trees require a linear amount of memory and modify one

Trees: Find the Minimum Difference of two floods

problem-solving

Trees: Find the Minimum Difference of two floods

A sewer drainage system is structured as a tree. Water enters the system at n nodes numbered from 0 to n-1 and flows through the tree to the root, which has the number 0. The tree structure is defined by an array parent, where parent[i] = j means that water

Generate Self Descriptive Numbers

Generate Self Descriptive Numbers

An integer is said to be self-descriptive if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that this digit appears in the number. Write a function that will generate all descriptive numbers with

Sliding Window Maximum

problem-solving

Sliding Window Maximum

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.

Scheduling Problem

problem-solving

Scheduling Problem

The Scheduling Problem is a classic problem in computer science. The goal behind it is to optimize our use of the resources available to us. In this article we'll try to tackle a simple version of said problem. The Problem: suppose we our responsible for the scheduling of

Finding the Eulerian path: reconstruct the itinerary

problem-solving

Finding the Eulerian path: reconstruct the itinerary

A Eulerian path is a path in a graph that passes through all of its edges exactly once. A Eulerian cycle is a Eulerian path that is a cycle. The problem is to find the Eulerian path in an directed multigraph with loops. Algorithm First we can check if there

Find if a string is a concatenation of dictionary words

problem-solving

Find if a string is a concatenation of dictionary words

I had an interview recently with a well known auto-related company(that's all I'm gonna say !). I thought I would share the problem that I faced, how I solved it during the interview, and another simpler solution I found while up solving afterwards. The Problem Given

The smallest intersection set you can get by taking k elements from n intervals

problem-solving

The smallest intersection set you can get by taking k elements from n intervals

It is often the case that out of a number of groups, we desire to take a number of representatives. It is usually our goal to take the smallest number of representatives while making sure that no group is left out. For our case study today we are going to

Tarjan's Algorithm: Finding Strongly Connected Components

problem-solving

Tarjan's Algorithm: Finding Strongly Connected Components

Today, I encountered a problem that I struggled with for a long time. The problem goes like this: -------------------------------------------------------------------------------- There are n servers numbered from 0 to n-1 connected by undirected server-to-server connections forming a network where connections[i] = [a, b] represents a connection between servers a and b. Any