楼主: Catherine_C1990
跳转到指定楼层
上一主题 下一主题
收起左侧

2021拒了亚麻 继续刷题

 
🔗
 楼主| Catherine_C1990 2021-9-13 18:56:07 | 只看该作者
全局:
2021 Sep 13
111. Minimum Depth of Binary Tree
102. Binary Tree Level Order Traversal
107. Binary Tree Level Order Traversal II
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-9-20 06:44:49 | 只看该作者
全局:
2021 Set 18
DFS Meidum:
1110. Delete Nodes And Return Forest
951. Flip Equivalent Binary Trees
Hard:
329. Longest Increasing Path in a Matrix
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-9-20 06:45:19 | 只看该作者
全局:
2021 Sep 19

Weekly contest

BFS
Medium        
1376. Time Needed to Inform All Employees
752. Open the Lock
Hard        
1293. Shortest Path in a Grid with Obstacles Elimination

Matrix
1254. Number of Closed Islands
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-9-20 06:49:58 | 只看该作者
全局:
Reflected on my learning style. Feel I need to change it up.

My new plan is per tag : 2 medium + 1 hard question.
If no clear thought on how to solve it in 10 min, I will go straight to see how others solve it.

The gap is :
A. I don't know the algoirthm at all, then it takes time to learn this new way of solving problem
B. I know it, but failed to associate that to this particular problem, then it's more thinking and summarising problem patterns to be able to link the dots together
C. Know theroetically what to do, but difficulty in implementation. This comes down to language master level. continue to learn and familiarise how to perform certain tasks in C++. With more practice, it will get better over time.

Also plan to browse C++ tutorials at night when not solving problems any more.
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-9-26 07:45:19 | 只看该作者
全局:
2021 Sep 24
Array
Medium
560. Subarray Sum Equals K
Matrix
Hard
1074. Number of Submatrices That Sum to Target
Graph
Medium
399. Evaluate Division
797. All Paths From Source to Target
Hard
847. Shortest Path Visiting All Nodes
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-9-26 07:45:38 | 只看该作者
全局:
2021 Sep 25

Topological Sort
Medium
310. Minimum Height Trees
444. Sequence Reconstruction
207. Course Schedule (Review)
210. Course Schedule II (Review)
Shortest Path
Medium
743. Network Delay Time
787. Cheapest Flights Within K Stops
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-10-27 05:29:52 | 只看该作者
全局:
2021 Sep 26
"Minimal Spanning Tree
Medium
1135. Connecting Cities With Minimum Cost
1584. Min Cost to Connect All Points
Tree
652. Find Duplicate Subtrees
549. Binary Tree Longest Consecutive Sequence II
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
Binary Tree
1315. Sum of Nodes with Even-Valued Grandparent
1038. Binary Search Tree to Greater Sum Tree"

回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-10-27 05:30:22 | 只看该作者
全局:
Sep 27

"Binary Search Tree
Easy
938. Range Sum of BST
897. Increasing Order Search Tree
Medium
1008. Construct Binary Search Tree from Preorder Traversal
230. Kth Smallest Element in a BST
Graph
Easy
997. Find the Town Judge
1971. Find if Path Exists in Graph"
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-10-27 05:30:43 | 只看该作者
全局:
Oct 2nd
"Easy        705. Design HashSet
Medium         1265. Print Immutable Linked List in Reverse
Medium        430. Flatten a Multilevel Doubly Linked List
Medium        817. Linked List Components
Hard        25. Reverse Nodes in k-Group
Medium        426. Convert Binary Search Tree to Sorted Doubly Linked List
Medium        1472. Design Browser History
Hard        460. LFU Cache
Easy        1137. N-th Tribonacci Number"
回复

使用道具 举报

🔗
 楼主| Catherine_C1990 2021-10-27 05:31:11 | 只看该作者
全局:
Oct 10
Medium         1048. Longest String Chain
Medium         1477. Find Two Non-overlapping Sub-arrays Each With Target Sum
Medium        894. All Possible Full Binary Trees
Medium         341. Flatten Nested List Iterator
Medium         1381. Design a Stack With Increment Operation
Easy        697. Degree of an Array
Easy        1822. Sign of the Product of an Array
Medium        1423. Maximum Points You Can Obtain from Cards
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

>
快速回复 返回顶部 返回列表