workspace stringclasses 1
value | channel stringclasses 1
value | sentences stringlengths 1 3.93k | ts stringlengths 26 26 | user stringlengths 2 11 | sentence_id stringlengths 44 53 | timestamp float64 1.5B 1.56B | __index_level_0__ int64 0 106k |
|---|---|---|---|---|---|---|---|
pythondev | help | I can send the screenshot | 2019-02-14T16:14:58.692300 | Misha | pythondev_help_Misha_2019-02-14T16:14:58.692300 | 1,550,160,898.6923 | 8,721 |
pythondev | help | if you're not sure of the formula for calculating standard deviation it's not to hard to learn by googling | 2019-02-14T16:16:05.693200 | Claudine | pythondev_help_Claudine_2019-02-14T16:16:05.693200 | 1,550,160,965.6932 | 8,722 |
pythondev | help | This is just my 3wks into to the learning | 2019-02-14T16:16:20.693700 | Misha | pythondev_help_Misha_2019-02-14T16:16:20.693700 | 1,550,160,980.6937 | 8,723 |
pythondev | help | you can search for how to do it in python specifically, but it'd be worth understanding the math behind it | 2019-02-14T16:16:23.694000 | Claudine | pythondev_help_Claudine_2019-02-14T16:16:23.694000 | 1,550,160,983.694 | 8,724 |
pythondev | help | And I joined a group for fun | 2019-02-14T16:16:54.694700 | Misha | pythondev_help_Misha_2019-02-14T16:16:54.694700 | 1,550,161,014.6947 | 8,725 |
pythondev | help | and picked up a work from them to start solving | 2019-02-14T16:17:12.695200 | Misha | pythondev_help_Misha_2019-02-14T16:17:12.695200 | 1,550,161,032.6952 | 8,726 |
pythondev | help | I also googled out group to join to learn more | 2019-02-14T16:17:34.695700 | Misha | pythondev_help_Misha_2019-02-14T16:17:34.695700 | 1,550,161,054.6957 | 8,727 |
pythondev | help | sometimes reading and watching thousands of materials and tuts without hands on is wasting of time | 2019-02-14T16:18:14.696900 | Misha | pythondev_help_Misha_2019-02-14T16:18:14.696900 | 1,550,161,094.6969 | 8,728 |
pythondev | help | i'm NOT just using this group to solve my lesson but bringing errors that i encountered | 2019-02-14T16:19:12.697900 | Misha | pythondev_help_Misha_2019-02-14T16:19:12.697900 | 1,550,161,152.6979 | 8,729 |
pythondev | help | Thanks <@Claudine> | 2019-02-14T16:19:19.698100 | Misha | pythondev_help_Misha_2019-02-14T16:19:19.698100 | 1,550,161,159.6981 | 8,730 |
pythondev | help | I'm new to Python but not as a developer. Here, I'm using a library to create an aws `cloudformation` stack. I want to replace the `eks_cluster_name` for the `ClusterName`. Apparently, I can't because the data types are different. | 2019-02-14T16:19:57.698900 | Carlota | pythondev_help_Carlota_2019-02-14T16:19:57.698900 | 1,550,161,197.6989 | 8,731 |
pythondev | help | no problem, you could also check out the python module `numpy` which had built in methods for calulcating standard deviation along a specific axis | 2019-02-14T16:20:02.699300 | Claudine | pythondev_help_Claudine_2019-02-14T16:20:02.699300 | 1,550,161,202.6993 | 8,732 |
pythondev | help | it's been awhile since i've done any statistical work so I'm not sure myself off the top of my head | 2019-02-14T16:20:22.699900 | Claudine | pythondev_help_Claudine_2019-02-14T16:20:22.699900 | 1,550,161,222.6999 | 8,733 |
pythondev | help | `numpy` might be a little unwiedly if you're new to python, it was for me when i started | 2019-02-14T16:20:46.700400 | Claudine | pythondev_help_Claudine_2019-02-14T16:20:46.700400 | 1,550,161,246.7004 | 8,734 |
pythondev | help | <@Carlota> do you know the expected data type and what the data type of `eks_cluster_name` are? | 2019-02-14T16:21:37.700900 | Claudine | pythondev_help_Claudine_2019-02-14T16:21:37.700900 | 1,550,161,297.7009 | 8,735 |
pythondev | help | `round(float(mywork.groupby('TermDays').std().iloc[4,1]), 2)` | 2019-02-14T16:22:31.701400 | Misha | pythondev_help_Misha_2019-02-14T16:22:31.701400 | 1,550,161,351.7014 | 8,736 |
pythondev | help | I tried this and it worked | 2019-02-14T16:22:50.701900 | Misha | pythondev_help_Misha_2019-02-14T16:22:50.701900 | 1,550,161,370.7019 | 8,737 |
pythondev | help | <@Claudine> the data type for the ``` eks_cluster_name = ImportValue(Sub('${VPCStackName}::EKSClusterName'))
```
the response is a string while it is substituting some of the parameters. For example, the `${BootstrapArguments}` will be replaced with the parameters passed in the stack. | 2019-02-14T16:24:30.704600 | Carlota | pythondev_help_Carlota_2019-02-14T16:24:30.704600 | 1,550,161,470.7046 | 8,738 |
pythondev | help | <@Misha> when it comes to homework questions, you’ll get much better responses when you show what you’ve done and ask a question, or describe your current understanding and what you’re unsure about | 2019-02-14T16:25:02.705400 | Hiroko | pythondev_help_Hiroko_2019-02-14T16:25:02.705400 | 1,550,161,502.7054 | 8,739 |
pythondev | help | rather than asking “how do I solve this problem” | 2019-02-14T16:25:11.705700 | Hiroko | pythondev_help_Hiroko_2019-02-14T16:25:11.705700 | 1,550,161,511.7057 | 8,740 |
pythondev | help | it may very well be a language barrier, and you didn’t mean it that way. but that is a little how you did come across. | 2019-02-14T16:25:49.706800 | Hiroko | pythondev_help_Hiroko_2019-02-14T16:25:49.706800 | 1,550,161,549.7068 | 8,741 |
pythondev | help | <@Carlota> oh i was curious if `print(type(eks_cluster_name)` was `str` | 2019-02-14T16:26:02.707400 | Claudine | pythondev_help_Claudine_2019-02-14T16:26:02.707400 | 1,550,161,562.7074 | 8,742 |
pythondev | help | and if my interpretation is incorrect, then I apologize | 2019-02-14T16:26:02.707500 | Hiroko | pythondev_help_Hiroko_2019-02-14T16:26:02.707500 | 1,550,161,562.7075 | 8,743 |
pythondev | help | oh, let me check | 2019-02-14T16:26:16.707700 | Carlota | pythondev_help_Carlota_2019-02-14T16:26:16.707700 | 1,550,161,576.7077 | 8,744 |
pythondev | help | I think 1 is for row and 4 for column | 2019-02-14T16:26:27.707900 | Misha | pythondev_help_Misha_2019-02-14T16:26:27.707900 | 1,550,161,587.7079 | 8,745 |
pythondev | help | yes <@Hiroko> | 2019-02-14T16:26:36.708200 | Misha | pythondev_help_Misha_2019-02-14T16:26:36.708200 | 1,550,161,596.7082 | 8,746 |
pythondev | help | I'm a working professional (12yrs in media production) and running a small tech startup | 2019-02-14T16:27:17.709000 | Misha | pythondev_help_Misha_2019-02-14T16:27:17.709000 | 1,550,161,637.709 | 8,747 |
pythondev | help | And I just think it will be of good benefit to dive into Data Science and I just started 3wks ago | 2019-02-14T16:28:42.710700 | Misha | pythondev_help_Misha_2019-02-14T16:28:42.710700 | 1,550,161,722.7107 | 8,748 |
pythondev | help | And I pick up a lesson note online by myself to start solving | 2019-02-14T16:29:34.712000 | Misha | pythondev_help_Misha_2019-02-14T16:29:34.712000 | 1,550,161,774.712 | 8,749 |
pythondev | help | now i'm encoutering some prob and i need human being to explain something to me...lol:grinning: | 2019-02-14T16:30:13.712900 | Misha | pythondev_help_Misha_2019-02-14T16:30:13.712900 | 1,550,161,813.7129 | 8,750 |
pythondev | help | Nevertheless thanks for the advise <@Hiroko> | 2019-02-14T16:33:14.714900 | Misha | pythondev_help_Misha_2019-02-14T16:33:14.714900 | 1,550,161,994.7149 | 8,751 |
pythondev | help | <@Claudine>
```
print(type(eks_cluster_name))
<class 'troposphere.ImportValue'>
``` | 2019-02-14T16:34:39.716500 | Carlota | pythondev_help_Carlota_2019-02-14T16:34:39.716500 | 1,550,162,079.7165 | 8,752 |
pythondev | help | newbie question but im iterating over a string and trying to compare a character in the string to its next character | 2019-02-14T16:40:30.720900 | Marc | pythondev_help_Marc_2019-02-14T16:40:30.720900 | 1,550,162,430.7209 | 8,753 |
pythondev | help | and im using index + 1 but im getting out of range? | 2019-02-14T16:40:36.721100 | Marc | pythondev_help_Marc_2019-02-14T16:40:36.721100 | 1,550,162,436.7211 | 8,754 |
pythondev | help | None | 2019-02-14T16:40:55.721200 | Marc | pythondev_help_Marc_2019-02-14T16:40:55.721200 | 1,550,162,455.7212 | 8,755 |
pythondev | help | <@Marc> that'll happen on your last iteration because `s[ind]` will be grabbing your last value, so `s[ind + 1]` will be out of range. You need to check for that before trying to access `s[ind + 1]` | 2019-02-14T16:43:13.724300 | Cherish | pythondev_help_Cherish_2019-02-14T16:43:13.724300 | 1,550,162,593.7243 | 8,756 |
pythondev | help | My lesson 5
*Late* loans are defined as loans that were paid *more than 3 days* after their due date. Please find the average number of days that these loans were paid beyond their due date for each *week of the year*. This will require you to break all *appilcationDate's* down into the week of the year they were made... | 2019-02-14T16:43:33.724600 | Misha | pythondev_help_Misha_2019-02-14T16:43:33.724600 | 1,550,162,613.7246 | 8,757 |
pythondev | help | <@Cherish> - what do you mean it will be grabbing my last value? You mean it doesn't know it's the end of the index when I enumerate? I have to tell it that there's only x indexes in the string? | 2019-02-14T16:44:14.725700 | Marc | pythondev_help_Marc_2019-02-14T16:44:14.725700 | 1,550,162,654.7257 | 8,758 |
pythondev | help | <@Marc> it does, but then you ask it to go one further than the end | 2019-02-14T16:44:47.726500 | Ashley | pythondev_help_Ashley_2019-02-14T16:44:47.726500 | 1,550,162,687.7265 | 8,759 |
pythondev | help | Yes, if there's X elements in `s`, ie the length of `s`, then on the last iteration of your loop, `ind` will be equal to X, and `ind + 1` will be > X | 2019-02-14T16:45:30.727400 | Cherish | pythondev_help_Cherish_2019-02-14T16:45:30.727400 | 1,550,162,730.7274 | 8,760 |
pythondev | help | Which will throw you an out of range error | 2019-02-14T16:45:46.728000 | Cherish | pythondev_help_Cherish_2019-02-14T16:45:46.728000 | 1,550,162,746.728 | 8,761 |
pythondev | help | so something like | 2019-02-14T16:46:20.728500 | Marc | pythondev_help_Marc_2019-02-14T16:46:20.728500 | 1,550,162,780.7285 | 8,762 |
pythondev | help | <@Marc> try this and you'll see how many times it actually goes through the loop. What is inside the loop is irrelevant to how it loops | 2019-02-14T16:46:34.728600 | Ashley | pythondev_help_Ashley_2019-02-14T16:46:34.728600 | 1,550,162,794.7286 | 8,763 |
pythondev | help | None | 2019-02-14T16:46:42.728900 | Marc | pythondev_help_Marc_2019-02-14T16:46:42.728900 | 1,550,162,802.7289 | 8,764 |
pythondev | help | more or less | 2019-02-14T16:47:00.729600 | Ashley | pythondev_help_Ashley_2019-02-14T16:47:00.729600 | 1,550,162,820.7296 | 8,765 |
pythondev | help | yeah it iterates however many times the length of my string is | 2019-02-14T16:47:06.730100 | Marc | pythondev_help_Marc_2019-02-14T16:47:06.730100 | 1,550,162,826.7301 | 8,766 |
pythondev | help | you can just call `continue` in that case | 2019-02-14T16:47:10.730200 | Ashley | pythondev_help_Ashley_2019-02-14T16:47:10.730200 | 1,550,162,830.7302 | 8,767 |
pythondev | help | there's a simpler way though | 2019-02-14T16:47:21.730600 | Ashley | pythondev_help_Ashley_2019-02-14T16:47:21.730600 | 1,550,162,841.7306 | 8,768 |
pythondev | help | Yeah basically that. There's multiple ways you can accomplish it, but what you have captures the premise of what you need to do | 2019-02-14T16:47:59.731300 | Cherish | pythondev_help_Cherish_2019-02-14T16:47:59.731300 | 1,550,162,879.7313 | 8,769 |
pythondev | help | okay | 2019-02-14T16:48:24.731600 | Marc | pythondev_help_Marc_2019-02-14T16:48:24.731600 | 1,550,162,904.7316 | 8,770 |
pythondev | help | It's a bit demoralizing when leetcode problems are tagged as easy and I struggle with them :stuck_out_tongue: | 2019-02-14T16:48:46.732400 | Marc | pythondev_help_Marc_2019-02-14T16:48:46.732400 | 1,550,162,926.7324 | 8,771 |
pythondev | help | if it's hard, that just means you get to learn :wink: | 2019-02-14T16:49:13.732900 | Ashley | pythondev_help_Ashley_2019-02-14T16:49:13.732900 | 1,550,162,953.7329 | 8,772 |
pythondev | help | <@Ashley> - what would you say the easier way is? | 2019-02-14T16:49:20.733200 | Marc | pythondev_help_Marc_2019-02-14T16:49:20.733200 | 1,550,162,960.7332 | 8,773 |
pythondev | help | maybe not easier depending on your perspective, but to get you thinking about lists and iterating, here's a fancy approach | 2019-02-14T16:51:24.734100 | Ashley | pythondev_help_Ashley_2019-02-14T16:51:24.734100 | 1,550,163,084.7341 | 8,774 |
pythondev | help | oh god | 2019-02-14T16:51:38.734500 | Marc | pythondev_help_Marc_2019-02-14T16:51:38.734500 | 1,550,163,098.7345 | 8,775 |
pythondev | help | lol | 2019-02-14T16:51:40.734800 | Marc | pythondev_help_Marc_2019-02-14T16:51:40.734800 | 1,550,163,100.7348 | 8,776 |
pythondev | help | zip | 2019-02-14T16:51:43.735000 | Marc | pythondev_help_Marc_2019-02-14T16:51:43.735000 | 1,550,163,103.735 | 8,777 |
pythondev | help | zip is actually pretty straightforward | 2019-02-14T16:51:55.735200 | Ashley | pythondev_help_Ashley_2019-02-14T16:51:55.735200 | 1,550,163,115.7352 | 8,778 |
pythondev | help | try printing out `s[:-1]` and then `s[1:]` to see what they are individually | 2019-02-14T16:52:21.735700 | Ashley | pythondev_help_Ashley_2019-02-14T16:52:21.735700 | 1,550,163,141.7357 | 8,779 |
pythondev | help | then print out the zip of them | 2019-02-14T16:52:27.736000 | Ashley | pythondev_help_Ashley_2019-02-14T16:52:27.736000 | 1,550,163,147.736 | 8,780 |
pythondev | help | (hint: "zipper") | 2019-02-14T16:52:47.736200 | Ashley | pythondev_help_Ashley_2019-02-14T16:52:47.736200 | 1,550,163,167.7362 | 8,781 |
pythondev | help | understood | 2019-02-14T16:54:13.736500 | Marc | pythondev_help_Marc_2019-02-14T16:54:13.736500 | 1,550,163,253.7365 | 8,782 |
pythondev | help | None | 2019-02-14T16:54:30.736600 | Marc | pythondev_help_Marc_2019-02-14T16:54:30.736600 | 1,550,163,270.7366 | 8,783 |
pythondev | help | None | 2019-02-14T16:55:08.736900 | Marc | pythondev_help_Marc_2019-02-14T16:55:08.736900 | 1,550,163,308.7369 | 8,784 |
pythondev | help | ahhh yes | 2019-02-14T17:02:04.737700 | Ashley | pythondev_help_Ashley_2019-02-14T17:02:04.737700 | 1,550,163,724.7377 | 8,785 |
pythondev | help | that's a little more tricky | 2019-02-14T17:02:24.737900 | Ashley | pythondev_help_Ashley_2019-02-14T17:02:24.737900 | 1,550,163,744.7379 | 8,786 |
pythondev | help | but actually easier to solve | 2019-02-14T17:02:30.738100 | Ashley | pythondev_help_Ashley_2019-02-14T17:02:30.738100 | 1,550,163,750.7381 | 8,787 |
pythondev | help | <@Marc> I showed you iterable slicing by passing two indexes, e.g. `s[:-1]`. But there's a third possible index you can pass :wink: | 2019-02-14T17:13:40.739900 | Ashley | pythondev_help_Ashley_2019-02-14T17:13:40.739900 | 1,550,164,420.7399 | 8,788 |
pythondev | help | direction, right? | 2019-02-14T17:14:18.740100 | Marc | pythondev_help_Marc_2019-02-14T17:14:18.740100 | 1,550,164,458.7401 | 8,789 |
pythondev | help | ::-1 | 2019-02-14T17:14:19.740300 | Marc | pythondev_help_Marc_2019-02-14T17:14:19.740300 | 1,550,164,459.7403 | 8,790 |
pythondev | help | almost | 2019-02-14T17:14:55.740500 | Ashley | pythondev_help_Ashley_2019-02-14T17:14:55.740500 | 1,550,164,495.7405 | 8,791 |
pythondev | help | "Step" | 2019-02-14T17:15:11.740700 | Ashley | pythondev_help_Ashley_2019-02-14T17:15:11.740700 | 1,550,164,511.7407 | 8,792 |
pythondev | help | `[::-1]` means "step by every negative one indexes" | 2019-02-14T17:15:42.741100 | Ashley | pythondev_help_Ashley_2019-02-14T17:15:42.741100 | 1,550,164,542.7411 | 8,793 |
pythondev | help | yeah thats what i meant :slightly_smiling_face: | 2019-02-14T17:16:17.741500 | Marc | pythondev_help_Marc_2019-02-14T17:16:17.741500 | 1,550,164,577.7415 | 8,794 |
pythondev | help | doesn't have to be negative, though :wink: | 2019-02-14T17:16:25.741900 | Ashley | pythondev_help_Ashley_2019-02-14T17:16:25.741900 | 1,550,164,585.7419 | 8,795 |
pythondev | help | i used that to solve the palindrome question earlier | 2019-02-14T17:16:30.742200 | Marc | pythondev_help_Marc_2019-02-14T17:16:30.742200 | 1,550,164,590.7422 | 8,796 |
pythondev | help | my code for this leetcode problem so far is a bunch of nested if statemens | 2019-02-14T17:16:52.742900 | Marc | pythondev_help_Marc_2019-02-14T17:16:52.742900 | 1,550,164,612.7429 | 8,797 |
pythondev | help | `Late['dateDifference'] = Late['dateDifference'].dt.days`
`Late` | 2019-02-14T17:16:53.743100 | Misha | pythondev_help_Misha_2019-02-14T17:16:53.743100 | 1,550,164,613.7431 | 8,798 |
pythondev | help | and im sure theres a better way than that | 2019-02-14T17:16:58.743300 | Marc | pythondev_help_Marc_2019-02-14T17:16:58.743300 | 1,550,164,618.7433 | 8,799 |
pythondev | help | it also doesn't have to be `1` | 2019-02-14T17:17:18.743500 | Ashley | pythondev_help_Ashley_2019-02-14T17:17:18.743500 | 1,550,164,638.7435 | 8,800 |
pythondev | help | None | 2019-02-14T17:17:57.743600 | Misha | pythondev_help_Misha_2019-02-14T17:17:57.743600 | 1,550,164,677.7436 | 8,801 |
pythondev | help | Yeah you can step by by 2's | 2019-02-14T17:18:10.744100 | Marc | pythondev_help_Marc_2019-02-14T17:18:10.744100 | 1,550,164,690.7441 | 8,802 |
pythondev | help | `Late['dateDifference'] = Late['dateDifference'].dt.days`
`Late` | 2019-02-14T17:18:16.744200 | Misha | pythondev_help_Misha_2019-02-14T17:18:16.744200 | 1,550,164,696.7442 | 8,803 |
pythondev | help | And I got the above errors | 2019-02-14T17:18:25.744500 | Misha | pythondev_help_Misha_2019-02-14T17:18:25.744500 | 1,550,164,705.7445 | 8,804 |
pythondev | help | is dateDifference a datetime value or a string? | 2019-02-14T17:18:44.744800 | Marc | pythondev_help_Marc_2019-02-14T17:18:44.744800 | 1,550,164,724.7448 | 8,805 |
pythondev | help | print(type(dateDifference)) | 2019-02-14T17:19:01.745200 | Marc | pythondev_help_Marc_2019-02-14T17:19:01.745200 | 1,550,164,741.7452 | 8,806 |
pythondev | help | fyi pepi 8 says you shoudnt use snakeCase variable names | 2019-02-14T17:20:23.745600 | Marc | pythondev_help_Marc_2019-02-14T17:20:23.745600 | 1,550,164,823.7456 | 8,807 |
pythondev | help | should be date_difference | 2019-02-14T17:20:28.745800 | Marc | pythondev_help_Marc_2019-02-14T17:20:28.745800 | 1,550,164,828.7458 | 8,808 |
pythondev | help | pop* | 2019-02-14T17:20:36.746000 | Marc | pythondev_help_Marc_2019-02-14T17:20:36.746000 | 1,550,164,836.746 | 8,809 |
pythondev | help | ugh pep* | 2019-02-14T17:20:44.746200 | Marc | pythondev_help_Marc_2019-02-14T17:20:44.746200 | 1,550,164,844.7462 | 8,810 |
pythondev | help | good to know <@Marc> re: snakeCase. Also...in case you didn't know, you should be able to press the up arrow on your keyboard to edit your last post. EDIT: SEE!! :slightly_smiling_face: | 2019-02-14T17:21:39.747300 | Marth | pythondev_help_Marth_2019-02-14T17:21:39.747300 | 1,550,164,899.7473 | 8,811 |
pythondev | help | snakeCase is usually used for Class names | 2019-02-14T17:22:08.748200 | Marc | pythondev_help_Marc_2019-02-14T17:22:08.748200 | 1,550,164,928.7482 | 8,812 |
pythondev | help | is a string (25 days) but I need to remove the (days) and leave only the value | 2019-02-14T17:22:11.748400 | Misha | pythondev_help_Misha_2019-02-14T17:22:11.748400 | 1,550,164,931.7484 | 8,813 |
pythondev | help | <@Misha> then that is why it's not working because you cant use .dt on strings | 2019-02-14T17:22:31.748900 | Marc | pythondev_help_Marc_2019-02-14T17:22:31.748900 | 1,550,164,951.7489 | 8,814 |
pythondev | help | hmmm | 2019-02-14T17:23:41.749100 | Misha | pythondev_help_Misha_2019-02-14T17:23:41.749100 | 1,550,165,021.7491 | 8,815 |
pythondev | help | pls how do go about it | 2019-02-14T17:23:48.749400 | Misha | pythondev_help_Misha_2019-02-14T17:23:48.749400 | 1,550,165,028.7494 | 8,816 |
pythondev | help | newbie in the room pls | 2019-02-14T17:23:57.749700 | Misha | pythondev_help_Misha_2019-02-14T17:23:57.749700 | 1,550,165,037.7497 | 8,817 |
pythondev | help | You're just trying to see if the values are equal? | 2019-02-14T17:24:10.749900 | Marc | pythondev_help_Marc_2019-02-14T17:24:10.749900 | 1,550,165,050.7499 | 8,818 |
pythondev | help | can you post the relevant block of code? | 2019-02-14T17:24:27.750200 | Marc | pythondev_help_Marc_2019-02-14T17:24:27.750200 | 1,550,165,067.7502 | 8,819 |
pythondev | help | or youre assigning the days to the dateDifference? | 2019-02-14T17:26:26.750600 | Marc | pythondev_help_Marc_2019-02-14T17:26:26.750600 | 1,550,165,186.7506 | 8,820 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.