Jul
8
LeetCode 347. Top K Frequent Elements
Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
Jul
8
LeetCode 129 Sum Root to Leaf Number
LeetCode 129 Sum Root to Leaf Numbers
Given a root of binary tree containing digits from 0 to 9 only. Return the total sum of all root to leaf.
The question is taken from the book “Elements of Programming Interviews in Python” page 125 https://amzn.to/3y84FHQ
We see we have here these routes to path
495 +491 +40 Which in total is 1026
Now let’s see how to solve it in java
/** * Definition for a binary tree node.
Given a root of binary tree containing digits from 0 to 9 only. Return the total sum of all root to leaf.
The question is taken from the book “Elements of Programming Interviews in Python” page 125 https://amzn.to/3y84FHQ
We see we have here these routes to path
495 +491 +40 Which in total is 1026
Now let’s see how to solve it in java
/** * Definition for a binary tree node.
