add: new sql added

Author: Pankajcoder1

HackerRank/SQL/New Companies.sql

@@ -0,0 +1,15 @@
+select
+company.company_code,
+company.founder,
+count(distinct lead_manager.lead_manager_code),
+count(distinct senior_manager.senior_manager_code),
+count(distinct manager.manager_code),
+count(distinct employee.employee_code)
+from company
+inner join lead_manager on lead_manager.company_code = company.company_code
+inner join senior_manager on senior_manager.company_code = company.company_code
+inner join manager on manager.company_code = company.company_code
+inner join employee on employee.company_code = company.company_code
+group by company.company_code, company.founder
+order by company.company_code
+asc

HackerRank/SQL/contest-leaderboard.sql

@@ -0,0 +1,19 @@
+with whole_data as (
+    select
+    hackers.hacker_id as hacker_id,
+    hackers.name as name,
+    max(score) as max_score,
+    submissions.challenge_id
+    from hackers
+    inner join submissions on submissions.hacker_id = hackers.hacker_id
+    group by submissions.challenge_id, hackers.hacker_id, hackers.name
+    having max(score) > 0
+)
+
+select 
+hacker_id,
+name,
+sum(max_score) as total_score
+from whole_data
+group by hacker_id, name
+order by total_score desc, hacker_id asc

HackerRank/SQL/draw-the-triangle-1.sql

@@ -0,0 +1,7 @@
+declare @no_of_stars INT
+set @no_of_stars = 20
+while @no_of_stars > 0
+begin
+print replicate("* ", @no_of_stars)
+set @no_of_stars = @no_of_stars - 1
+end

HackerRank/SQL/draw-the-triangle-2.sql

@@ -0,0 +1,7 @@
+declare @no_of_stars INT
+set @no_of_stars = 1
+while @no_of_stars < 21
+begin
+print replicate("* ", @no_of_stars)
+set @no_of_stars = @no_of_stars + 1
+end

HackerRank/SQL/occupations.sql

@@ -0,0 +1,15 @@
+with data as (
+      select
+        name, occupation,
+        row_number() over(partition by occupation order by name asc) as row_num
+        from occupations
+)
+
+select 
+    max(case when occupation ="Doctor" then name end) as doc_n,
+    max(case when occupation ="Professor" then name end) as pro_n,
+    max(case when occupation ="Singer" then name end) as sin_n,
+    max(case when occupation ="Actor" then name end) as act_n
+from
+    data
+group by row_num

HackerRank/SQL/the-blunder.sql

@@ -0,0 +1 @@
+select ceil(avg(salary)- avg(replace(salary,'0',''))) from employees;

HackerRank/SQL/the-pads.sql

@@ -0,0 +1,9 @@
+select 
+    concat(name,'(',left(occupation,1),')')
+from occupations
+order by name;
+select 
+    "There are a total of",count(occupation) as cnt,concat(lower(occupation),'s.')
+from occupations
+group by occupation
+order by cnt asc;

HackerRank/SQL/weather-observation-station-18.sql

@@ -0,0 +1,3 @@
+select 
+round(abs(min(lat_n)-max(lat_n)) + abs(min(long_w)-max(long_w)),4) as ans
+from station

HackerRank/SQL/weather-observation-station-19.sql

@@ -0,0 +1,7 @@
+select
+round(sqrt(
+    power(max(lat_n)-min(lat_n),2) + 
+    power(max(long_w)-min(long_w),2) 
+    ),4) as ans
+from
+station

HackerRank/SQL/weather-observation-station-20.sql

@@ -0,0 +1,18 @@
+with rank_data as (
+    select 
+    lat_n, 
+    ROW_NUMBER() over (order by lat_n asc) as cnt,
+    count(*) over () as total
+    from station order by lat_n asc
+)
+
+select
+round(src.lat_n,4)
+from 
+rank_data as src
+where src.cnt = (
+    case
+        when src.total%2=1 then (src.total+1)/2
+        when src.total%2=0 then src.total/2 + ((src.total/2)+1)/2
+    end
+)

LeetCode/3160.Find The Number Of Distinct Colors Among The Balls.cpp

@@ -0,0 +1,39 @@
+/*
+	written by Pankaj Kumar.
+	country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+	vector<int> queryResults(int limit, vector<vector<int>> &queries)
+	{
+		map<int, int> cnt, color;
+
+		int n = queries.size();
+		vector<int> ans(n);
+
+		for (int i = 0; i < n; i++)
+		{
+			int x = queries[i][0];
+			int y = queries[i][1];
+			if (color.find(x) != color.end())
+			{
+				cnt[color[x]]--;
+				if (cnt[color[x]] == 0)
+					cnt.erase(color[x]);
+			}
+
+			color[x] = y;
+			cnt[y]++;
+			ans[i] = cnt.size();
+		}
+
+		return ans;
+	}
+};