Design your implementation of the linked list. You can choose to use a singly or doubly linked list.

The easiest way how to solve this problem is to divide N on 4 and that is it.

Sergei Golitsyn. Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack.

How to implement a last-in-first-out (LIFO) stack using only two queues and why you should use this method based on a set of questions found on Leetcode.

author: Sergei Golitsyn
Implement a first in first out (FIFO) queue using only two stacks

You need to solve this: given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight.

A celebrity is known to everyone, but he does not know anyone at the party.

This post is about providing a solution in Kotlin for finding all valid IP addresses that can be formed by inserting dots into a given string of digits.

This problem asks us to find the maximum amount of water that can be stored in a container formed by two lines, on a 2-dimensional plane and the x-axis.

I am introducing myself. This will be the start of my blogging journey.

Moreover, problems of this type often appear in interviews at major companies, and understanding the methods of their solution can be quite beneficial.

A year of consistent leetcode practice in improving problem solving skills

Discover valuable insights on tackling over 600 LeetCode problems. Gain practical advice and useful resources for mastering coding interviews successfully.

Leetcode is famous for being a perfect platform for practicing coding problems and to master coding interviews, unlike others, it is not for competitive program

Building intuition behind problem solving so you can apply them to your own case scenarios.

4/23/2024: Top 5 stories on the HackerNoon homepage!

Ever wondered how to master 1000 LeetCode problems in six months? You have a shortcut. By learning these ten patterns, you can solve LeetCode easily.