First time here? Start with Subscribing
Recent Posts
- Leetcode 15. 3Sum
- Leetcode 167. Two Sum II – Input array is sorted
- Leetcode 70. Climbing Stairs
- Leetcode 1. Two Sum
- Leetcode #1529: Bulb Switcher IV
- Leetcode #1503: Last Moment Before All Ants Fall Out of a Plank
- Leetcode #1487: Making File Names Unique
- Leetcode #1488: Avoid Flood in The City
- Leetcode #1465: Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
Featured Posts
Dynamic Programming
The idea behind solving dynamic programming problems is simple – remember what you have already solved and use the already computed solution in case you are solving the same problem again. In other words, solve one problem only once and remember the solution to it so that you can quickly provide the solution without the need to solve the problem again. … More Dynamic Programming
How you can crack every coding interview
It is definitely not easy, but you can greatly improve the odds if you nail the following approach. I am going to explain the key elements that you need to get right to crack the interview. How many times you solve the question, code it completely, but still don’t clear the interview? This post is an attempt to stop this happening with you. … More How you can crack every coding interview
Stuck on a problem in coding interview? Here is how to poke the problem towards solution
When you get stuck in an interview, you have the opportunity to actually get maximum points from the interviewer as long as you keep the positive attitude and logical approach. Ideally, the interviewer would like to see the candidate struggle and then find the solution. This way, they are able to see how you tackle the problems in the real world. … More Stuck on a problem in coding interview? Here is how to poke the problem towards solution
Analysis of Algorithms | Big-O Analysis
For any problem, usually, there are multiple ways to tackle it. Solving a coding problem in an interview is no different. There are almost always multiple solutions to the given problem. Each solution has some cost i.e. time and space complexity associated with it. Your job is to identify various solutions, analyze their time & space complexities, discuss this with the interviewer, and implement the most suitable solution depending on the inputs and constraints. … More Analysis of Algorithms | Big-O Analysis
What things you should know how to do in your programming language
The purpose of this post is to remind you of a variety of common things that you would need when writing the code in the coding interview. What you must do is to check the syntax of that thing in the language of your choice. I have listed most of the things that I have ever had to use across all the interviews I have appeared for. Some things are necessary for pretty much every interview while others are rare. I recommend studying everything even if it is a rarely necessary thing because I want to enable you to crack every coding interview. … More What things you should know how to do in your programming language
Leetcode #1424: Diagonal Traverse II
In a 2D matrix, elements in the same diagonal have same sum of their indices. So if we have all elements with same sum of their indices together, then it’s just a matter of printing those elements in order. … More Leetcode #1424: Diagonal Traverse II
Categories
Follow The Blog
Get new content delivered directly to your inbox.
