Problem Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. For example, 2 is written as II in Roman numeral, just two one’s added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II. Roman numerals are Read more…
Problem You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most Read more…
Problem Given an input string s and a pattern p, implement regular expression matching with support for ‘.’ and ‘*’ where: ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). Problem description Given an input string Read more…
Problem Description Given an integer x, return true if x is a palindrome, and false otherwise. Given an integer x, the task is to determine if it is a palindrome. A palindrome is a number that remains the same when its digits are reversed. For example, 121 is Read more…
Problem description Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer (similar to C/C++’s atoi function). The algorithm for myAtoi(string s) is as follows: Read in and ignore any leading whitespace. Check if the next character (if not already at the Read more…
Problem description Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 – 1], then return 0. Assume the environment does not allow you to store 64-bit integers (signed Read more…
Problem Description The Zigzag Conversion problem involves converting a given string into a zigzag pattern with a specified number of rows. The pattern is read line by line, and the result should be the concatenation of each line. For example, Read more…
The Longest Palindromic Substring problem can be solved using dynamic programming. The idea is to use a 2D array to store whether a substring is a palindrome or not. We then traverse the string using two nested loops and update Read more…
Laravel Sanctum provides a featherweight authentication system for SPAs (single page applications), mobile applications, and simple, token based APIs. Sanctum allows each user of your application to generate multiple API tokens for their account. These tokens may be granted abilities / Read more…
Short answer: There is no that simple “remove” command to remove storybook from project. Why they don’t have command? It is because Storybook doesn’t know where your stories are until runtime. So, it’s hard to know exactly what to delete. Read more…