Skip to content

Commit a6f5dad

Browse files
ThanhNITThanhNIT
authored
Added tasks 6-20
1 parent 9b8bd34 commit a6f5dad

File tree

32 files changed

+1182
-110
lines changed

32 files changed

+1182
-110
lines changed

‎README.md

+133-110
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,6 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
99
> ["For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews)
1010
1111
##
12-
* [Data Structure II](#data-structure-ii)
1312
* [Algorithm I](#algorithm-i)
1413
* [Algorithm II](#algorithm-ii)
1514
* [Binary Search I](#binary-search-i)
@@ -23,115 +22,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
2322
* [Level 2](#level-2)
2423
* [Udemy](#udemy)
2524
* [Data Structure I](#data-structure-i)
26-
27-
### Data Structure II
28-
29-
#### Day 1 Array
30-
31-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
32-
|-|-|-|-|-|-
33-
34-
#### Day 2 Array
35-
36-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
37-
|-|-|-|-|-|-
38-
39-
#### Day 3 Array
40-
41-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
42-
|-|-|-|-|-|-
43-
44-
#### Day 4 Array
45-
46-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
47-
|-|-|-|-|-|-
48-
49-
#### Day 5 Array
50-
51-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
52-
|-|-|-|-|-|-
53-
54-
#### Day 6 String
55-
56-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
57-
|-|-|-|-|-|-
58-
59-
#### Day 7 String
60-
61-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
62-
|-|-|-|-|-|-
63-
64-
#### Day 8 String
65-
66-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
67-
|-|-|-|-|-|-
68-
69-
#### Day 9 String
70-
71-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
72-
|-|-|-|-|-|-
73-
| 0005 |[Longest Palindromic Substring](src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 10 | 99.54
74-
75-
#### Day 10 Linked List
76-
77-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
78-
|-|-|-|-|-|-
79-
| 0002 |[Add Two Numbers](src/main/js/g0001_0100/s0002_add_two_numbers/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 3 | 81.61
80-
81-
#### Day 11 Linked List
82-
83-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
84-
|-|-|-|-|-|-
85-
86-
#### Day 12 Linked List
87-
88-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
89-
|-|-|-|-|-|-
90-
91-
#### Day 13 Linked List
92-
93-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
94-
|-|-|-|-|-|-
95-
96-
#### Day 14 Stack Queue
97-
98-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
99-
|-|-|-|-|-|-
100-
101-
#### Day 15 Tree
102-
103-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
104-
|-|-|-|-|-|-
105-
106-
#### Day 16 Tree
107-
108-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
109-
|-|-|-|-|-|-
110-
111-
#### Day 17 Tree
112-
113-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
114-
|-|-|-|-|-|-
115-
116-
#### Day 18 Tree
117-
118-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
119-
|-|-|-|-|-|-
120-
121-
#### Day 19 Graph
122-
123-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
124-
|-|-|-|-|-|-
125-
126-
#### Day 20 Heap Priority Queue
127-
128-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
129-
|-|-|-|-|-|-
130-
131-
#### Day 21 Heap Priority Queue
132-
133-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
134-
|-|-|-|-|-|-
25+
* [Data Structure II](#data-structure-ii)
13526

13627
### Algorithm I
13728

@@ -159,6 +50,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
15950

16051
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
16152
|-|-|-|-|-|-
53+
| 0019 |[Remove Nth Node From End of List](src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
16254

16355
#### Day 6 Sliding Window
16456

@@ -222,11 +114,13 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
222114

223115
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
224116
|-|-|-|-|-|-
117+
| 0015 |[3Sum](src/main/js/g0001_0100/s0015_3sum/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 31 | 91.92
225118

226119
#### Day 4 Two Pointers
227120

228121
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
229122
|-|-|-|-|-|-
123+
| 0011 |[Container With Most Water](src/main/js/g0001_0100/s0011_container_with_most_water/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 95.77
230124

231125
#### Day 5 Sliding Window
232126

@@ -262,6 +156,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
262156

263157
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
264158
|-|-|-|-|-|-
159+
| 0017 |[Letter Combinations of a Phone Number](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00
265160

266161
#### Day 12 Dynamic Programming
267162

@@ -969,6 +864,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
969864

970865
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
971866
|-|-|-|-|-|-
867+
| 0019 |[Remove Nth Node From End of List](src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
972868

973869
#### Day 4 Linked List
974870

@@ -1062,12 +958,15 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
1062958

1063959
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1064960
|-|-|-|-|-|-
961+
| 0007 |[Reverse Integer](src/main/js/g0001_0100/s0007_reverse_integer/solution.js)| Medium | Top_Interview_Questions, Math | 66 | 87.91
962+
| 0009 |[Palindrome Number](src/main/js/g0001_0100/s0009_palindrome_number/solution.js)| Easy | Math | 4 | 97.14
1065963

1066964
#### Udemy Strings
1067965

1068966
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1069967
|-|-|-|-|-|-
1070968
| 0003 |[Longest Substring Without Repeating Characters](src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 3 | 98.96
969+
| 0020 |[Valid Parentheses](src/main/js/g0001_0100/s0020_valid_parentheses/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
1071970
| 0005 |[Longest Palindromic Substring](src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 10 | 99.54
1072971

1073972
#### Udemy Binary Search
@@ -1085,6 +984,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
1085984

1086985
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1087986
|-|-|-|-|-|-
987+
| 0015 |[3Sum](src/main/js/g0001_0100/s0015_3sum/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 31 | 91.92
1088988

1089989
#### Udemy Famous Algorithm
1090990

@@ -1125,11 +1025,13 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
11251025

11261026
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11271027
|-|-|-|-|-|-
1028+
| 0010 |[Regular Expression Matching](src/main/js/g0001_0100/s0010_regular_expression_matching/solution.js)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 4 | 95.52
11281029

11291030
#### Udemy Backtracking/Recursion
11301031

11311032
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11321033
|-|-|-|-|-|-
1034+
| 0017 |[Letter Combinations of a Phone Number](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00
11331035

11341036
#### Udemy Bit Manipulation
11351037

@@ -1188,6 +1090,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
11881090

11891091
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11901092
|-|-|-|-|-|-
1093+
| 0020 |[Valid Parentheses](src/main/js/g0001_0100/s0020_valid_parentheses/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
11911094

11921095
#### Day 10 Tree
11931096

@@ -1214,10 +1117,130 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
12141117
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12151118
|-|-|-|-|-|-
12161119

1120+
### Data Structure II
1121+
1122+
#### Day 1 Array
1123+
1124+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1125+
|-|-|-|-|-|-
1126+
| 0015 |[3Sum](src/main/js/g0001_0100/s0015_3sum/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 31 | 91.92
1127+
1128+
#### Day 2 Array
1129+
1130+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1131+
|-|-|-|-|-|-
1132+
1133+
#### Day 3 Array
1134+
1135+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1136+
|-|-|-|-|-|-
1137+
1138+
#### Day 4 Array
1139+
1140+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1141+
|-|-|-|-|-|-
1142+
1143+
#### Day 5 Array
1144+
1145+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1146+
|-|-|-|-|-|-
1147+
1148+
#### Day 6 String
1149+
1150+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1151+
|-|-|-|-|-|-
1152+
1153+
#### Day 7 String
1154+
1155+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1156+
|-|-|-|-|-|-
1157+
1158+
#### Day 8 String
1159+
1160+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1161+
|-|-|-|-|-|-
1162+
1163+
#### Day 9 String
1164+
1165+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1166+
|-|-|-|-|-|-
1167+
| 0005 |[Longest Palindromic Substring](src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 10 | 99.54
1168+
1169+
#### Day 10 Linked List
1170+
1171+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1172+
|-|-|-|-|-|-
1173+
| 0002 |[Add Two Numbers](src/main/js/g0001_0100/s0002_add_two_numbers/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 3 | 81.61
1174+
1175+
#### Day 11 Linked List
1176+
1177+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1178+
|-|-|-|-|-|-
1179+
1180+
#### Day 12 Linked List
1181+
1182+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1183+
|-|-|-|-|-|-
1184+
1185+
#### Day 13 Linked List
1186+
1187+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1188+
|-|-|-|-|-|-
1189+
1190+
#### Day 14 Stack Queue
1191+
1192+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1193+
|-|-|-|-|-|-
1194+
1195+
#### Day 15 Tree
1196+
1197+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1198+
|-|-|-|-|-|-
1199+
1200+
#### Day 16 Tree
1201+
1202+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1203+
|-|-|-|-|-|-
1204+
1205+
#### Day 17 Tree
1206+
1207+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1208+
|-|-|-|-|-|-
1209+
1210+
#### Day 18 Tree
1211+
1212+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1213+
|-|-|-|-|-|-
1214+
1215+
#### Day 19 Graph
1216+
1217+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1218+
|-|-|-|-|-|-
1219+
1220+
#### Day 20 Heap Priority Queue
1221+
1222+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1223+
|-|-|-|-|-|-
1224+
1225+
#### Day 21 Heap Priority Queue
1226+
1227+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1228+
|-|-|-|-|-|-
1229+
12171230
## Algorithms
12181231

12191232
| # | Title | Difficulty | Tag | Time, ms | Time, %
12201233
|------|----------------|-------------|-------------|----------|---------
1234+
| 0020 |[Valid Parentheses](src/main/js/g0001_0100/s0020_valid_parentheses/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
1235+
| 0019 |[Remove Nth Node From End of List](src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
1236+
| 0017 |[Letter Combinations of a Phone Number](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00
1237+
| 0015 |[3Sum](src/main/js/g0001_0100/s0015_3sum/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 31 | 91.92
1238+
| 0011 |[Container With Most Water](src/main/js/g0001_0100/s0011_container_with_most_water/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 95.77
1239+
| 0010 |[Regular Expression Matching](src/main/js/g0001_0100/s0010_regular_expression_matching/solution.js)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 4 | 95.52
1240+
| 0009 |[Palindrome Number](src/main/js/g0001_0100/s0009_palindrome_number/solution.js)| Easy | Math, Udemy_Integers | 4 | 97.14
1241+
| 0008 |[String to Integer (atoi)](src/main/js/g0001_0100/s0008_string_to_integer_atoi/solution.js)| Medium | Top_Interview_Questions, String | 1 | 96.63
1242+
| 0007 |[Reverse Integer](src/main/js/g0001_0100/s0007_reverse_integer/solution.js)| Medium | Top_Interview_Questions, Math, Udemy_Integers | 66 | 87.91
1243+
| 0006 |[Zigzag Conversion](src/main/js/g0001_0100/s0006_zigzag_conversion/solution.js)| Medium | String | 2 | 99.71
12211244
| 0005 |[Longest Palindromic Substring](src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 10 | 99.54
12221245
| 0004 |[Median of Two Sorted Arrays](src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays/solution.js)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 3 | 91.90
12231246
| 0003 |[Longest Substring Without Repeating Characters](src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 3 | 98.96

‎src/main/js/g0001_0100/s0006_zigzag_conversion/readme.md

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
6\. Zigzag Conversion
2+
3+
Medium
4+
5+
The string `"PAYPALISHIRING"` is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
6+
7+
P A H N A P L S I I G Y I R
8+
9+
And then read line by line: `"PAHNAPLSIIGYIR"`
10+
11+
Write the code that will take a string and make this conversion given a number of rows:
12+
13+
string convert(string s, int numRows);
14+
15+
**Example 1:**
16+
17+
**Input:** s = "PAYPALISHIRING", numRows = 3
18+
19+
**Output:** "PAHNAPLSIIGYIR"
20+
21+
**Example 2:**
22+
23+
**Input:** s = "PAYPALISHIRING", numRows = 4
24+
25+
**Output:** "PINALSIGYAHRPI"
26+
27+
**Explanation:** P I N A L S I G Y A H R P I
28+
29+
**Example 3:**
30+
31+
**Input:** s = "A", numRows = 1
32+
33+
**Output:** "A"
34+
35+
**Constraints:**
36+
37+
* `1 <= s.length <= 1000`
38+
* `s` consists of English letters (lower-case and upper-case), `','` and `'.'`.
39+
* `1 <= numRows <= 1000`

0 commit comments

Comments
 (0)