© 2023 Hashnode
#dsainjava
How to identify whether I can apply recursion or not? If you find these in a coding problem then you can think of recursion- See if the solution depends on the solutions of smaller versions of the same problem or not. For example, if you w…
All the code snippets in this article are available in my repo: Github: Saaaaaad3 In this article, we will refer to the fundamentals of Java to learn about data structure as java seems to be one of th…
When you need to find a particular value in an array you apply searching algorithms. There are two search algorithms for an Array:- Linear Search Binary Search Linear Search It is an algorithm for…
Q21. Check if the given array is a subset of another array. A21. To check this we transfer the elements of the array to a set, hence removing duplicates. And now we compare the set elements with the s…
Object-oriented programming System(OOPs) is a programming paradigm based on the concept of “objects” and “classes” that contain data and methods. In OOP, a person defines the data type as well as the …
Problem statement:- Given an array of size N. The task is to find the maximum and the minimum element of the array using the minimum number of comparisons. For solving any problems, I would divide it …
This is an opinion-based blog!!!! 😁 So for the past two years, I have been trying to learn DSA, but I failed every time. After two years of trying GFG, Codechef, and Leetcode with different approache…
Sorting: What makes it interesting? ▸Sorting is the process of grouping in an increasing or decreasing order based on a linear connection between the data pieces. An essential key to algorithm design …
Hello, reader 👋🏽 ! Welcome to day 90 of the series on Problem Solving. Through this series, I aim to pick up at least one question every day and share my approach to solving it. Today, I will be pic…
Hello, reader 👋🏽 ! Welcome to day 89 of the series on Problem Solving. Through this series, I aim to pick up at least one question every day and share my approach to solving it. Today, I will be pic…
