November 2022 Newsletter

Welcome to the November edition of our monthly newsletter! In this issue, we have a lot of exciting news and updates to share with you. From highlights from the past month to upcoming events, there's a lot to catch up on. We hope you enjoy reading this newsletter and encourage you to share it with others. Thanks for being a part of our community, and we look forward to staying connected with you in the coming month.

The opening you have read is brought to you by “chat.openapi”, and it has prepared some jokes for you as well.

Contents 📋

• News & Explore
• Read & Watch
• Challenge

News & Explore

If you have noticed the images are all output of AI. You can test it out yourselves at ChatGPT (opens in a new tab) to make a conversation, refactor your code…

Eslint Rewrite

After nearly ten years of usage, improvements, and developments, Eslint is about to get a makeover and will be rewritten.

Complete rewrite of ESLint · Discussion #16557 · eslint/eslint (opens in a new tab)

State of JS 2022

The annual developer survey of the JavaScript ecosystem has prepared the latest survey, and it is waiting for you to fill it out.

State of JavaScript 2022 (opens in a new tab)

tRPC - Biggest Release

End-to-end typesafe API tool “tRPC” has released its new major version, 10. Packed with improvements, improvements on DX.

Announcing tRPC v10 | tRPC (opens in a new tab)

GraphQL replacement: tRPC

Since tRPC has its biggest release Echobind team has migrated its codebase from GraphQL to tRPC. Usage, performance, bundle size differences, and more…

Why we ditched GraphQL for tRPC (opens in a new tab)

Ant Design 5.0

Ant Design a design language that we are using in our projects has released its major version 5.

Ant Design 5.0 is released!✨ ANNOUNCEMENT (opens in a new tab)

Expo SDK 47

This one is for mobile developers, Expo has released its new version, and it brings a lot of new features like file-based routing, an updated React version…

Medium Blog Post (opens in a new tab)

Angular is back…

Angular has come back to the playground with its release of version 15. Removing legacy compiler and rendering pipeline, standalone APIs, better stack traces…

https://blog.angular.io/angular-v15-is-now-available-df7be7f2f4c8 (opens in a new tab)

Duplicates in 28 Million Strings

Have you ever tried to figure out how you can find unique values from a given array of values? Imagine this array size is 28 million. How would you solve it?

Deduping 28 Million Strings Using JavaScript (opens in a new tab)

Read & Watch

Let’s Refactor that code

No code shaming; we all have been there and written unnecessary, long code blocks. We are happy that it works, and that’s all you need when starting your journey but let’s see how this can be refactored and optimized.

Refactoring A Junior’s React Code - 43% Less Code With A Better Data Structure (opens in a new tab)

Next.js and TS plugin

Watch the thread on Twitter that explains a new plugin that is made for Next.js to see how it can help you.

Delba on Twitter (opens in a new tab)

GitHub Universe

GitHub’s online conference, updates, news, and the latest information. Check out their videos to go through for GitHub Universe Event.

GitHub (opens in a new tab)

Traits You Can Change and Traits You Can't

As humans, we tend to adapt, improve, and change; some things that we might be able to change, and some we may not able to.

Traits You Can Change, and Traits You Can’t (opens in a new tab)

Challenge

Like our introduction this month, our challenge is generated by AI as well.

Create a class called Tree that represents a binary tree. The class should have the following methods:

• insert(value: T): void: inserts a value into the tree. The value should be inserted in the correct position according to the rules of a binary tree (i.e., to the left of a node if it is less than the node's value, and to the right if it is greater than the node's value).
• find(value: T): T | null: searches the tree for the specified value and returns it if it is found, or null if it is not found.
• traverse(): T[]: returns an array of all the values in the tree in the order they were inserted.
• remove(value: T): void: removes the specified value from the tree if it exists.

The Tree class should be generic so that it can work with any type of value (not just numbers).

To solve this challenge, you will need to use TypeScript's type system and type-checking features to ensure that the Tree class works correctly with any type of value. You will also need to implement the binary tree data structure and its associated methods in a correct and efficient manner.

Good luck!

Here is an example of how the class should be used:

// create a new Tree of numbers
const tree = new Tree<number>();
 
// insert some values
tree.insert(10);
tree.insert(5);
tree.insert(15);
tree.insert(3);
 
// traverse the tree and get an array of all the values in order
const values = tree.traverse();
console.log(values);
// should print [3, 5, 10, 15]
 
// search for a value
const searchResult = tree.find(5);
console.log(searchResult);
// should print 5
 
// remove a value
tree.remove(5);
 
// traverse the tree again to verify that the value was removed
const updatedValues = tree.traverse();
console.log(updatedValues);
// should print [3, 10, 15]