| .. |
|
.gitignore
|
chore: add dotnet-format
|
2024-03-15 17:21:45 +01:00 |
|
arithmetic-slices-ii-subsequence.cs
|
chore(cs): format
|
2024-03-15 17:22:58 +01:00 |
|
average-of-levels-in-binary-tree.cs
|
chore(cs): format
|
2024-03-15 17:22:58 +01:00 |
|
binary-tree-pruning.cs
|
chore: unwrap one layer
|
2023-12-12 14:36:00 +01:00 |
|
binary-tree-right-side-view.cs
|
cs: add “199. Binary Tree Right Side View”
|
2024-01-07 22:15:48 +01:00 |
|
can-place-flowers.cs
|
cs: add “605. Can Place Flowers”
|
2024-01-07 16:03:40 +01:00 |
|
count-good-nodes-in-binary-tree.cs
|
cs: add “1448. Count Good Nodes in Binary Tree”
|
2024-01-07 21:09:16 +01:00 |
|
count-subarrays-with-fixed-bounds.cs
|
cs: add «2444. Count Subarrays With Fixed Bounds»
|
2024-03-31 16:36:42 +02:00 |
|
counting-bits.cs
|
cs: add “338. Counting Bits”
|
2024-01-07 00:02:39 +01:00 |
|
cs.csproj
|
chore: add dotnet-format
|
2024-03-15 17:21:45 +01:00 |
|
delete-node-in-a-bst.cs
|
cs: add “450. Delete Node in a BST”
|
2024-01-09 12:25:16 +01:00 |
|
delete-the-middle-node-of-a-linked-list.cs
|
cs: add “2095. Delete the Middle Node of a Linked List”
|
2024-01-07 23:14:58 +01:00 |
|
determine-if-two-strings-are-close.cs
|
cs: add “1657. Determine if Two Strings Are Close”
|
2024-01-07 13:49:00 +01:00 |
|
equal-row-and-column-pairs.cs
|
cs: add “2352. Equal Row and Column Pairs”
|
2024-01-07 13:06:12 +01:00 |
|
find-pivot-index.cs
|
cs: add “724. Find Pivot Index”
|
2024-01-07 16:00:47 +01:00 |
|
find-the-duplicate-number.cs
|
cs: add «287. Find the Duplicate Number»
|
2024-03-24 10:59:12 +01:00 |
|
find-the-highest-altitude.cs
|
cs: add “1732. Find the Highest Altitude”
|
2024-01-08 22:26:17 +01:00 |
|
insert-interval.cs
|
cs: add «57. Insert Interval»
|
2024-03-18 00:12:11 +01:00 |
|
kids-with-the-greatest-number-of-candies.cs
|
cs: add “1431. Kids With the Greatest Number of Candies”
|
2024-01-07 16:05:10 +01:00 |
|
leaf-similar-trees.cs
|
cs: add “872. Leaf-Similar Trees”
|
2024-01-09 12:39:06 +01:00 |
|
maximum-level-sum-of-a-binary-tree.cs
|
cs: add “1161. Maximum Level Sum of a Binary Tree”
|
2024-01-07 22:06:12 +01:00 |
|
merge-strings-alternately.cs
|
cs: add “1768. Merge Strings Alternately”
|
2024-01-06 22:04:18 +01:00 |
|
min-cost-climbing-stairs.cs
|
cs: add “746. Min Cost Climbing Stairs”
|
2024-01-07 19:57:54 +01:00 |
|
minimum-flips-to-make-a-or-b-equal-to-c.cs
|
cs: add “1318. Minimum Flips to Make a OR b Equal to c”
|
2024-01-07 00:06:02 +01:00 |
|
move-zeroes.cs
|
cs: add “283. Move Zeroes”
|
2024-01-06 22:28:10 +01:00 |
|
n-th-tribonacci-number.cs
|
chore(cs): format
|
2024-03-15 17:22:58 +01:00 |
|
number-of-provinces.cs
|
cs: add “547. Number of Provinces”
|
2024-01-07 21:15:19 +01:00 |
|
poor-pigs.cs
|
chore(cs): format
|
2024-03-15 17:22:58 +01:00 |
|
product-of-array-except-self.cs
|
cs: add «238. Product of Array Except Self»
|
2024-03-15 17:28:55 +01:00 |
|
removing-stars-from-a-string.cs
|
cs: add “2390. Removing Stars From a String”
|
2024-01-07 21:03:07 +01:00 |
|
reorder-list.cs
|
cs: add «143. Reorder List»
|
2024-03-23 21:38:06 +01:00 |
|
reverse-linked-list.cs
|
cs: add “206. Reverse Linked List”
|
2024-01-09 15:03:47 +01:00 |
|
search-in-a-binary-tree.cs
|
cs: add “700. Search in a Binary Search Tree”
|
2024-01-06 22:17:54 +01:00 |
|
single-number.cs
|
cs: add “136. Single Number”
|
2024-01-08 22:29:29 +01:00 |
|
smallest-number-in-infinite-set.cs
|
cs: add “2336. Smallest Number in Infinite Set”
|
2024-01-07 20:13:10 +01:00 |
|
unique-paths.cs
|
cs: add “62. Unique Paths”
|
2024-01-06 22:51:12 +01:00 |
