Skip to content

Commit 8e75a09

Browse files
committed
Updated readme
1 parent 87f24b1 commit 8e75a09

File tree

24 files changed

+67
-65
lines changed

24 files changed

+67
-65
lines changed

README.md

Lines changed: 65 additions & 65 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,6 @@
1010
> ["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)
1111

1212
##
13-
* [Programming Skills I](#programming-skills-i)
1413
* [Programming Skills II](#programming-skills-ii)
1514
* [Graph Theory I](#graph-theory-i)
1615
* [SQL I](#sql-i)
@@ -25,70 +24,7 @@
2524
* [Binary Search I](#binary-search-i)
2625
* [Binary Search II](#binary-search-ii)
2726
* [Dynamic Programming I](#dynamic-programming-i)
28-
29-
### Programming Skills I
30-
31-
#### Day 1 Basic Data Type
32-
33-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
34-
|-|-|-|-|-|-|-
35-
36-
#### Day 2 Operator
37-
38-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
39-
|-|-|-|-|-|-|-
40-
41-
#### Day 3 Conditional Statements
42-
43-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
44-
|-|-|-|-|-|-|-
45-
46-
#### Day 4 Loop
47-
48-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
49-
|-|-|-|-|-|-|-
50-
51-
#### Day 5 Function
52-
53-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
54-
|-|-|-|-|-|-|-
55-
56-
#### Day 6 Array
57-
58-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
59-
|-|-|-|-|-|-|-
60-
| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99
61-
62-
#### Day 7 Array
63-
64-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
65-
|-|-|-|-|-|-|-
66-
67-
#### Day 8 String
68-
69-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
70-
|-|-|-|-|-|-|-
71-
72-
#### Day 9 String
73-
74-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
75-
|-|-|-|-|-|-|-
76-
77-
#### Day 10 Linked List and Tree
78-
79-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
80-
|-|-|-|-|-|-|-
81-
| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
82-
83-
#### Day 11 Containers and Libraries
84-
85-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
86-
|-|-|-|-|-|-|-
87-
88-
#### Day 12 Class and Object
89-
90-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
91-
|-|-|-|-|-|-|-
27+
* [Programming Skills I](#programming-skills-i)
9228

9329
### Programming Skills II
9430

@@ -1591,6 +1527,70 @@
15911527
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
15921528
|-|-|-|-|-|-|-
15931529

1530+
### Programming Skills I
1531+
1532+
#### Day 1 Basic Data Type
1533+
1534+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1535+
|-|-|-|-|-|-|-
1536+
1537+
#### Day 2 Operator
1538+
1539+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1540+
|-|-|-|-|-|-|-
1541+
1542+
#### Day 3 Conditional Statements
1543+
1544+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1545+
|-|-|-|-|-|-|-
1546+
1547+
#### Day 4 Loop
1548+
1549+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1550+
|-|-|-|-|-|-|-
1551+
1552+
#### Day 5 Function
1553+
1554+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1555+
|-|-|-|-|-|-|-
1556+
1557+
#### Day 6 Array
1558+
1559+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1560+
|-|-|-|-|-|-|-
1561+
| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99
1562+
1563+
#### Day 7 Array
1564+
1565+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1566+
|-|-|-|-|-|-|-
1567+
1568+
#### Day 8 String
1569+
1570+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1571+
|-|-|-|-|-|-|-
1572+
1573+
#### Day 9 String
1574+
1575+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1576+
|-|-|-|-|-|-|-
1577+
1578+
#### Day 10 Linked List and Tree
1579+
1580+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1581+
|-|-|-|-|-|-|-
1582+
| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
1583+
1584+
#### Day 11 Containers and Libraries
1585+
1586+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1587+
|-|-|-|-|-|-|-
1588+
1589+
#### Day 12 Class and Object
1590+
1591+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1592+
|-|-|-|-|-|-|-
1593+
15941594
## Algorithms
15951595

15961596
| # | Title | Language | Difficulty | Tag | Time, ms | Time, %

src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py renamed to src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution0004.py

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
# #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
33
# #AI_can_be_used_to_solve_the_task #2025_07_22_Time_3_ms_(51.31%)_Space_18.28_MB_(18.81%)
44

5+
from typing import List
6+
57
class Solution:
68
def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
79
if len(nums2) < len(nums1):

0 commit comments

Comments
 (0)