Bivariance... how often do you use bivariance in your typescript? I saw it many times, but didn't think about how many problems it could potentially bring. Also, you can check it in our lovely React ;) #typescript #devNotes #react

57. Insert Interval When you merge intervals, you can do it with one iteration, when you want to insert one -- take the first items that are not overlapped, add the overlap item, and add the rest. #cpp #leetcode #wayToBigTech

91. Decode Ways A recursive solution is good, but remember to use memoization. However, an iterative solution with accumulation is much more effective. #cpp #leetcode #enjoyByLearning

73. Set Matrix Zeroes When you need to make changes "in a place" try to set flags somewhere -> make changes according to the flags -> make changes with elements that contain flags. #leetcode #wayToBigTech #writeAboutThat

124. Binary Tree Maximum Path Sum It is an interesting task. You need to choose and move forward with the most appropriate option. #cpp #leetcode #enjoyByLearning

91. Decode Ways Such a great iterative solution. You can save a lot if you understand exactly what data you need. #leetcode #dsa #wayToBigTech

202. Happy Number This problem looks simple, but it teaches 2 powerful patterns: 1. Detect cycles (think fast & slow pointers) 2. Transform numbers -> sum of squares It's really cool how this simple task can teach you how to use such a great mechanism. #leetcode #goodToKnow

55. Jump Game Once you need to make the best possible choice, and it will not make things worse later -- use greedy #LeetCode #wayToBigTech #bitbytestories

2402. Meeting Rooms III I finished my first arduous task without any hints or suggestions. It took 3 hours, but I did it. Yeeeeahhh. #cpp #leetcode #wayToBigTech

2402. Meeting Rooms III It was hard. - If you need to choose something, the smallest/biggest, it makes sense to consider the priority queue #cpp #leetcode #wayForBigTech #fromStudentToStudents

The biggest thing this month is here! A brand new C++ video is out on "Code for Yourself"! You can tell a lot of hard work went into it. As always, the video is excellent! youtu.be/mNeu4S0x3gA Thanks for spreading the word about C++! #cpp

2285. Maximum Total Importance of Roads This is an enjoyable task that shows how easy a complex solution can seem at first glance. #cpp #leetcode #wayToBigTech

42. Trapping Rain Water What an excellent task! - Use pointers to avoid additional memory allocation. #cpp #leetcode #wayToBigTech

88. Merge Sorted Array - Sometimes it is easier to start from the end of the array. #cpp #leetcode #wayToBigTech #fromStudentToStudents

680. Valid Palindrome II - It would not be so hard if you drew it. #cpp #leetcode #wayToBigTech

408. Valid Word Abbreviation 1. With "Two Pointers," you can compare two elements/collections with each other. 2. Write tests with corner cases for both sides. 3. It makes sense to separate the while loop for moving the pointer if you need to do this for only one of them. #cpp

2130. Maximum Twin Sum of a Linked List - Fast/slow pointers can save space, but you have to mutate the data. #cpp #leetcode #wayToBigTech

238. Product of Array Except Self When you want to find a common sum except for the element, it makes sense to use the prefix and suffix sum approach. #cpp #leetcode #wayToBigTech #fromStudentToStudends

And what about Topological Sort? #cpp #leetcode #wayToBigTech

How often do you receive questions about quicksort and heap sort? #leetcode #wayToBigTech