Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no node.....

Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with...

Oh yeah, another easy one

“Collinearity of vectors is the silent language of geometry, where lines speak in unison and points align wit....

I bet you can solve this one

A lil bit of code to drive you nuts

Learn to use the Stack data structure with this exercise. You’d be surprise how simple it is across the board.

Given an array of integers nums, calculate the pivot index of this array.

Python’s solution may really surprise you. While TS & Go follow a different pattern.

Overall, the same pattern across languages, with a few minor tweaks

A naive vs an efficient approach

This one is gonna break you, I promise.

Go’s solution is interesting

You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list.

Let’s just say when you look at Go’s solution and even TS’s, it makes you feel grateful of Python’s simplicity

Given the head of a singly linked list, reverse the list, and return the reversed list.

Given the root of a binary tree, return its maximum depth.

In the world of Dota2, there are two parties: the Radiant and the Dire. Let’s vote using code!