Neelesh Janga – Medium

Neelesh Janga

Q-268 LeetCode: Missing Number Calculation in Java

Given 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.

3 min readJan 22, 2024

--

Q-268 LeetCode: Missing Number Calculation in Java

--

Neelesh Janga

Q-263 LeetCode: Ugly Number Detection in Java

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.

3 min readJan 18, 2024

--

Q-263 LeetCode: Ugly Number Detection in Java

--

Neelesh Janga

Q-258 LeetCode: Digital Root Calculation Algorithm in Java

Given an integer num, repeatedly add all its digits until the result has only one digit, and return it.

3 min readJan 16, 2024

--

Q-258 LeetCode: Digital Root Calculation Algorithm in Java

--

Neelesh Janga

Q-232 LeetCode: Implement Queue using Stacks

Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue…

3 min readJan 14, 2024

--

Q-232 LeetCode: Implement Queue using Stacks

--

Neelesh Janga

Q-231 LeetCode: Power of Two

Given 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…

2 min readJan 12, 2024

--

Q-231 LeetCode: Power of Two

--

Neelesh Janga

Q-225 LeetCode: Implement Stack using Queues

Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack…

3 min readJan 10, 2024

--

Q-225 LeetCode: Implement Stack using Queues

--

Neelesh Janga

Q-222 LeetCode: Count Complete Tree Nodes

Given the root of a complete binary tree, return the number of the nodes in the tree.

2 min readJan 8, 2024

--

Q-222 LeetCode: Count Complete Tree Nodes

--

Neelesh Janga

Q-34 LeetCode: Find First and Last Position of Element in Sorted Array

Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.

3 min readJan 6, 2024

--

Q-34 LeetCode: Find First and Last Position of Element in Sorted Array

--

Neelesh Janga

Q-202 LeetCode: A Recursive Journey to Discover Happy Numbers in Java

Write an algorithm to determine if a number n is happy.

3 min readJan 4, 2024

--

Q-202 LeetCode: A Recursive Journey to Discover Happy Numbers in Java

--

Neelesh Janga

Q-191 LeetCode: Counting Set Bits using Hamming Weight Algorithm for Unsigned Integers in Java

Write a function that takes the binary representation of an unsigned integer and returns the number of ‘1’ bits it has (also known as the…

3 min readJan 2, 2024

--

Q-191 LeetCode: Counting Set Bits using Hamming Weight Algorithm for Unsigned Integers in Java

--

Neelesh Janga

Neelesh Janga

I'm passionate about AI, Coding, DSA, Freelancing , Web development & Security. These interests drive my journey as a tech enthusiast and innovator.

Following

Help
Status
About
Careers
Press
Blog
Privacy
Terms
Text to speech
Teams