Search for a command to run...
DEFINITION
A simple way to define permutations is the rearrangement of elements inside of a variable. For exemplo, if it’s necessary to do a permutation in this numbers “123” we would get this result:
123
132
213
231
312
321
6 possible permutations following the pattern of: number of elements factorial. In this case we have three elements “123” given us: 3! = 3 × 2 × 1 = 6!
No comments yet. Be the first to comment.
Using the Two Sum exercise from LeetCode we can study how a problem can be solved with less complexity. The description of the problem is very simple: Given an array of integers nums and an integer target, return indices of the two numbers such that...
Both array and list are types of data structure that stores a collection of elements. The array has a fixed size while lists are dynamic and can have their size updated during runtime. This main difference directly influences the usage of memory and ...
This article is inspired by the official Microsoft documentation: https://learn.microsoft.com/en-us/dotnet/standard/design-guidelines/naming-guidelines It is advisable to read the original article for a more complete understanding of the subject. I...
How to use Backtracking in simple problems When using backtracking we basically want to “take pictures” of a certain state of our list, object, etc. This “pictures” we save in another list and after we follow two paths. In the first one we increment ...
Joao Developer
5 posts