Skip to content

Java Minded

  • Algorithms
  • Datastructures
  • Java
  • Java 8
  • Java 11
  • Java 14

Finding duplicates in an array using negation, single scan -O(n)

Tags Finding Duplicates, Negation, Programming Puzzles

Finding duplicates in an array using Hashtables -O(n)

Tags Finding Duplicates, HashMap, HashSet, Interview Q's

Finding duplicates in a sorted array – O(nlogn)

Tags Finding Duplicates, Interview Q's, Programming Puzzles

Finding Duplicates in an array -BruteForce [O(n^2)]

Tags Bruteforce, Finding Duplicates, Interview Q's, Programming Puzzles

Towers of Hanoi using Recursion in Java

Tags featured, Programming Puzzles, Recursion, Towers of Hanoi

Reversing an array using Recursion in Java

Tags Interview Q's, Programming Puzzles, Recursion, Tail Recursion

Linear Sum using Recursion in Java

Tags Linear Sum, Programming Puzzles, Recursion

Fibonacci series using Recursion in Java

Tags Fibonacci Number, Programming Puzzles, Recursion

Power of a given number using Recursion in Java

Tags Interview Q's, Programming Puzzles, Recursion

Factorial of a number using Recursion

Tags Factorial, Interview Q's, Programming Puzzles, Recursion
Post navigation
Older posts
Newer posts
← Previous Page1 Page2 Page3 Page4 Next →

Newsletter

Sign up to receive email updates and to hear about the latest Java Tutorials!

Latest Tutorials

Java8 – Convert List to comma separated String in java

java8 – forEach vs forEachOrdered

File Path – Constructing file path in Java

Bag / Multiset implementation with LinkedList in Java

Finding the number that occurs odd number of times

Java 7 read file to String

Gradle – Installation on windows and Unix

How To Check Your Disk space on Ubuntu

Listing attributes of a bean with Java Bean’s introspection API

Maven 3.1.1- Installation on Windows

Java Minded

Thoughts on Java Programming, Algorithms and Datastructures.

Keep In Touch

  • Facebook
  • GitHub
  • Medium
  • Twitter
  • YouTube
© 2020 Java Minded • Made with ❤️ from Hyderabad, India
By visiting JMinded.com you accept our use of cookies and agree to our Find out more.