PinnedNeelesh JangaUnderstanding Java Streams with Practical Examples — Java StoriesIntroductionJul 141Jul 141
Neelesh JangaHow to Run C/C++ Code in a Java Environment Using JNI: A Step-by-Step GuideIf you’ve ever wanted to combine the power of C/C++ with the versatility of Java, you’re in the right place! In this article, we’ll walk…Jul 11Jul 11
Neelesh JangaQ-268 LeetCode: Missing Number Calculation in JavaGiven an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.Jan 22Jan 22
Neelesh JangaQ-263 LeetCode: Ugly Number Detection in JavaAn ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.Jan 18Jan 18
Neelesh JangaQ-258 LeetCode: Digital Root Calculation Algorithm in JavaGiven an integer num, repeatedly add all its digits until the result has only one digit, and return it.Jan 16Jan 16
Neelesh JangaQ-232 LeetCode: Implement Queue using StacksImplement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue…Jan 14Jan 14
Neelesh JangaQ-231 LeetCode: Power of TwoGiven an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an…Jan 12Jan 12
Neelesh JangaQ-225 LeetCode: Implement Stack using QueuesImplement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack…Jan 10Jan 10
Neelesh JangaQ-222 LeetCode: Count Complete Tree NodesGiven the root of a complete binary tree, return the number of the nodes in the tree.Jan 8Jan 8
