Author Archives: Stanislav_Panteleev

Source Let us consider the following three type declarations:

Simple swap of the data folders on turned off services of postgres if you have someones db files like this go to registry and find there smth with postgres words

engineGit

Source You have n boxes. You are given a binary string boxes of length n, where boxes[i] is ‘0’ if the ith box is empty, and ‘1’ if it contains one ball.

Source There are n people that are split into some unknown number of groups. Each person is labeled with a unique ID from 0 to n – 1.

Source Given a zero-based permutation nums (0-indexed), build an array ans of the same length where ans[i] = nums[nums[i]] for each 0 <= i < nums.length and return it. A zero-based permutation nums is an array of distinct integers from 0 to nums.length – 1 (inclusive).

source Given an integer array nums of length n, you want to create an array ans of length 2n where ans[i] == nums[i] and ans[i + n] == nums[i] for 0 <= i < n (0-indexed). Specifically, ans is the concatenation of two nums arrays.

CREATING THE PROJECT ! What is webpack? Tool that zip our code to speedup the load of the web page. So in our code we shouild have src and out directories accordingly. Lets create our simple project with the following … Continue reading →

Here is the template for deep equals of objects through rtti. You can expand it or customize

I used neon library, below the example here is github of my test of this library, lib works nice !!! how to use? download sources and provide delphi path to source folder. Thats it!