Awesome Java

Java LibHunt Info

• Categories
  86
• Tags
  514
• Projects
  721
• Resources
  177
• Suggested Changes
  1

Monitoring and distributed tracing for Java apps. 14-day free trial. More from our partner

All Categories

• Ancients
  8
• Bean Mapping
  7
• Bots
  1
• Build
  4
• Bytecode Manipulation
  4
• Caching
  3
• Cluster Management
  3
• Code Analysis
  13
• Code Coverage
  4
• Code Generators
  3
• Command-line Argument Parsers
  8
• Compiler-compiler
  3
• Configuration
  8
• Constraint Satisfaction Problem Solver
  4
• Continuous Integration
  11
• CSV
  7
• Database
  31
• Data structures
  16
• Date and Time
  6
• Dependency Injection
  8
• Development
  20
• Distributed Applications
  21
• Distributed Databases
  6
• Distributed Transactions
  3
• Distribution
  10
• Document Processing
  4
• Formal Verification
  10
• Functional Programming
  12
• Game Development
  5
• Geospatial
  10
• GUI
  4
• High Performance
  10
• Hypermedia Types
  2
• IDE
  7
• Imagery
  6
• JSON
  13
• JSON Processing
  6
• JVM and JDK
  7
• Logging
  11
• Machine Learning
  13
• Messaging
  15
• Microservice
  6
• Miscellaneous
  31
• Monitoring
  20
• Native
  3
• Natural Language Processing
  7
• Networking
  18
• ORM
  7
• PaaS
  6
• PDF
  8
• Performance analysis
  12
• Platform
  57
• Projects
  23
• Reactive libraries
  4
• REST Frameworks
  18
• Rules Engine
  4
• Science
  11
• Search
  4
• Security
  16
• Serialization
  6
• Server
  6
• Telephony
  1
• Template Engine
  9
• Testing
  51
• Text Processing
  1
• Third-party APIs
  0
• Utility
  20
• Version Managers
  2
• Web Crawling
  5
• Web Frameworks
  23

SaaSHub - Software Alternatives and Reviews More from our team

The Awesome Java feed

Identical Binary Trees (Same Tree) problem

Given two binary trees, write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Article Added by: callicoder // www.callicoder.com

Valid Parentheses problem

Given a string containing just the characters (, ), {, }, [ and ], determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.

Article Added by: callicoder // www.callicoder.com

Merge Two Sorted Linked Lists

Merge two sorted linked lists and return it as a new list. The new list should also be sorted.

Article Added by: callicoder // www.callicoder.com

Spring Boot Actuator Complete Tutorial with Example

Article Added by: TechBlogStation // techblogstation.com

Longest Palindromic Substring

Given a string s, find the longest palindromic substring in s.

Article Added by: callicoder // www.callicoder.com

Maximum Contiguous Subarray Sum

Given an integer array numbers, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Article Added by: callicoder // www.callicoder.com

Add two numbers represented using Linked Lists

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Article Added by: callicoder // www.callicoder.com

Design and implement a data structure for Least Recently Used (LRU) cache

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:
get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
put(key, value) - Set or insert the value for the given key in the cache. When the cache has reached its capacity, it should invalidate the least recently used item before inserting a new item.
The cache is initialized with a positive capacity.

Article Added by: callicoder // www.callicoder.com

Reverse a Singly Linked List

Tutorial Added by: callicoder // www.callicoder.com

Two Sum Problem solution in Java

Given an array of integers, return the indices of the two numbers whose sum is equal to a given target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.

Tutorial Added by: callicoder // www.callicoder.com