Hey, it’s your favorite cult leader here 🐱👤
On Wednesdays, I will send you a hand-picked problem for you to solve. The solutions will be sent on the following day. Use the weekly problems as a guide way to get some consistency in your life.
To get access to all my articles and support my crippling chocolate milk addiction, consider subscribing if you haven’t already!
p.s. you can learn more about the paid plan here.
We are at the end.
I have run through the list of useful Leetcode Questions that can be used to teach you important principles. What does this mean? From the results of the community polls, Wednesdays and Thursdays will now become reader-focused days. If there are any questions that you come struggle with- I will solve them. This way, we will focus on your weaknesses, as opposed to me picking questions for you. On the weeks that no one sends me anything- we will keep the Leetcode days off- so that I can focus on better content for the rest of the days.
This has been a long journey. This time 2 years ago, I had 4 subscribers. We’re currently at 14.5K, with 16 major publications recommending this newsletter. The cult has grown into something amazing, and I’m grateful for your support so far. We’ve got great things planned as we continue to grow beyond a Leetcode prep newsletter into much more.
Onwards with the question.
You can find it as 222. Count Complete Tree Nodes on Leetcode.
Problem
Given the root
of a complete binary tree, return the number of the nodes in the tree.
According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It can have between 1
and 2h
nodes inclusive at the last level h
.
Design an algorithm that runs in less than O(n)
time complexity.
Example 1:
Input: root = [1,2,3,4,5,6]
Output: 6
Example 2:
Input: root = []
Output: 0
Example 3:
Input: root = [1]
Output: 1
Constraints:
The number of nodes in the tree is in the range
[0, 5 * 104]
.0 <= Node.val <= 5 * 104
The tree is guaranteed to be complete.
Try the Solution for yourself here
That is it for this piece. I appreciate your time. As always, if you’re interested in working with me or checking out my other work, my links will be at the end of this email/post. If you like my writing, I would really appreciate an anonymous testimonial. You can drop it here. And if you found value in this write-up, I would appreciate you sharing it with more people. It is word-of-mouth referrals like yours that help me grow.
Upgrade your tech career with my newsletter ‘Tech Made Simple’! Stay ahead of the curve in AI, software engineering, and tech industry with expert insights, tips, and resources. 20% off for new subscribers by clicking this link. Subscribe now and simplify your tech journey!
Using this discount will drop the prices-
800 INR (10 USD) → 640 INR (8 USD) per Month
8000 INR (100 USD) → 6400INR (80 USD) per year (533 INR /month)
Reach out to me
Use the links below to check out my other content, learn more about tutoring, reach out to me about projects, or just to say hi.
Small Snippets about Tech, AI and Machine Learning over here
If you like my writing, I would really appreciate an anonymous testimonial. You can drop it here.
To help me understand you fill out this survey (anonymous)
Check out my other articles on Medium. : https://rb.gy/zn1aiu
My YouTube: https://rb.gy/88iwdd
Reach out to me on LinkedIn. Let’s connect: https://rb.gy/m5ok2y
My Instagram: https://rb.gy/gmvuy9
My Twitter: https://twitter.com/Machine01776819