Discover and read the best of Twitter Threads about #LeetCode
Most recents (7)
Day -16 on #Leetcode SQL Questions Series
🎯Today I Take a Question From
@LeetCode Platform 🔥
🧵👇
🎯Today I Take a Question From
@LeetCode Platform 🔥
🧵👇
Q16 ) Write an SQL query to report all customers who never order anything.
Return the result table in any order.
Return the result table in any order.
Day -15 on #Leetcode SQL Questions Series
🎯Today I Take a Question From @LeetCode Platform 🔥
🧵👇
🎯Today I Take a Question From @LeetCode Platform 🔥
🧵👇
Q15) A company's executives are interested in seeing who earns the most money in each of the company's departments. A high earner in a department is an employee who has a salary in the top three unique salaries for that department.
--- Write an SQL query to find the employees who are high earners in each of the departments.
Binary Tree Inorder Traversal, today's @Leetcode challenge: Understanding the problem to intuition to solution, 3 approaches.
A thread 🧵
#100daysOfCode #leetcode
A thread 🧵
#100daysOfCode #leetcode
Problem Statement-
Given the root of a binary tree, return the inorder traversal of its nodes' values.
Given the root of a binary tree, return the inorder traversal of its nodes' values.
Understanding the problem-
It's a really standard problem: one of the DFS traversals.
It's a really standard problem: one of the DFS traversals.
"429. N-ary Tree Level Order Traversal", today's @LeetCode challenge explained with DFS and BFS methods.
A thread 🧵
#100daysOfCode
#leetcode
A thread 🧵
#100daysOfCode
#leetcode
@LeetCode Problem Statement-
Given an n-ary tree, return the level order traversal of its nodes' values.
Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).
Given an n-ary tree, return the level order traversal of its nodes' values.
Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).
@LeetCode Understanding the problem-
Usually, we're given tree problems which has left and right child but here is something different. For any node, it's child are given in form of node arrays. It means now any node can have more than 2 child also.
We've to find level order traversal.
Usually, we're given tree problems which has left and right child but here is something different. For any node, it's child are given in form of node arrays. It means now any node can have more than 2 child also.
We've to find level order traversal.
As promised, a thread of amazing folks working in Open Source. Like most people in FOSS they probably don't get the recognition they deserve.
If you like #Python and programming, I suggest you following everyone in this tread.
Doubles as #FF
Please RT for visibility.
🧵
If you like #Python and programming, I suggest you following everyone in this tread.
Doubles as #FF
Please RT for visibility.
🧵
Follow João S. O. Bueno @gwidion
João is building terminedia and rows
github.com/jsbueno/termin…
github.com/turicas/rows
João is building terminedia and rows
github.com/jsbueno/termin…
github.com/turicas/rows
Patrick Loeber @python_engineer produces amazing Youtube content. Essential viewing for #Python engineers!
I am going to be solving a leet code question per day till the end of the year across all difficulty levels. My preferred languages will be Java and Golang. As a form of accountability, I will be posting my solutions here as a thread.
#Programming #100DaysOfCode
#Programming #100DaysOfCode
Today is the first day, and I solved the Two Sums.
Difficulty Level: Easy.
Language: Golang
Difficulty Level: Easy.
Language: Golang
Day 2: I solved the first missing positive problem.
Difficulty level: Hard.
Language: Golang
#SoftwareEngineering #Programming #LeetCode
Difficulty level: Hard.
Language: Golang
#SoftwareEngineering #Programming #LeetCode
Some useful chrome extensions for #leetcode
A thread 🧵:
A thread 🧵:
1) LeetHub - Integrates your code with Leetcode and github. This makes your Github profile more presentable as it helps show your problem solving status.
2) Leet Repeat - Spaced repetition of selected problems which helps you revise some key problems regularly. This helps in solution retention via repetition.
