Search Results

Search found 5 results on 1 pages for 'efficiencyisbliss'.

Page 1/1 | 1 

• Map keys in Vim

  - by efficiencyIsBliss

  I want to map e to mean end of line. I tried the following mapping in my vimrc: map $ e $ is the default end of line command. However, this doesn't work. I'm wondering what the problem is. Also, I want to map Alt+right/left arrow to navigate words. So, for example, Alt+right arrow would take me to end of word. This command is currently mapped to e. Any tips on how I would go about doing this? Thanks!

  Read the article

• Updating Python on Ubuntu system

  - by efficiencyIsBliss

  I want to update the Python build on my Linux box, but the only way I know how to do it is uninstalling the current version and installing the new one. My system is already up to date (I updated yesterday). I wanted to know if there is a way to update a specific program from the command line, like sudo apt-get update <program-name>. I know this command doesn't exist, but I'm hoping something equivalent does.

  Read the article

• How do you get an add-on to run in Firefox 4?

  - by efficiencyIsBliss

  I have an add-on called Flash-Aid in Firefox 4 on my Ubuntu build, but ever since Mozilla came up with their new UI, I haven't been able to figure out how to get add-ons to actually run within Firefox. Double clicking them just opens up a detail page about them and there are no options to run them. With most add-ons, this isn't a problem since they usually don't need to be explicitly run, but this one does. Can someone tell me how to do this?

  Read the article

• Given a number of rectangles that can be rotated, find an enclosing rectangle of minimum area

  - by efficiencyIsBliss

  So, I'm trying to implement an algorithm that takes in a number of rectangles as input and tries to pack them into a rectangle of minimum area. The rectangles can all be rotated by 90 degrees. I realize that this is similar to the bin packing problem, but I am unable to find a good algorithm that accounts for the rotation. I found a paper that discusses this at length here and while I understand the article itself, I was hoping to find something simpler. Any suggestions? -Edit- I think I misstated the problem earlier. We are given a number of rectangles, such that each can be rotated by 90 degrees. We need to find a rectangle that fits all the given rectangles such that no two rectangles overlap, while minimizing the area of the enclosing rectangle. The problem I face here is that we are asked to find the minimum, as opposed to being given an enclosing rectangle and checking if the given rectangles fit or something of that sort.

  Read the article

• Given a string of red and blue balls, find min number of swaps to club the colors together

  - by efficiencyIsBliss

  We are given a string of the form: RBBR, where R - red and B - blue. We need to find the minimum number of swaps required in order to club the colors together. In the above case that answer would be 1 to get RRBB or BBRR. I feel like an algorithm to sort a partially sorted array would be useful here since a simple sort would give us the number of swaps, but we want the minimum number of swaps. Any ideas? This is allegedly a Microsoft interview question according to this.

  Read the article

1