Rabin-Karp Algorithm

It is a cooler summer Saturday in the Twin Cities of Minneapolis and St. Paul. My wife and I are planning to go out for lunch. As soon as she is ready we should leave.

In the recent posts “MongoDB Text Search” and “Find Damaged – Part II” for one reason or another I have been dealing with full text searches. The MongoDB post covers how to use text searches in the database. A software engineer was in the process of experimenting with MongoDB on the cloud (Atlas) and was interested in performing text searches. The need was associated with a work related request. Continue reading “Rabin-Karp Algorithm”

MongoDB Text Search

Yesterday was a warm and humid day in the Twin Cities of Minneapolis and St. Paul.

Last week a software developer mentioned that he was interested in using MongoDB Atlas and needed to do some text searches. I have used text searches in a project a couple years ago. I have also experimented with it using the Community version currently installed in one of my Windows machines. I decided to test it to make sure searching for text in MongoDB is working as advertised.

I could have used an existing MongoDB database and collection but for simplicity I decided to use the example illustrated in the MongoDB documentation for Text Search. I would like to note that in my opinion MongoDB has done a very good job with their documentation. Continue reading “MongoDB Text Search”

BST Search

It is a Saturday in August in the Twin Cities of Minneapolis and St. Paul and it is going to be a warm and humid day. My wife is out shopping with a friend and I am in my home office having fun with Binary Search Trees (BSTs).

This past week I was talking with a software engineer about coding interviews. I have mixed thoughts about them. Not sure about their value as far as finding out if a person is able to develop quality software. Allow me to describe the process which seems to be quite spread around the industry.

The candidate is interviewed by multiple technical people. The idea is to present the candidate with a set of one or more programming problems and expect working code written on a whiteboard. Typically the programming language of choice is up to the candidate. Continue reading “BST Search”