{{ !articles[0].partner.isSponsoringArticle ? "Platinum" : "Portal" }} Partner
java,code puzzler

Thursday Code Puzzler: Splitting Linked Lists

Thursday is code puzzler day here at DZone. The idea is simple: solve the coding problem as efficiently as you can, in any language or framework that you find suitable.

Note: Even though there really is nothing stopping you from finding a solution to this on the internet, try to keep honest, and come up with your own answer.  It's all about the participation!

Do you have code puzzlers that you'd like to share with the DZone community?  If so, please submit here. 

Splitting A Linked List

Write a method that takes a linked list and splits it up into two sub-lists, one for the front half and one for the back. If the number of elements are odd, the extra element goes to the front list.

An example of this would be a complete list of [2,3,4,5,7,11,13] that would give you [2,3,4,5] and [7,11,13]. Remember to use the Linked List data structure.

Catch up on all our previous puzzlers here.

{{ tag }}, {{tag}},

{{ parent.title || parent.header.title}}

{{ parent.tldr }}

{{ parent.urlSource.name }}
{{ parent.authors[0].realName || parent.author}}

{{ parent.authors[0].tagline || parent.tagline }}

{{ parent.views }} ViewsClicks