Eric Programming

Eric programming

data structure

learn coding

computer science

Welcome to Eric Programming! This is the official second channel of @ericwtech, dedicated to helping you master the fundamentals of computer science.

Here, we dive deep into:
• Leetcode Problems (Step-by-step solutions)
• Data Structures & Algorithms
• Core Computer Science Theory

My goal is to give you the skills and confidence to ace your technical interviews and level up as an engineer. Subscribe to start learning!

Day in the life of a Microsoft Software Engineer in Vancouver Canada

Day in the life of a Microsoft Software Engineer in Vancouver Canada
5 Steps to Problem Solve Coding Interview Questions

5 Steps to Problem Solve Coding Interview Questions
Leetcode Study Roadmap [Beginner's Guide]

Leetcode Study Roadmap [Beginner's Guide]
[MySQL] Leetcode 177. Department Highest Salary [SQL #7]

[MySQL] Leetcode 177. Department Highest Salary [SQL #7]
[MySQL] Leetcode 184. Department Highest Salary [SQL #6]

[MySQL] Leetcode 184. Department Highest Salary [SQL #6]
[MySQL] Leetcode 175. Combine Two Tables [SQL #5]

[MySQL] Leetcode 175. Combine Two Tables [SQL #5]
SQL Joins Difference (Inner/Left/Right/Full/Outer Joins)

SQL Joins Difference (Inner/Left/Right/Full/Outer Joins)
[MySQL] Leetcode 182. Duplicate Emails [SQL #4]

[MySQL] Leetcode 182. Duplicate Emails [SQL #4]
[MySQL] Leetcode 181. Employees Earning More Than Their Managers [SQL #3]

[MySQL] Leetcode 181. Employees Earning More Than Their Managers [SQL #3]
[MySQL] Leetcode 620. Not Boring Movies [SQL #2]

[MySQL] Leetcode 620. Not Boring Movies [SQL #2]
[MySQL] Leetcode 627. Swap Salary [SQL #1]

[MySQL] Leetcode 627. Swap Salary [SQL #1]
[Java] Leetcode 309. Best Time to Buy and Sell Stock with Cooldown [DP Min/Max Path to Target #9]

[Java] Leetcode 309. Best Time to Buy and Sell Stock with Cooldown [DP Min/Max Path to Target #9]
[Java] Leetcode 279. Perfect Squares [DP Integer Partition #2]

[Java] Leetcode 279. Perfect Squares [DP Integer Partition #2]
[Java] Leetcode 343. Integer Break [DP Integer Partition #1]

[Java] Leetcode 343. Integer Break [DP Integer Partition #1]
[Java] Leetcode 489. Robot Room Cleaner [Backtracking #14]

[Java] Leetcode 489. Robot Room Cleaner [Backtracking #14]
[Java] Leetcode 718. Maximum Length of Repeated Subarray [DP Subsequence #9]

[Java] Leetcode 718. Maximum Length of Repeated Subarray [DP Subsequence #9]
[Java] Leetcode 31. Next Permutation [Array #11]

[Java] Leetcode 31. Next Permutation [Array #11]
[Java] Leetcode 271. Encode and Decode Strings [String #4]

[Java] Leetcode 271. Encode and Decode Strings [String #4]
[Java] Leetcode 241. Different Ways to Add Parentheses [Backtracking #13]

[Java] Leetcode 241. Different Ways to Add Parentheses [Backtracking #13]
[Java] Leetcode 1041. Robot Bounded In Circle [Array #10]

[Java] Leetcode 1041. Robot Bounded In Circle [Array #10]
[Java] Leetcode 1089. Duplicate Zeros [Array #5]

[Java] Leetcode 1089. Duplicate Zeros [Array #5]
[Java] Leetcode 937. Reorder Data in Log Files [String #3]

[Java] Leetcode 937. Reorder Data in Log Files [String #3]
[Java] Leetcode 472. Concatenated Words [DP Distinct Ways 10]

[Java] Leetcode 472. Concatenated Words [DP Distinct Ways 10]
[Java] Leetcode 55. Jump Game [DP Decision Making #3]

[Java] Leetcode 55. Jump Game [DP Decision Making #3]
[Java] Leetcode 96. Unique Binary Search Tree [DP Distinct Ways #9]

[Java] Leetcode 96. Unique Binary Search Tree [DP Distinct Ways #9]
[Java] Leetcode 140. Word Break II [DP Subsequence #8]

[Java] Leetcode 140. Word Break II [DP Subsequence #8]
[Java] Leetcode 673. Number of Longest Increasing Subsequence [DP Subsequence #7]

[Java] Leetcode 673. Number of Longest Increasing Subsequence [DP Subsequence #7]
[Java] Leetcode 332. Reconstruct Itinerary [Backtracking #10]

[Java] Leetcode 332. Reconstruct Itinerary [Backtracking #10]
[Java] Leetcode 97. Interleaving String [DP Subsequence #6]

[Java] Leetcode 97. Interleaving String [DP Subsequence #6]
[Java] Leetcode 115. Distinct Subsequences [DP Subsequence #5]

[Java] Leetcode 115. Distinct Subsequences [DP Subsequence #5]