Showing 3 of 108 questions
Convert a given string into a zigzag pattern with a specified number of rows. Then read the characters row by row to return the converted string.
#1. Zigzag Conversion
Design a data structure that acts as a Least Recently Used (LRU) cache. Implement methods to get and put key-value pairs, evicting the least recently used entry when the cache is full.
#2. LRU Cache
Determine how many strings within a given array start and end with vowel letters, considering only a specified index range.
#3. Count the Number of Vowel Strings in Range
Page 1 of 1 · 108 total