Skip to content

Commit 397c173

Browse files
Update README.md
1 parent 2c0d16f commit 397c173

File tree

1 file changed

+9
-1
lines changed

1 file changed

+9
-1
lines changed

README.md

Lines changed: 9 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
# LeetCode Questions CPP and Python
1+
# LeetCode Questions CPP and Python3
22
<br>
33

44
## Question 224: Basic Calculator
@@ -109,6 +109,14 @@ The distance between two cells `(x0, y0)` and `(x1, y1)` is `|x0 - x1| + |y0 - y
109109

110110

111111

112+
## Question 1311: Get Watched Videos by Your Friends
113+
There are `n` people, each person has a unique id between `0` and `n-1`. Given the arrays ***watchedVideos*** and ***friends***, where `watchedVideos[i]` and `friends[i]` contain the list of watched videos and the list of friends respectively for the person with `id = i`. <br><br>
114+
Level `1` of videos are all watched videos by your friends, level `2` of videos are all watched videos by the friends of your friends and so on. In general, the level `k` of videos are all watched videos by people with the shortest path ***exactly*** equal to ***k*** with you. Given your `id` and the `level` of videos, return the list of videos ordered by their frequencies (increasing). For videos with the same frequency order them alphabetically from least to greatest.
115+
<br><br><br>
116+
117+
118+
119+
112120
## Question 1496: Path Crossing
113121
Given a string path, where `path[i] =` `N`, `S`, `E` or `W`, each representing moving one unit north, south, east, or west, respectively. You start at the origin `(0, 0)` on a 2D plane and walk on the path specified by path.
114122
<br><br>

0 commit comments

Comments
 (0)