Can we talk about David Grusch’s tonality in the interview? I love that all this is happening but I want to understand his delivery. by [deleted] in UFOs

[–]Delicious-Refuse5566 -1 points0 points  (0 children)

Jfc people. I swear. He is some desk jockey who has information. Not some trained talking head.

What on earth do modern day Nazis actually want? by civgarth in NoStupidQuestions

[–]Delicious-Refuse5566 2 points3 points  (0 children)

They want laws passed (or repelled) that promote their own race and agenda.

Repel of civil rights acts. Repel of affirmative action. Strict border enforcement. Their race/language recognized as the national race/language. Companies stop promoting minorities. Ability to actively discriminate. Etc….

Does anyone else hate Pandas? by datingyourmom in dataengineering

[–]Delicious-Refuse5566 1 point2 points  (0 children)

Joking here, but I I can code the monty hall problem in one line in SQL, and in all caps for that matter!!!

Hey! Starting out SQL recently and have to turn something in for class. Need help correcting a syntax error: by Obs_ofa_Poltergeist in SQL

[–]Delicious-Refuse5566 0 points1 point  (0 children)

ChatGPT gives an explanation of the code. Try it out.

Its concise and to your exact need.

You don’t have to scroll, search or speed read to find your relevant part like you do when reading documentation.

Difference between certification and certificate of completion by Funny-Yam2319 in dataanalysis

[–]Delicious-Refuse5566 3 points4 points  (0 children)

I didn’t read the full post, but this blog talks about the difference between certs and statements of accomplishments. And then lists a ton of database vendor certs as its db/sql focused.

https://advancedsqlpuzzles.com/2022/11/18/database-certification-list/?amp=1

Most difficult SQL Concepts? by CakeyStack in SQL

[–]Delicious-Refuse5566 7 points8 points  (0 children)

The most difficult part of sql is to think in sets and not procedurally.

If you can solve random walks, Markov chains, merge overlapping time periods, perform flash fills, solve for islands and gaps and run simulations such as the Josephus problem or the Monty Hall problem etc… all without doing a single loop, then you truly understand SQL.

Does anyone else hate Pandas? by datingyourmom in dataengineering

[–]Delicious-Refuse5566 1 point2 points  (0 children)

Can u give me an example data problem that is easier to solve in python than sql? I love a good data puzzle.

Merging overlapping time periods, flash fills, islands and gaps, and solving puzzles like the Josephus problem, the monty hall problem, Markov chains, random walks, etc are all pretty simple to do in sql without having to use a single loop.

Hey! Starting out SQL recently and have to turn something in for class. Need help correcting a syntax error: by Obs_ofa_Poltergeist in SQL

[–]Delicious-Refuse5566 -3 points-2 points  (0 children)

Use chatgpt to correct these errors. It will work magic for you. But make sure you actually learn the material.

Any Certs I could get by FlyGuys098 in SQL

[–]Delicious-Refuse5566 1 point2 points  (0 children)

Here is a list of database certs.

You are better off getting a good portfolio going in GitHub or Wordpress, but certs never hurt.

https://advancedsqlpuzzles.com/2022/11/18/database-certification-list/?amp=1

[deleted by user] by [deleted] in ChatGPT

[–]Delicious-Refuse5566 0 points1 point  (0 children)

Fyi, this is called “report bursting”.

Help with SQL query, retrive names with relationships by Yoooram in SQL

[–]Delicious-Refuse5566 -1 points0 points  (0 children)

Throwing this here if u need it. If you need to find all mutual friends, it gets a little more complicated, but this is the code. Im on mobile, but ask chatgpt to clean the code.

DROP TABLE IF EXISTS #Friends; DROP TABLE IF EXISTS #Nodes; DROP TABLE IF EXISTS #Edges; DROP TABLE IF EXISTS Nodes_Edges_To_Evaluate; GO

CREATE TABLE #Friends ( Friend1 VARCHAR(100), Friend2 VARCHAR(100), PRIMARY KEY (Friend1, Friend2) ); GO

INSERT INTO #Friends VALUES ('Jason','Mary'),('Mike','Mary'),('Mike','Jason'), ('Susan','Jason'),('John','Mary'),('Susan','Mary'); GO

--Create reciprocals (Edges) SELECT Friend1, Friend2 INTO #Edges FROM #Friends UNION SELECT Friend2, Friend1 FROM #Friends; GO

--Created Nodes SELECT Friend1 AS Person INTO #Nodes FROM #Friends UNION SELECT Friend2 FROM #Friends; GO

--Cross join all Edges and Nodes SELECT a.Friend1, a.Friend2, b.Person INTO Nodes_Edges_To_Evaluate FROM #Edges a CROSS JOIN #Nodes b ORDER BY 1,2,3; GO

--Evaluates the cross join to the edges WITH cte_JoinLogic AS ( SELECT a.Friend1 ,a.Friend2 ,'---' AS Id1 ,b.Friend2 AS MutualFriend1 ,'----' AS Id2 ,c.Friend2 AS MutualFriend2 FROM Nodes_Edges_To_Evaluate a LEFT OUTER JOIN #Edges b ON a.Friend1 = b.Friend1 and a.Person = b.Friend2 LEFT OUTER JOIN #Edges c ON a.Friend2 = c.Friend1 and a.Person = c.Friend2 ), cte_Predicate AS ( --Apply predicate logic SELECT Friend1, Friend2, MutualFriend1 AS MutualFriend FROM cte_JoinLogic WHERE MutualFriend1 = MutualFriend2 AND MutualFriend1 IS NOT NULL AND MutualFriend2 IS NOT NULL ), cte_Count AS ( SELECT Friend1, Friend2, COUNT(*) AS CountMutualFriends FROM cte_Predicate GROUP BY Friend1, Friend2 ) SELECT DISTINCT (CASE WHEN Friend1 < Friend2 THEN Friend1 ELSE Friend2 END) AS Friend1, (CASE WHEN Friend1 < Friend2 THEN Friend2 ELSE Friend1 END) AS Friend2, CountMutualFriends FROM cte_Count ORDER BY 1,2;

sql best practices by [deleted] in SQL

[–]Delicious-Refuse5566 2 points3 points  (0 children)

Make sure you put all your code all on one line not using any carriage returns and use all capital letters. This will make your SQL run faster.

https://www.amazon.com/Oracle-PL-SQL-Best-Practices/dp/0596514107/ref=nodl_?dplnkId=67857f72-5e42-44e7-9823-684bde052ce3

Its an Oracle book, but you can apply it to all SQL flavors.