James Michael Hare

...hare-brained ideas from the realm of software development...
posts - 166 , comments - 1458 , trackbacks - 0

My Links

News

Welcome to my blog! I'm a Sr. Software Development Engineer in the Seattle area, who has been performing C++/C#/Java development for over 20 years, but have definitely learned that there is always more to learn!

All thoughts and opinions expressed in my blog and my comments are my own and do not represent the thoughts of my employer.

Blogs I Read

Follow BlkRabbitCoder on Twitter

Tag Cloud

Archives

Post Categories

Image Galleries

.NET

CSharp

Little Wonders

Little Wonders

vNext

August 2015 Entries

Solution to Little Puzzlers - Lowest Common Ancestor
This is the way I went about the "Lowest Common Ancestor" problem. However, keep in mind there are multiple ways to solve this, so don't worry if your solution has variations and it’s entirely possible there are more efficient ways. Feel free to suggest your solution in the comments here or in the original post, but please be respectful of others’ efforts. The Solution The first tendency in this problem is to want to walk back up the tree. This is obviously problematic because we do not have a parent ......

Posted On Thursday, August 27, 2015 12:52 AM | Comments (7) | Filed Under [ My Blog C# Software .NET Little Puzzlers Technology ]

Back in Seattle Again
Hey folks, after 8 months back in the mid-west, we had a family meeting and decided that it would be better for my career and our kids to go back to Seattle.  We're relocated again, though still waiting for all of our computers, furtniture, etc. 

As soon as I can, I will post the solution to the latest puzzler, and send you a new one! 

To those who were noticing duplications in my feed, I believe I fixed this, is anyone still noticing issues?

-Jim

Posted On Wednesday, August 26, 2015 5:07 PM | Comments (17) | Filed Under [ My Blog ]

Little Puzzlers–Lowest Common Ancestor
I like to keep my brain sharp by working on programming puzzlers. On off weeks I'm going to start posting programming puzzlers I've collected over the years. Hopefully you'll find them as entertaining as I do. The Problem A binary search tree is a tree with the ordered property. That is, for every node in the tree with value x, all nodes in the left subtree are < x and all nodes in the right subtree are > x recursively. So, given a binary search tree (BST) and two values, determine the lowest ......

Posted On Wednesday, August 5, 2015 10:59 AM | Comments (8) |

Solution to Little Puzzlers–“List All Anagrams in a Word”
This is the way I went about the "List all anagrams in a word” problems. However, keep in mind there are multiple ways to solve this, so don't worry if your solution has variations and it’s entirely possible there are more efficient ways. Feel free to suggest your solution in the comments here or in the original post, but please be respectful of others’ efforts. The Solution There are many ways to tackle this problem. Ultimately, the main goal of this problem was to be able to return all the anagram ......

Posted On Tuesday, August 4, 2015 4:22 PM | Comments (6) | Filed Under [ My Blog C# Software .NET Little Puzzlers Technology CSharp ]

Powered by: