04:26I will get the last element to the last element.
04:31The number of elements is 100.
04:36The last element is 100.
04:40So, I will get the length of 10.
04:42I will get 12 minus 1.
04:4412 minus 1 is equal to 11.
04:4712 is equal to len.
04:50So, I will get the length of STR1 minus 1.
04:54I will get the number of 11.
04:57The length of STR1 is equal to 12.
05:0012 minus 1 is equal to 11.
05:03So, if I contact STR11, command roll to N.
05:07so, the length of n is equal to alone to mode.
05:09And here, the length function beside p2.
05:11The length function is number one.
05:12So, I will have the length function we call��는 icon.
05:16Amazondag and send that number of 1.
05:18IfScholf3 is equal toиватьstat star on the left element by delay,
05:23is equal to the length of the resource function.
05:25That is to Jeunch's function into the middle sto1.
05:27So, this element is str5 and str of minus 7.
05:33There is a negative positive index.
05:39So, I use negative index and use positive index.
05:45So, I use positive index and negative index.
05:50So, I use str5 and string string.
05:58I use all the element that I use.
06:00So, I use space.
06:02And I use space.
06:04And that means I use str5 and str5.
06:09So, in Python, I use slicing.
06:12This is a part of string.
06:16I will see the part of string.
06:25I will take the slicing part and slice the part.
06:33I will take the slicing part of string.
06:37so here we are going to store this str1
06:41and here we are going to slice this one
06:47and here we are going to start index
06:54and here we are going to end index
06:58here the norm in the front field is going to start index
07:05so we will mark the variable index
07:12here are going to start index
07:18so here we are going to give you HOW?
07:22here the norm is breaking the index
07:26So, if I run this, I will say hello and 3.
07:34So, suppose, I will make slicing one option.
07:44I will start index, end index, step size.
07:56Step size is going to work this way.
08:05Who works this way?
08:07This is going to start index, 0.
08:13So, 0 is going to start index.
08:18So, this is going to work this way, and this is going to work this way.
08:25So, if I do this, I will start index.
08:27So, step size is going to be 1.
08:31So e g a n m a d t e, so first u n a m dho 0 index, so 0 index g a h b a n t e n a n a n e s t u jump m a d v e k a n a d t e 1 jump, that is 0 plus 1, that is 1, so plus 1 m a d t e, so e b a d t e, then mathe plus 1 m a d t e, mathe plus 1 m a d t e, mathe n a m a d t e up to 11th n k a plus 1 m a d t e,
08:56so 1 p, so 1, so 1, so 1, so 1, so 1, how about the 11th n k a, why about the 12th n k a n a n t e, 12 n k a n t e, so 1, about the 11th n k a s t, and then 3, that's why we can also get this, the slicing is gone, we can get this to step size, so now i run this to help python,
09:13Suppose, I have 2 step size. So 0th index is 3. That is h. Then I have plus 2. 0 plus 2 is 2.
09:282 plus 2 is 4. 2 plus 2 is 4. 4 is 4. 4 plus 2 is 6. 6 is P. 6 plus 2 is 8. 8 is T. 8 plus 2 is 10. 10 is 10.
09:54So h. L. PTO. How do I get to do it? We will end 12.
10:01I will end 12. But 12th I will get to do it. 12th I will get to do it. 12th I will get to do it. 12th element is access.
10:11That means I will get to do that value. So I will run this. H. L. PTO.
10:18I will get to do it. 12th I will get to do it. 12th I will get to do it.
10:25Suppose minus a negative.
10:28In this case, I will start with the first step size.
10:31I will start with the first step size.
10:33I will start with the second step size.
10:35結果 pet duality.
10:36This is another step size.
10:43Now, first step size, this is0.
10:47This is 1th I will occur.
10:49Ceiled at n.
10:52Ceiled with …
10:5610-1 is 9. 9 is 8. So this is up to 0. So this is up to 0. So this is up to 1. So we have 3.
11:16So my output will be a reverse in the Hello Python.
11:26Now start of the start, end and step size.
11:32So I only need 3. So when the h is higher, then I need this technique.
11:39This technique will be used.
11:41I will start size and add step size.
11:47By default, step size will be plus 1.
11:57That is forward slicing.
11:59Start number is not small.
12:01That is the end.
12:03One is the end.
12:05This is the end and this is the end
12:07The start size will be 0.
12:11This is the forward moment.
12:13I will print here.
12:15By default, this is the first element.
12:19The last element is the end.
12:23We will print here.
12:27This is the end.
12:31Suppose,
12:33The end is the end.
12:35The end is the start index.
12:39The end is the end.
12:41The end is the end.
12:43Step size will be by default plus 1.
12:47The end is the end.
12:49The end is the end.
12:51The end is the end.
12:53This is the end is the end.
12:55The end is the front index.
12:57The end is the end.
12:59The end here, the end is in the end,
13:00The end is the end.
13:02The end is the end.
13:04seid select在 the end.
13:07加 hearts in yellow Python.
13:09Okay, I will show you the step size.
13:13I will show you the start index.
13:16By default, the start index is the same.
13:20This is the step size.
13:24So, for a moment, I will show you the start index.
13:29End index is the same.
13:30Then, I will show you the end.
13:32Okay, I will show you the end index.
13:35start YELL INDAS MADUVEYKU, E CORNER INDAS MADUVEYKU, E MOODLE INDAS MADUVEYKU
13:39SO IL-LINDA ILLLINDA VARUGU NAHIN MOADAW VARU gravelNAMGAWAG END BARATHETTE
13:44H E L L O SPACE BARATHETTE P BARATHT A BRALAやKE ALLE END MAADTHTA YED surtout END MAADITTE
13:52END MAADITTEI ELEMENTBARLaaaa. SO IDIANA NAN RUN MAADITTEI H E L L O MATTE SPACE BARATHETTE
Be the first to comment