Elevator System Low Level Design
Problem definition You are tasked with designing an elevator system for an office building. Questions for the interviewer Requirements R1. […]
Low Level Design Interview Structure
Problem definition This section represents the initial requirements and expectations provided by the interviewer. Example:Design a vending machine for snacks.
Interview preparation, LeetCode
Integer to English Words – task solution (LeetCode)
The task “Integer to English Words” can be solved as follows:
Interview preparation, LeetCode
Integer to Roman – task solution (LeetCode)
I’m going to describe how to solve the task Integer to Roman from LeetCode using greedy algorithm. Time complexity: O(1)
Без рубрики
Bellman-Ford algorithm
We can’t use Dijkstra algorithm to find the shortest path in a graph if there are any negative weights in
Common algorithms, Interview preparation
Dijkstra algorithm
The Dijkstra algorithm serves to find the cheapest path in acyclic graphs with positive weights. The algorithms can be described
Common algorithms, Interview preparation
Counting sort
This is a very fast algorithm, but can only be used with arrays with integer values. This algorithm can be
Common algorithms, Interview preparation
Quick sort
This algorithm is slightly faster than merge sort and heap sort on random data. Uses a divide-and-conquer approach. The main
Common algorithms, Interview preparation
Merge sort
Merge sort is an efficient, stable divide-and-conquer algorithm. The main idea of this algorithm is as follows: Time complexity: O(n
Common algorithms, Interview preparation
Insertion sort
This algorithm is smarter than bubble sort and selection sort. The main idea of the algorithm is as follows: The