19 docs tagged with "problem-solving"

Removing a key from a B-tree while maintaining balance

This document explains the 'Deleting the middle element of a linked list' problem, including its description, approach, and implementation.

The "Date to Binary Conversion" problem on LeetCode typically involves converting a given date into its binary representation.

A palindrome reads the same forwards and backwards, like "121" or "racecar."

The "Find Indices of Stable Mountains" problem on involves identifying mountains that meet a specific stability criterion 1.

Inserting a key into a B-tree while maintaining its properties.

A B-tree is a self-balancing tree data structure that maintains sorted data for efficient insertion, deletion, and search operations.

A B-tree is a self-balancing tree data structure that maintains sorted data for efficient insertion, deletion, and search operations.

This document explains the 'Longest Substring Without Repeating Characters' problem, including its description, approach, and implementation.

This document explains the Merge Intervals problem, including its description, approach, and implementation.

This problem is a common exercise in understanding array manipulation and is often used to illustrate the two-pointer technique

This document explains the Odd Even Linked List problem, including its description, approach, and implementation.

This document explains the Palindrome Linked List problem, including its description, approach, and implementation.

The "Plus One" dsa problem is a classic algorithm challenge that involves manipulating an array of digits. The goal is to add one to a number represented by an array of its digits.

This document explains the Removing Stars From a String problem, including its description, approach, and implementation.

This document explains the Reverse Linked List problem, including its description, approach, and implementation.

The Reverse Bits problem asks you to reverse the bits of a given 32-bit unsigned integer. Essentially, you need to flip the binary representation of the number so that the least significant bit (LSB) becomes the most significant bit (MSB) and vice versa."

This document explains the Merge Intervals problem using the Sweep Line Algorithm, including its description, approach, and implementation in C++.

This document explains the Two Sum problem, including its description, approach, and implementation.