core java Understanding JVM Architecture | How does JVM works? We know the main feature of JVM is to convert the java byte code into machine code. But what black box magic is happening inside the Java Virtual Machine? That quest to find the answer to that question decided me write this article. As we know JVM is a specification
Fast and Slow Pointer Design Pattern Palindrom Linked List | Leetcode 234. In this article, we will look at the palindrome linked list problem and solve this problem using fast and slow pointer design patterns. Before trying to solve the problem, let's understand what the problem is. We recommend giving it a try by yourself before going through the article. Find the
Leetcode Problems Reverse a Linked List using Pointers | Leetcode 206 LinkedList is one of the popular data structures that is used for collections. Though LinkedList isn't used as popularly as Arraylist, there are some advantages that linkedlist provides over ArrayList. Firstly, if our list requires a lot of insertion or deletion in the middle then linkedlist performs better than arraylist.
LeetCode Design Patterns Fast and Slow Pointer Design Pattern The fast and slow pointer design pattern is another popular design pattern that is used for solving problems related to cyclic linked lists or to determine if there is an indefinite loop. The design pattern is also popularly called as hare and tortoise design pattern. In fast and slow pointer
LeetCode Design Patterns What is Sliding Window Design Pattern algorithm? If you are doing leetcode then you have definitely encountered problems related to array and subarray. You might have used some nested loops to solve this kind of problem. But what if you saw the same problem during your interview and your interviewer asked to solve it using one iteration.
