Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.Negative Indexation | Strings
Data Types in Python
course content

Course Content

Data Types in Python

Data Types in Python

1. Getting Familiar With Numbers in Python
Numerical Data Type in GeneralMutable or Immutable?Integer NumbersCompulsory MathComplicated MathChallenge: Time CalculationHow to Define a Type
2. True or False?
Introduction to Boolean Data TypeChallenge: Comparison OperatorsAnd, Or, Not OperatorsChallenge: Boosting Logical SkillsChallenge: The Not StatementChallenge: Logical StatementsPriorities
3. Strings
Print Your StringQuotation MarksGet Acquainted With IndexationSlice the WordNegative IndexationSlice the PhraseSlicing TaskHow to Find the String LengthGet the Index of the SymbolFind the Word IndexChallenge: Slicing with Index FunctionIs String Mutable?Merge Strings
4. Bring All the Topics Together
Convert TypesUseful ConvertingConverting: float()Converting: bool()Converting: str()Math in StringsCompare Strings

bookNegative Indexation

In the preceding chapter, it appeared that we were counting letters to determine the index corresponding to each letter. If we intend to access the final symbol, manual counting may seem cumbersome.

Python, however, is considerate and anticipates our needs. Consequently, it introduced negative indexing. To obtain the last character of a word, it is advisable to utilize the syntax word[-1].

Note

The negative indexation starts from -1, then -2, etc. word[-0] is the same as word[0] for Python.

A small piece of advice: We can mentally divide a string into two parts and use positive indexation for the left-hand part and negative indexation for the right-hand part, but it's always up to us.😏

Task
test

Swipe to show code editor

Achieve the following symbols a, g, e using negative indexation.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 3. Chapter 5
toggle bottom row

bookNegative Indexation

In the preceding chapter, it appeared that we were counting letters to determine the index corresponding to each letter. If we intend to access the final symbol, manual counting may seem cumbersome.

Python, however, is considerate and anticipates our needs. Consequently, it introduced negative indexing. To obtain the last character of a word, it is advisable to utilize the syntax word[-1].

Note

The negative indexation starts from -1, then -2, etc. word[-0] is the same as word[0] for Python.

A small piece of advice: We can mentally divide a string into two parts and use positive indexation for the left-hand part and negative indexation for the right-hand part, but it's always up to us.😏

Task
test

Swipe to show code editor

Achieve the following symbols a, g, e using negative indexation.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 3. Chapter 5
toggle bottom row

bookNegative Indexation

In the preceding chapter, it appeared that we were counting letters to determine the index corresponding to each letter. If we intend to access the final symbol, manual counting may seem cumbersome.

Python, however, is considerate and anticipates our needs. Consequently, it introduced negative indexing. To obtain the last character of a word, it is advisable to utilize the syntax word[-1].

Note

The negative indexation starts from -1, then -2, etc. word[-0] is the same as word[0] for Python.

A small piece of advice: We can mentally divide a string into two parts and use positive indexation for the left-hand part and negative indexation for the right-hand part, but it's always up to us.😏

Task
test

Swipe to show code editor

Achieve the following symbols a, g, e using negative indexation.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

In the preceding chapter, it appeared that we were counting letters to determine the index corresponding to each letter. If we intend to access the final symbol, manual counting may seem cumbersome.

Python, however, is considerate and anticipates our needs. Consequently, it introduced negative indexing. To obtain the last character of a word, it is advisable to utilize the syntax word[-1].

Note

The negative indexation starts from -1, then -2, etc. word[-0] is the same as word[0] for Python.

A small piece of advice: We can mentally divide a string into two parts and use positive indexation for the left-hand part and negative indexation for the right-hand part, but it's always up to us.😏

Task
test

Swipe to show code editor

Achieve the following symbols a, g, e using negative indexation.

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Section 3. Chapter 5
Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
We're sorry to hear that something went wrong. What happened?
some-alt