Skip to content

Latest commit

 

History

History
299 lines (223 loc) · 26.3 KB

File metadata and controls

299 lines (223 loc) · 26.3 KB

drawing

Let's learn about Leetcode via these 72 free blog posts. They are ordered by HackerNoon reader engagement data. Visit the /Learn or LearnRepo.com to find the most read blog posts about any technology.

LeetCode is an online platform offering a vast collection of coding challenges and algorithmic problems. It helps developers hone their coding skills, prepare for technical interviews, and improve problem-solving proficiency, making it essential for career advancement.

The process of preparing for coding interviews is anxiety-inducing for many developers. There’s so much material to cover, and often much of it feels irrelevant to what devs are doing in their day jobs, which only adds to the stress.

An easy approach to the hard leetcode problem Merge k Sorted Lists from that many people using Java Algorithms will need to learn in order to be effective.

Linked List in Binary Tree

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

A trie (pronounced as “try”) or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings.

We can use LinkedList to merge both sorted lists, though there are considerations to doing it single or double-linked that may complicate the operation.

In this article, you will learn how to code a Binary Tree Right side view in LeetCode.

We will learn how to solve "Number of Islands" from Blind 75 LeetCode Questions.

How to Find the Product of All Elements in an Array Except Self? You must write an algorithm that runs in O(n) time and without using the division operation.

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.

Clone Graph Blind75 LeetCode Problem

Returning an array of the non-overlapping intervals that span every input interval.

Given the root of a binary tree, determine if it is a valid binary search tree (BST

Exploring coding platforms: My insights and experiences shared. Discover the pros and cons of informed choices. Join me on this insightful journey!

"Optimizing List Manipulation: Two Pointers Technique" explores the effective application of the two-pointer technique to efficiently manipulate lists, reducing

How to prep for coding interviews by using patterns to figure out how to guess the most likely questions to be asked in many programming job interviews.

Dive deep into the world of Transformer models and algorithmic understanding in neural networks.

The article explores the Sliding Window pattern's efficient application through illustrative examples.

The First Missing Positive problem is an algorithm problem that requires finding the smallest positive integer that is not present in a given unsorted array of

How to Master Data Structures and Algorithms and Leetcode and Codeforces Contests for Beginners.

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.

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

Large-scale test with Gemini Pro 1.0 and 1.5, Claude Opus, and ChatGPT-4 on hundreds of real algorithmic problems.

With the help of the backtracking algorithm, I will solve the permutations and subsets problems in Java that are frequently used during job interviews.

All data structures and algorithms concepts and solutions to various problems in Python3 stored in a structured manner to prepare for coding interviews.

Large-scale LLMs test (o1, o3-mini; Gemini 2.0 Flash, 2.0 Pro, 2.5 Pro; DeepSeek V3, R1; xAI Grok; Claude 3.7 Sonnet) on solving Leetcode algorithmic problems

This article aims to find out how much of ChatGPT's performance is "problem-solving ability" versus sheer randomness or “memorization of the correct solution.

Solving k-th largest element in the array using heap and quickselect

I made a Chrome extension that generates random LeetCode questions for you to practice with every day. Here's how I did it.

Benchmark of 5 LLMs solving LeetCode problems in Python, Java, Rust, Elixir, Oracle SQL and MySQL. Results show language popularity correlates with success.

Coding Ninja Says: Accelerate your career by solving leetcode analysis paralysis with additional career advice

Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.

In this article, I want to share a great life hack on how to always stay afloat in the IT market and keep yourself in shape by spending 10-30 minutes a day

This article describes several solutions and approaches to the "Bulb Switcher" problem.

Graphs model pairwise relationships with vertices and edges.

Leetcode.com is a website where people–mostly software engineers–practice their coding skills. It’s pretty similar to sites like HackerRank & Topcoder which will rank your code written for a particular problem against the ones submitted by other users.

I have talked to many Android developers, and most of them are excited about Kotlin. So am I. When I just started learning Kotlin, I was solving Kotlin Koans, and along with other great features, I was impressed with the power of functions for performing operations on collections. Since then, I spent three years writing Kotlin code but rarely utilised all the potential of the language.

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.

Sergei Golitsyn. Find the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit int

Binary Lifting and its use in finding Lowest Common Ancestor (LCA). Explore this amazing algorithm that speeds up ancestor queries in the tree data structure.

In hamming distance problem, we find the number of positions where the bits are different for the given input with constant time complexity.

Master 7 key LeetCode patterns (Sliding Window, Two Pointers, DP & more) for 2025 coding interviews. Includes code examples & 12-week study plan.

This post is about preorder traversal of a binary tree, a method of traversing the tree in which the current node is visited before its children.

author: Sergei Golitsyn https://t.me/crack_code_interview

  1. return true if any value appears at least twice
  2. number in the range that is missing from arr

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.

Dyanmic Programming isn't as hard as people think. We'll break it down in this guide.

In this lesson, we will try to check if the given number is a power of 2. We solve this by writing an efficient algorithm that takes an optimal amount of time.

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

Learn everything you need to know about Data Structures via these 87 free HackerNoon stories.

If your résumé has no strong projects, you might get rejected. On the flip side, if you haven’t done any interview prep, you might bomb the actual interviews.

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.

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

I am a big fan of leet code so when we decided to have a code challenge in our team I thought it wouldn’t be a bad idea to build one which should include pretty basic functionalities like:

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.

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

DSA-Guide: Guide to DSA Problem for Leetcode, Codechef, CSES, GFG

I recently got an intern offer from Google for Summer 2020. I have been practicing LeetCode problems for more than two years. Other than the LC problems, I have used the educative courses to help me prepare the coding interviews.

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

The staircase problem is a challenging and well-studied problem that may stump beginners. However, experienced developers can solve it in just five lines.

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

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.

I dive into LeetCode problem: 881, Boats to Save People. I try to use Count Sort to optimize my solution.

Part 2 on my series about dynamic programming problems and coding techniques to solve them.

Using Kotlin at your technical interviews!

LeetCode interviews measure pattern recall, not engineering skill. Here's why the old model is broken, and what better hiring actually looks like.

A year of consistent leetcode practice in improving problem solving skills

Reflecting on 2023 with my accomplishments and programming goals and seeing where 2024 takes me.

Automate your daily task with Cloudflare Worker's Cron job with an example using LeetCode and Todoist. Test Cloudflare worker cron trigger using Miniflare.

Learn how to succeed in coding interviews by clarifying the problem, thinking out loud, coding cleanly, and handling getting stuck.

4/8/2025: Top 5 stories on the HackerNoon homepage!

I scraped 1500+ tech interview questions to expose company biases. Stop paying $35/mo for LeetCode Premium. Search your target company's exact data for free.