Видео

Why not simply order by active users and select the top 2 rows? Rank is an overkill for this question no?

What do you think of this one? SELECT 'Low Salary' AS category, COUNT(*) AS accounts_count FROM Accounts WHERE income < 20000 UNION ALL SELECT 'Average Salary' AS category, COUNT(*) AS accounts_count FROM Accounts WHERE income BETWEEN 20000 AND 50000 UNION ALL SELECT 'High Salary' AS category, COUNT(*) AS accounts_count FROM Accounts WHERE income > 50000;

MentorCruise: mentors.to/frederikmuller LinkedIn: www.linkedin.com/in/frederikmueller/

Nice explanation. In general, would a LEFT JOIN be faster than a RIGHT JOIN or will it be just the same?

w

Never thought of joining the tables. I used a window function with cte as ( SELECT person_id, person_name, SUM(weight) OVER(order by turn) as added_weight FROM Queue ) SELECT person_name FROM cte WHERE added_weight <= 1000 ORDER BY added_weight DESC LIMIT 1;

with cte as (select employee_id from Emp1 where manager_id in( select employee_id from Emp1 where manager_id in( select employee_id from Emp1 where manager_id=1))) select employee_id from cte where employee_id!=1 is this correct??

Why should we use subquery instead of 3😮

select product_id, sum(case when store='store1' then price end) as store1, sum(case when store='store2' then price end) as store2, sum(case when store='store3' then price end) as store3 from Products group by product_id

WITH OrderCounts AS ( SELECT customer_number, COUNT(*) AS order_count FROM Orders GROUP BY customer_number), MaxOrderCount AS ( SELECT MAX(order_count) AS max_order_count FROM OrderCounts) SELECT customer_number FROM OrderCounts WHERE order_count = (SELECT max_order_count FROM MaxOrderCount);

MAX() OVER ( PARTITION BY department ORDER BY salary ) ? 🤔 Been practicing my SQL today 😂

I think the Join answer is faster than the nested query.

why didn't you use WHERE AVG(PRICES) after group by??

There might be same highest salary for more than one user per department ( say 1100 two times for audit department) that's why rank or dense_rank is preferred

nice

Thank you so much for this man, It really helps. As someone currently looking for a related job, this helps feed my confidence.

very helpful

You are the Nick White of Leetcode Database explanation.

Great video and explanation, thank you!

Thanks for your walk troughs & nice audio !!!

use dark mode plz

great work, thanks.

please do not refer his code. its a wrong code

Thank you! This was really helpful.

Your content is top class !

select department, avg(salary) as median from (select department,salary, count(*) over (partition by department) as ct, row_number() over (partition by department order by salary) as rn from employee) a where rn between ct/2 and ct/2+1 group by department

Your content is interesting but i wish you had videos on topic including A/B testing since it is your specialty I'm not forcing you it's just a proposal since there is few cotent on the topic

Not a analyst interview, but on manual data mining task I was asked to spend that much time doing real work free of charge. I did only half of it and I said that I give the rest if I'm selected to move ahead since it is a real data with real use. They gave up on me since I didn't fail (completely) on the scam.

Alex The Analyst also said similarly in a data analysis interview prep video that he did about 2 weeks ago. But I've seen that a lot of companies give out these assignments so idk what are we supposed to do as a job seeker especially in the current job market situation.

just 2 line !!! great select contest_id,round(count(user_id) * 100.0/(select count(user_id) from users),2) as percentage from register group by contest_id order by percentage desc,contest_id when i try this, Time Limit Exceeded

super helpful

declare @weight int = 0 declare @turn int = 1 declare @currentweight int while @weight !=1000 begin select @currentweight = (select weight from elevator where turn = @turn) if @currentweight + @weight<1000 begin set @weight = @weight+@currentweight set @turn=@turn+1 end else if @currentweight + @weight = 1000 begin select name from elevator where turn = @turn break end end (((its terrible but it works)

the logic behind this is, sum of the lengths of any two sides of the triangle should be greater than the third side.

Interesting solution. I just wanted to know how would this solution fair in comparison to window functions when you have a larger data size and limit?

Broo u r awesome! Thanks

sub++ i love the way you explain this thank you

Is the latter function available in MS SQL Server?

Cool! Thanks for sharing.

Thats a very interesting fact you have shared with us!

Try this also select a.name FROM employee a LEFT join employee b ON a.id = b.managerId HAVING COUNT(a.name) >= 5

Beautiful explanation for us newbies ❤ from NYC

WITH purchase AS ( SELECT user_id, created_at - LAG(created_at) OVER(PARTITION BY user_id ORDER BY created_at) AS difference FROM amazon_transactions ), result As (SELECT CASE WHEN difference >= 0 AND difference <= 7 THEN user_id ELSE NULL END AS user_id_filtered FROM purchase) select distinct user_id_filtered FROM result ORDER by user_id_filtered

Love your guidance 🙏

Thank you so much! I went through other solutions. This was way easier to understand. This is the first time I got to know that "where" can be used like this.

I couldn't solve it two years ago for my meta interview (campus hire, final round). Today when I was working on a similar query and I solved it within 5 minutes. The query took me back to 2 years ago and now I found your solution exactly matched mine. How time flies.

Love u bro

I haven't got 96.35% beats what's the reason and typed same code u explained

Hi 😂😂

Is there a reason why the below code does not work? select Sales.product_id, min(Sales.year) 'first_year', Sales.quantity, Sales.price from Sales left join Product using(product_id) group by 1

Thank you so much for sharing with us aspiring engineers Frederik! I'm 16 and in High School, where SQL isn't really taught as much as it should be