worksheet function – Excel If-Else formula to capture ”hour” and “min” across an excel row

I have a row of “h min” values (eg:2h 15min) across a row. I need to capture the ‘hour’ and ‘min’ separately for which I’m using “=LEFT(B2,(FIND(” “,B2,1)-1))” and “=MID(B2,FIND(” “,B2)+1,256)” in separate cells, using the space separator to identify them seperately.

The problem is when there is only either one value, i.e. only hour or only minute (eg. “2h” or “20min”) in which case I get an error. How should I re-code both my LEFT and MID formula to ensure it still captures the hour/minute where it’s present and gives a blank where it’s not present.

Many thanks.

Ubuntu Boot time is approximately 2 min 30 sec against Win10 is ~10 sec in Dell G3 3500

My Laptop is Dell G3 3500 with i5 10th Gen with 120Hz display. Ram is 8 GB with 256GB SSD + 1TB HDD memory. Boot time for pre-installed Windows 10 Home (in SSD) is ~ 10 seconds. I dual boot my laptop with Ubuntu 20.04 Focal Release LTS (in HDD) and bootime is 4sec (kernel) + 2min 24sec (userspace).

How do I reduce the boot time? click here for the image of the terminal status. I’m not sure how to configure. Kindly guide.

OneBorn – 5 + (min 3)

🔥🔥5 tokens to be earned for: 🔥🔥
1️⃣ Join a group by telegram.
2️⃣ Join a channel –

Tron Link wallet TRC20 token
1Born 1000 TRx
5 Born Token for registration.
1 Born Token per referral
You need at least 3 referrals to get your Born token in your wallet immediately

REFERRAL LINK: https://t.me/Born_AirdropBot?start=r0836382158
clean – https://t.me/Born_AirdropBot?

February 3 will be over

I just got Born for registration and 3 referrals

there is still…

Read more

r – How do I find specific max and min coordinates of local authority within UK?

I’m currently plotting a heatmap of tax incomes by local authority within the UK. However, I want to focus on one specific local authority, for example Edinburgh.

I want to find the max and min coordinates for Edinburgh so I can narrow it down and have a zoomed in view of Edinburgh on its own without seeing the rest of UK map. Online, for the map found on Open GeoPortal Stats, when looking at edinburgh it only gives one value for longitude and latitude but I need two values for each.

I am currently using xlim and ylim within R for this.

ggplot (data = map_data, aes(x=long, y=lat, group=group))+
  geom_polygon(aes(fill=map_data$group))+
  coord_equal(xlim=-3.27826, ylim=55.91119))+
  theme(legend.position = "none")

How would I find the other max and min coordinates within the dataframe required for Edinburgh? As there 5mill observations, or is there a better way to do it than using xlim and ylim?

Any help would be great.

query – Min function returning too many rows

Apologies in advance if I am asking in the wrong forum.

I am trying to get the first attribute value for each ID in my table based on the ID’s starting week. When using the min() function on weekkey, my query is returning two values if an ID has more than one attribute.


Drop table if Exists table1

CREATE TABLE table1 (
IDNumber INT NOT NULL,
Attribute VARCHAR(30) NOT NULL,
WeekKey INT NOT NULL,
);

INSERT INTO table1
(IDNumber, Attribute, WeekKey)
VALUES
(1,’a’,1),
(1,’a’,2),
(1,’b’,3),
(2,’c’,1),
(3,’a’,1),
(3,’c’,2);

Select IDNumber, Attribute, Min(WeekKey) StartWeek
From Table1
Group by IDNumber, Attribute
Order by IDNumber, Attribute


My goal output would be:

1a1,
2c1,
3a1

My current output is:
1a1,
1b3,
2c1,
3a1,
3c2

Does anyone have an idea how to accomplish my goal without too many extra steps?

Thanks,
Taylor

algorithm – Calculate min number of moves (no path involved)

I’m looking to implement an algorithm that will calculate the minimum number of moves based on the rules below.

Let’s say that we have a grid (NxM), as exampled in the image below.

enter image description here

Each cell will be the sum based on the row and column and I can subtract 1 unit from one cell and add it to a neighbour. For example, on the image above, the minimum number of moves on Initial will be 2 and on Initial – 2 will be 4.

search algorithms – How to find the alphabetically min and max of substrings that begin with [a, b, c, d, e] and end with [h, i, j, k, l, n]

Find the last occurence of any h, i, j, k, l, n. If none is found, there is no solution. If the last one is found at position r, then the string we are looking for must start at position before r.

Then you start from the left looking for the first letter among a, b, c, d, e. If you don’t find one before position r then there is no solution. Otherwise call this index l; the first string in the alphabet might start at index l.

Look further for more characters starting with a to e. If you find one at position l’, you then find the first difference between the string starting at l and l’, up to and including position r. If there is a different character, and the first character in the string starting at l’ is earlier in the alphabet, replace l with l’.

Finally, the first string in the alphabet is the one starting at position l, and up to and including the first letter in ‘h’ to ‘n’.

algorithm analysis – How to find mean ,max ,min in constant time?

If you are just given an array and asked to find these statistic there there is no way to do that (unless the size of the array is upper bounded by a constant). An easy way to convince yourself that this is true is noticing that in $O(1)$ time you can only access $O(1)$ entries of the array. Then the maximum, minimum, or median could be in the unread entries (notice that you can safely assume that any $O(1)$-time algorithm always accesses the returned entry).

You talk about “insert operations” which makes me thing that you were actually asked to design a data structure that supports some set of operations, among which there are insertions and reporting the above statistics. If this is the case then the answer depends on how what the other operations are and how much time do you want to spend on those.

If the only updates to the array are insertion then it suffices to keep track of the number of elements, their sum, and the maximum and minimum element after each insertion. This will require $O(1)$ time per insertion and $O(1)$ time to report the statistics.

FotoKiz.com – $13/1000 – Instant Payouts – Min $2 – Fast Support | Proxies-free

Make Money with FotoKiz.com

Earn up to $13 per 1000 Views.
Worldwide traffic is acceptable.
Minimum payout only $2.
Earn 5% of money earned by each user you refer.
100% accurate rates without any cheating or shaving.
Only adult content is allowed.
Any image size qualify to make money.
Any type of legal content allowed.
INSTANT PAYOUTS ONLY 24 HOURS!
Payouts are processed using WebmoneyZ, Paypal
Detailed statistics of your earnings.
Support https protocol.
Maximum Upload file Size is 20MB.

Conditions:

– All Rates are per 1000 unique views.

Only 1 view from 1 IP will be counted per 24 hours.

Ad-blocked visit will not be counted.

Child pornography is strictly prohibited. Your account will be permanently banned and you will not get any payout. We will also cooperate with any law enforcement.

Any manipulation by using bots, auto-hits/surfers or proxies to gain money, Account will be permanently banned, without being able to get previously earned money.

All affiliates must agree to our Terms of Service and Privacy Policy.

FotoKiz.com reserve the right to modify our affiliate program at any time without prior notice.