Shrushti PawarReverse-Integer LeetCode Problem explained with Java solutionSolution: class Solution { public int reverse(int x) { int reverse=0; while(x != 0) { int remainder = x…Jan 30
codeandnotesLeetCode 1352. Product of the Last K NumbersI break down the problem statement, go through my thought process, and provide a step-by-step solution walkthrough of the problem.Jul 12, 2020
The Computer Nerd407. Trapping Rain Water II (LeetCode Hard) — Java Solution with IntuitionI went through various solutions submitted by others for this problem. I was not able to come up with my own approach for this problem. I…Jan 6Jan 6
HarshaBill Division | HackerRank Problem | Java SolutionThe question is from HackerRank’s Algorithm section, let’s dive into the explanation of the question. Basically, there are two friends and…Feb 11, 2022Feb 11, 2022
Diptendu DasJava Solution for The Knapsack ProblemThe Knapsack problem is a classic optimization problem that involves selecting a subset of items from a larger set of items, each with a…May 5, 2023May 5, 2023
Shrushti PawarReverse-Integer LeetCode Problem explained with Java solutionSolution: class Solution { public int reverse(int x) { int reverse=0; while(x != 0) { int remainder = x…Jan 30
codeandnotesLeetCode 1352. Product of the Last K NumbersI break down the problem statement, go through my thought process, and provide a step-by-step solution walkthrough of the problem.Jul 12, 2020
The Computer Nerd407. Trapping Rain Water II (LeetCode Hard) — Java Solution with IntuitionI went through various solutions submitted by others for this problem. I was not able to come up with my own approach for this problem. I…Jan 6
HarshaBill Division | HackerRank Problem | Java SolutionThe question is from HackerRank’s Algorithm section, let’s dive into the explanation of the question. Basically, there are two friends and…Feb 11, 2022
Diptendu DasJava Solution for The Knapsack ProblemThe Knapsack problem is a classic optimization problem that involves selecting a subset of items from a larger set of items, each with a…May 5, 2023
HarshaCats and a Mouse | HackerRank Problem | Java SolutionThis is a HackerRank algorithm problem. The question might sound a little complicated but it has the easiest solution. Let’s have a brief…Feb 14, 2022
Raghav AryaHow to Solve Find All Anagrams in a String in Java?Finding all anagrams in a string is a common problem in computer science and can have a variety of applications, such as text analysis and…Mar 3, 2023
InLevel Up CodingbySuraj MishraIncreasing Order Search Tree — Leetcode 897 ( Java Solution )Java Solution for Leetcode 897Jan 17, 2023
