Meet TS 5.7 With New Features And 100 Code Examples Of Algorithms And Data Structures!

Hello, checkiomates🐱‍👤!

Besides mentioned in title check an interesting realization of tic-tac-toe game and our new mission about counting roads to Rome!

💡TIP

If you find an interesting solution, you may add it to your bookmarks by clicking the flag near solution title. You can find all your bookmarked solutions by clicking your nickame and then "Bookmarks". If you want to discover all CheckiO features, visit our tutorial. It's a longread, but it's worth it!

🏁MISSION

All Roads Lead to Rome! by freeman_lex -

You are standing at the point (x, y) in the lattice grid of pairs of non-negative numbers, and wish to make your way to the origin point (0, 0). At any point, you are allowed to move either one step left or one step down. Furthermore, you are never allowed to step into any of the points in the tabu list (origin is never in tabu). This function should add up the number of different paths that lead from the point (x,y) to the origin (0,0) under these constraints.

assert.strictEqual(latticePaths([3, 3], []), 20);
assert.strictEqual(latticePaths([3, 4], [[2, 2]]), 17);
assert.strictEqual(latticePaths([10, 5], [[6, 1], [2, 3]]), 2063);

📖ARTICLE

Over 100 Algorithms and Data Structures Demonstrated in JS -

Examples of numerous common algorithms (e.g. bit manipulation, Pascal’s triangle, Hamming distance) and data structures (e.g. linked lists, tries, graphs) with explanations.

Announcing TypeScript 5.7 Beta -

The newest TypeScript is on the way. Let’s take a look at what’s new in TypeScript 5.7!

Building a Tic-Tac-Toe Game in TypeScript Types -

In this video we will do something completely useless but extremely funny. We will build a fully functional tic-tac-toe gaming only using TypeScript types.

👩‍💻CODE SHOT

It's a very simple task! Dont be shy) How do you think, what the following code does?

function ?????????(text: string, words: string[]): boolean {
    if (!words)
        return false;
    let temp: number = 0;
    for (let i = 0; i < words.length; i++)
        {
            if (text.indexOf(words[i]) <= temp)
                return false;
            temp = text.indexOf(words[i]);
}
    return true;
}

🙌 Thanks for your attention! Hope to meet you at CheckiO, as well as at our Instagram and Twitter! We are really interested in your thoughts! Please, leave a comment below! ⤵