Fortsätt till huvudinnehåll

Let learning take time

I've read somewhere that the most time consuming part of programming is learning. Yesterday I got some hands on experience of this when solving three Codility tasks in a limited time. The time given to solve the tasks was generous, still I failed to deliver proper, well tested and clean solutions. And my self confidence dropped a couple of levels.

Then I started thinking of why I was unable to deliver better solutions and I realized I had spent most of the time given not solving the actual tasks, but rather trying out and learning how to do certain things, like slicing up strings, working with date and time and so on, in Java.

The Codility tasks were to be solved using the Structured Query Language (SQL) and Java. Two languages I really wan't to add to my toolbox but have limited experience with.
The second Java task involved (amongst other) extracting time (hours, minutes, and seconds) from strings and converting them to Java objects that can be added together and compared. This was one of the things I needed to learn, and the clock was ticking...

Unfortunately I made a wrong choice here and chose to use LocalTime, mostly because of the nice parse method that directly converts a string of format hh:mm:ss to a LocalTime object. By the time I started to try to increment one LocalTime object with another I realized that what I really wanted to use was Duration, bummer.

Now, after I had submitted the unfinished code (due to the time running out) I actually spent some additional time cleaning up and writing the code how I would have wanted it to be. And in the end I believe it turned out pretty good (for something that is limited to a single file).

A couple of things I have learned from this experience: grouping SQL queries, some more string parsing in Java and how to use the LocalTime and Duration classes (next time I face a problem like this I should be able to solve it in half the time). Most important lesson, keep on learning, but let it take time. Testing skills should be done on skills already aquired, not that you have to learn during the test itself.

Kommentarer

Populära inlägg i den här bloggen

Does TDD really improve software quality?

I have asked myself this question several times, and searched for answers, without coming up with any clear answer. Therefore I have decided to go hard core TDD for a longer period of time (at least 6 months) to really evaluate the effects. There are several things that I find confusing when it comes to TDD. One example is what actually defines a unit test. What is a "unit" anyway? After reading a bit about it I found a text claiming that the "unit" is "a unit of work", i.e. something quite small. Like converting a string to UPPERCASE or splitting a string into an ['a','r', 'r', 'a', 'y'] of chars. This work is usually performed by a single call to a single method in a single, isolated, class. So, what does it mean that a class is isolated? Does it mean that it doesn't have any dependencies to other classes? NO! In the context of TDD it means that any dependencies are supplied by the test environment, for exa...

Codility tasks - Part I

I was recently faced with two codility tasks when applying for a job as an Embedded Software Engineer. For those of you who arn't familiar with Codility you can check out their website here:  www.codility.com Task one - Dominator The first task was called Dominator. The goal was to, given a std::vector of integers, find an integer that occurs in more than half of the positions in the vector. If no dominator was found -1 should be returned. My approach was to loop through the vector from the first to the last element, using a std::map to count the number of occurences of each integer. If the count ever reached above half the size of the vector I stopped and returned that integer and if I reached the end without finding a dominator I returned -1. So was that a good approach? Well, the reviewer at the company rated the solution as 'pretty ok'. His preferred solution was store the first integer in the array and set a counter to 1. Then loop through the remaining i...

Codility tasks - Part II

Now, the second codility task I was faced with was a bit tougher. The goal was to create a function that, given a vector of integers A and an integer K, returned the number of integer pairs in the vector that, when added, sums up to K. Let me give you an example. Assume that you are given a vector A = [0, -1, 3, 2, -5, 7] and K = 2. Possible combinations to get K are (0, 2), (-1, 3), (3, -1), (2, 0),  (-5, 7), and (7, -5). In other words, the function should return 6. Now, how did I solve this task? The first solution that came to mind involved nested for-loops. The outer loop picking one integer at the time from the vector and the inner loop adding the integer to the others one by one to see if the result is K. This solution works, but it does not scale well. Time complexity will be O(N**2) ,   something that for large vectors will result in very long execution times. My second approach was to use my old friend, the integer counter, and count all occurences of each...