Found 29 articles tagged with #dsa

Longest Palindromic Substring

Identify the longest substring within a given input string that forms a palindrome, which is a sequence of characters that reads the same forwards as it does backward.

Roman to Integer

This problem typically asks you to implement a function or method that takes a Roman numeral as input and returns the corresponding integer.

Sep 24, 2023#leetcode#dsa

Top 10 LeetCode problems for coding interviews

We will explore the top 10 problems on LeetCode that have consistently stumped and challenged developers worldwide.

Sep 24, 2023#leetcode#dsa

Maximum Subarray

A classic coding challenge that asks you to find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Sep 24, 2023#leetcode#dsa

Merge Intervals

A classic algorithmic problem that involves merging overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Sep 24, 2023#leetcode#dsa

Palindrome Number

A palindrome is a number that reads the same forwards and backward. In other words, when its digits are reversed, the resulting number remains the same.

Sep 24, 2023#leetcode#dsa

Reverse Integer

You have to reverse the digits of a given 32-bit integer and return the reversed integer. If the reversed integer is out of the range of 32-bit integers, you should return 0.

Sep 24, 2023#leetcode#dsa

Course Schedule

The problem of Course Schedule on LeetCode is to determine if it is possible to finish all courses given the prerequisites.

Sep 19, 2023#dsa#leetcode

Longest Increasing Subsequence

The problem of finding the longest increasing subsequence of a given array of integers is a classic dynamic programming problem.

Sep 17, 2023#dsa#leetcode

Rotate Array

The problem is about rotating an array to the right by a given number of steps, modify the given array in-place (without using an extra array) and perform the rotation.