I wish that it were more like you've described here, but unfortunately, my experience is that the interviews will be very challenging, that you will need to know data structures very well, and that it really won't be enough to talk generally about these things. It might not even be enough to talk generally in a way that shows you understand how to use a data structure to solve a problem and sketch out a bit of code. It depends on the company, but to get an offer, you may need to write more or less accurate code at a whiteboard that solves a problem efficiently. Some minor syntax errors aren't a big deal, but overall, the code will need to be pretty tight and be close to working. Again, this is in my experience (I have interviewed at amazon and google, as well as smaller startups that seem to do the same thing).
I'd highly recommend "cracking the coding interview", and make sure you can handle even the moderate to difficult problems in about an hour at a whiteboard. Before you go to that, though, go back to your data structures and algorithms book and make sure you can do basic list, stack, queue, binary tree, hash, and binary operations. In other words, you should be able to build and print a linked list or binary search tree without much thought - if you can't do this, there's no way you'll be able to solve unanticipated whiteboard problems that use linked lists, trees, or other core data structures in a more elaborate way.
Your experience will be worth more than your degree, eventually, but you probably will still need to pass the technical interview/exams when you change jobs, even at more senior technical levels.
I'm not saying this is good, just saying this is how it is.
My experience in the midwest is much different. I know of a number of folks who were hired as developers with no coding/whiteboarding required.
That said, I would expect an interview at Google or Amazon to be tougher. Given their name recognition, they can afford to be choosy. The vast majority of companies cannot.
I'd highly recommend "cracking the coding interview", and make sure you can handle even the moderate to difficult problems in about an hour at a whiteboard. Before you go to that, though, go back to your data structures and algorithms book and make sure you can do basic list, stack, queue, binary tree, hash, and binary operations. In other words, you should be able to build and print a linked list or binary search tree without much thought - if you can't do this, there's no way you'll be able to solve unanticipated whiteboard problems that use linked lists, trees, or other core data structures in a more elaborate way.
Your experience will be worth more than your degree, eventually, but you probably will still need to pass the technical interview/exams when you change jobs, even at more senior technical levels.
I'm not saying this is good, just saying this is how it is.