Question 199 - Binary Tree Right Side ViewGiven the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
LeetCode Series - Step by Step Explaination to solve 3Sum QuestionGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.
5 Steps to Grind LeetCode Effectively with Spaced Repetition and Deliberate ExerciseAs software engineers, we dream of landing a job at a big tech company. Of course, we must go through the interview process, and the coding interview is one of them. However some of us only have a minor improvement after solving numerous of question. This article shares how to improve steadily by utilizing spaced reptition and deliberate exercise.