range

I need to count the total number of rows that have data. I want to be able to use this on multiple sheets with different amounts of data rows. I cannot figure out generic code that will count the number of rows from A1-A100 or A1-A300. I am trying to use something like this. i = ActiveWorkbook.Worksheets("Sheet1").Range("A2 , Range("A2").End(xlDown)).Rows.Count If you need VBA, you could do something quick like this: Sub Test() With ActiveSheet lastRow = .Cells(.Rows.Count, "A").End(xlUp).Row MsgBox lastRow End With End Sub This will print the number of the last row with data in it. Obviously

I read that the range of an int is dependent on a byte. So taking int to be 4 bytes long, thats 4 * 8 bits = 32 bits. So the range should be : 2 ^ (32-1) = 2 ^ (31) Why do some people say its 2^31 - 1 though? Thanks! Because the counting starts from 0 And the range of int is 2,147,483,647 and 2^32 which is 2,147,483,648 . hence we subtract 1 Also the loss of 1 bit is for the positive and negative sign Check this interestinf wiki article on Integers:- The most common representation of a positive integer is a string of bits, using the binary numeral system. The order of the memory bytes storing

The following is a practice interview question that was given to me by someone, and I'm not sure what the best solution to this is: Given a set of ranges: (e.g. S = {(1, 4), (30, 40), (20, 91) ,(8, 10), (6, 7), (3, 9), (9, 12), (11, 14)} . And given a target range R (e.g. R = (3, 13) - meaning the range going from 3 to 13). Write an algorithm to find the smallest set of ranges that covers your target range. All of the ranges in the set must overlap in order to be considered as spanning the entire target range. (In this example, the answer would be {(3, 9), (9, 12), (11, 14)} . What is the best

Given an array of integers, what is the simplest way to iterate over it and figure out all the ranges it covers? for example, for an array such as: $numbers = array(1,3,4,5,6,8,11,12,14,15,16); The ranges would be: 1,3-6,8,11-12,14-16 If the array is sorted in ascending order, then the problem is easy. Define a Range structure or class, which has a beginning and an end. Then go through the array. If the current element is one more than the previous, update Range.end , otherwise create a new range with this element as Range.begin . Store the ranges to a dynamic array or a linked list. Or just

I have a contenteditable div <div id="divTest" contenteditable="true"> I need to get the last word from caret position and on certain condition I have to test and remove this specific word only. Below is how am I doing $('#divTest').on('keyup focus', function (e) { if (e.keyCode == 32) { var lastWord = getWordPrecedingCaret(this), spanLastWord = $('#lastWord'); } }); function getWordPrecedingCaret(containerEl) { var preceding = "", sel, range, precedingRange; if (window.getSelection) { sel = window.getSelection(); if (sel.rangeCount > 0) { range = sel.getRangeAt(0).cloneRange(); range.collapse

Let's say you have a set of ranges: 0 - 100: 'a' 0 - 75: 'b' 95 - 150: 'c' 120 - 130: 'd' Obviously, these ranges overlap at certain points. How would you dissect these ranges to produce a list of non-overlapping ranges, while retaining information associated with their original range (in this case, the letter after the range)? For example, the results of the above after running the algorithm would be: 0 - 75: 'a', 'b' 76 - 94: 'a' 95 - 100: 'a', 'c' 101 - 119: 'c' 120 - 130: 'c', 'd' 131 - 150: 'c' I had the same question when writing a program to mix (partly overlapping) audio samples. What