Code Archives - Page 9 of 30

Solved! Leetcode 1641. Count Sorted Vowel Strings

Feb

18

2023

source: https://leetcode.com/problems/count-sorted-vowel-strings/description/ Count Sorted Vowel Strings Given an integer n, return the number of strings of length n that consist only of vowels (a, e, i, o, u) and are lexicographically sorted. A string s is lexicographically sorted if for all valid i, s[i] is the same as or comes before s[i+1] in the alphabet. ...

Solved! Leetcode 369. Plus One Linked List

Feb

17

2023

source: https://leetcode.com/problems/plus-one-linked-list/description/ Plus One Linked List Given a non-negative integer represented as a linked list of digits, plus one to the integer. The digits are stored such that the most significant digit is at the head of the list. Example 1: Input: head = [1,2,3] Output: [1,2,4] Example 2: Input: head = [0] Output: [1] ...

Solved! Leetcode 518: Coin Change II

Feb

16

2023

source: https://leetcode.com/problems/coin-change-ii/description/ Coin Change II You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return 0. You ...

Solved! Leetcode 2187. Minimum Time to Complete Trips

Feb

16

2023

Table of ContentsProblem StatementJavaPython Problem Statement source: https://leetcode.com/problems/minimum-time-to-complete-trips/description/ You are given an array time where time[i] denotes the time taken by the ith bus to complete one trip. Each bus can make multiple trips successively; that is, the next trip can start immediately after completing the current trip. Also, each bus operates independently; that is, ...

JSON Validator and Formatter

Feb

12

2023

An online JSoN validator and Formatter for all your JSoN text checks and prettyfying needs. Paste your JSoN text in the box below and then hit Validate/ Format button. JSON Validator Validate/ Format

Solved! Leetcode 438: Find All Anagrams in a String

Feb

5

2023

source: https://leetcode.com/problems/find-all-anagrams-in-a-string/description/ An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Given two strings s and p, return an array of all the start indices of p’s anagrams in s. You may return the answer in any order. ...

Solved! Leetcode 2361: Minimum Costs Using the Train Line

Feb

5

2023

source: https://leetcode.com/problems/minimum-costs-using-the-train-line/ A train line going through a city has two routes, the regular route and the express route. Both routes go through the same n + 1 stops labeled from 0 to n. Initially, you start on the regular route at stop 0. You are given two 1-indexed integer arrays regular and express, both ...

Solved! Leetcode 953: Verifying an Alien Dictionary

Feb

3

2023

Source: https://leetcode.com/problems/verifying-an-alien-dictionary/description/ In an alien language, surprisingly, they also use English lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters. Given a sequence of words written in the alien language, and the order of the alphabet, return true if and only if the given words ...

Solved! Leetcode 1109: Corporate Flight Bookings

Feb

3

2023

source: https://leetcode.com/problems/corporate-flight-bookings/description/ There are n flights that are labeled from 1 to n. You are given an array of flight bookings bookings, where bookings[i] = [firsti, lasti, seatsi] represents a booking for flights firsti through lasti (inclusive) with seatsi seats reserved for each flight in the range. Return an array answer of length n, where ...

Solved! Leetcode 734: Sentence Similarity

Feb

1

2023

Sentence Similarity We can represent a sentence as an array of words, for example, the sentence "I am happy with leetcode" can be represented as arr = ["I","am",happy","with","leetcode"]. Given two sentences sentence1 and sentence2 each represented as a string array and given an array of string pairs similarPairs where similarPairs[i] = [xi, yi] indicates that ...