Author: Sergei Golitsyn

In the dynamic realm of technology, continuous learning, innovation, and adaptability are the keys to success. While many senior and middle developers have already honed their skills, staying at the forefront of the ever-evolving tech landscape requires more than just experience. It demands a proactive approach to learning and a thirst for new challenges. One potent way to achieve this is by participating in hackathons.

Hackathons, often seen as a domain for aspiring developers or tech enthusiasts, offer significant advantages for experienced developers as well. In this article, we'll explore why senior and middle developers should consider participating in hackathons and how these events can be instrumental in their ongoing career growth and innovation.

Aloha guys. We are going on about popular interview questions. Today we will solve a few problems with the sliding window approach. 

Best Time To Buy and Sell Stock 

Our first problem is taken from "LeetCode Algorithm Challenges: Best Time to Buy and Sell Stock."

Aloha, guys. Today, we will address more frequently asked questions and solve a few problems using the two-pointers technique. 

This approach is widely used in interview tasks. It is crucial to read the patterns in the condition of the problem and use them when solving it. This approach aims to create two-pointers, usually fast and slow pointers. After that, depending on the condition of the problem, we will move the fast/slow pointers.

Aloha guys. We are going on about popular interview questions. Today we will solve a few problems with hashing approach. 

Our first problem is:

In this article, we will discuss some of the most popular algorithm problems using arrays and hashing approaches. Some of these problems I received during interviews. 

Let's start with a problem:

Aloha guys. Today we are trying to solve three popular linked list problems: Linked List Cycle, Middle of the Linked List, and Remove Duplicates from Sorted List.

Let's start with my favorite Leetcode problem.