C#.TelegramCommands.LearnEngine

engineGit

How to send message from code ?

await _telegramBotClient.SendTextMessageAsync(chatId, text: «this is start command»);

Simple command handler for /start command. You can use

Читать на сайте автора.

Algo. Minimum Number of Operations to Move All Balls to Each Box

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.

In one operation, you can move one ball from a

Читать на сайте автора.

Algo. Group the People Given the Group Size They Belong To

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.

You are given an

Читать на сайте автора.

Algo. Build Array from Permutation

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.

zero-based permutation nums is an array of distinct integers from 0 to nums.length —

Читать на сайте автора.

Algo. Concatenation of Array

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

Читать на сайте автора.

Js.Webpack

npm init -y npm install webpack webpack-cli —save-dev

lets create our pet project

index.html, there is dependency from loadash on the web https://unpkg.com/[email protected]

<!DOCTYPE

Читать на сайте автора.

Delphi.DeepEqualsTemplate

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

unit DeepEquals; interface uses classes, rtti; type TObjectHelpers

Читать на сайте автора.

Delphi.Serialization with neon lib

I used neon library, below the example

here is github of my test of this library, lib works nice !!!

how to use? download sources

Читать на сайте автора.

LinkedLists.Reverse

optimal solution

public ListNode Reverse(ListNode head){ var node = head; ListNode prev = null; while(node != null){ var next = node.next; node.next = prev;

Читать на сайте автора.

LinkedLists.FakeNode

To avoid border cases we can create a fake or how it is called sentinel node

public void DoSmth(ListNode head) { ListNode fakeNode = new

Читать на сайте автора.