Idiot Programmer

 Hibernate Native SQL Query Example For explanation watch the video : Directory structure pom.xml <project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd"> <modelVersion>4.0.0</modelVersion> <groupId>com.test</groupId> <artifactId>NamedSqlQueries</artifactId> <version>0.0.1-SNAPSHOT</version> <packaging>jar</packaging> <name>NamedSqlQueries</name> <url>http://maven.apache.org</url> <properties> <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding> <maven.compiler.source>1.9</maven.compiler.source> <maven.compiler.target>1.9</maven.compiler.target> </properties> <dependencies> <dependency> <groupId>junit<

 183. Customers Who Never Order leetcode Solution For Explnation Watch video : Code:: select name Customers from Customers where id not in (select customerId  from Orders);

 African Cities Hackerrank Solution  Solution: select city.name from city inner join country on city.countrycode = country.code where country.CONTINENT = 'Africa';

 average population of each continent hackerrank solution oracle Code: select country.continent,floor(avg(city.population)) from city inner join country on city.countrycode = country.code group by country.continent;

Population Census hackerrank Solution for explanation watch video: Code:: select sum(city.population) from city inner join country on CITY.CountryCode = COUNTRY.Code where country.CONTINENT = 'Asia';

  Weather Observation Station 19 Hackerrank Solution - SQL  for explanation watch video :: Code:: select round(sqrt(     power(max(lat_n)-min(lat_N),2)+     power(max(long_w)-min(long_w),2) ),4) from station;

 Weather Observation Station 15 Hackerrank Solution - SQL For explanation watch video :: Code:: select round(long_w,4) from station where lat_n = (select max(lat_n) from station where lat_n<137.2345);

Weather Observation Station 14 Hackerrank Solution - SQL For explanation watch video :: Code:: select round(max(LAT_N),4) from station where LAT_N < 137.2345;

Weather Observation Station 18 Hackerrank Solution - SQL For explanation watch video :: Code:: select round(abs(max(lat_n)-min(lat_n))+abs(max(long_w)-min(long_w)),4) from station;

 Weather Observation Station 17 Hackerrank Solution - SQL for explanation watch video :: Code:: select round(long_w,4) from station where lat_n = (select min(lat_n) from station where lat_n>38.7780);

 Weather Observation Station 16 Hackerrank Solution - SQL  For explanation watch video :: Code:: select round(min(lat_n),4) from station where lat_n>38.7780;

 Weather Observation Station 2 Hackerrank Solution - SQL For Explanation watch video::: Code:: select round(sum(LAT_N),2),round(sum(LONG_W),2) from station;

 The Blunder Hackerrank Solution - SQL For explanation watch video :: Code: select ceil(avg(salary)-avg(replace(salary,'0',''))) from Employees;

 Weather Observation Station 13 Hackerrank Solution - SQL For Explanation Watch Video :  Code : select round(sum(LAT_N),4) from station where LAT_N > 38.7880 and LAT_N < 137.2345;

 Top Earners Hackerrank Solution - SQL for explanation watch video : Code :: select max(salary * months ),count(*) from Employee where salary*months = (select max(salary*months) from Employee);

 The Report Hackerrank Solution - SQL For Explanation Watch Video :  Code ::  SELECT CASE        WHEN G.GRADE >= 8 THEN S.NAME        ELSE 'NULL' END,G.GRADE,S.MARKS        FROM STUDENTS S,GRADES G        WHERE S.MARKS >= MIN_MARK AND S.MARKS <=MAX_MARK        ORDER BY G.GRADE DESC,S.NAME,S.MARKS;

 Placements Hackerrank Solution SQL For Explanation Watch Video :  Code : SELECT NAME FROM STUDENTS S,FRIENDS F,PACKAGES P1,PACKAGES P2 WHERE S.ID=F.ID AND S.ID=P1.ID AND F.FRIEND_ID=P2.ID AND P1.SALARY < P2.SALARY ORDER BY P2.SALARY;

 Draw The Triangle 2 Hackerrank Solution - SQL  for explanation watch video: Code:: set serveroutput on; declare res clob; begin  for i in 1..20 loop      res := '';      for j in 1..i loop        res := res || '*' || ' ';      end loop;      dbms_output.put_line(res);  end loop; end; /

  Draw The Triangle 1 Hackerrank Solution - SQL for Explanation watch Video : Code:: set serveroutput on; declare res clob; begin for i in reverse 1..20 loop res := ''; for j in 1..i loop res := res || '*' || ' '; end loop; dbms_output.put_line(res); end loop; end; /

 Print Prime Numbers Hackerrank Solution - PL/SQL for explanation watch video ::  Code:: set serveroutput on; declare output clob := ''; co number; begin  for i in 2..1000 loop      co := 0;      for j in 2..(i/2) loop        if mod(i,j)=0          then            co := 1;            exit;         end if;     end loop;     if co = 0      then        output :=  output || i ||'&';     end if;     end loop;     dbms_output.put_line(substr(output,1,length(output)-1)); end; /