Data Structure
 Networking
 RDBMS
 Operating System
 Java
 MS Excel
 iOS
 HTML
 CSS
 Android
 Python
 C Programming
 C++
 C#
 MongoDB
 MySQL
 Javascript
 PHP
- Selected Reading
 - UPSC IAS Exams Notes
 - Developer's Best Practices
 - Questions and Answers
 - Effective Resume Writing
 - HR Interview Questions
 - Computer Glossary
 - Who is Who
 
Programming Articles - Page 977 of 3366
 
			
			1K+ Views
To create a RangeIndex, use the pandas.RangeIndex() method in Pandas. At first, import the required libraries −import pandas as pdRangeIndex is a memory-saving special case of Int64Index limited to representing monotonic ranges. Using RangeIndex may in some instances improve computing speed.Create a range index with start, stop and step. The name is the name to be stored in the index −index = pd.RangeIndex(start=10, stop=30, step=2, name="data") Display the start parameter value −print("RangeIndex start value...", index.start)Display the stop parameter value −print("RangeIndex stop value...", index.stop) Display the step parameter value −print("RangeIndex step value...", index.step)ExampleFollowing is the code −import pandas as pd ... Read More
 
			
			118 Views
To compute slice locations for input labels, use the index.slice_locs() method. At first, import the required libraries −import pandas as pdCreate Pandas index object −index = pd.Index(list('pqrstuvwxyz')) Display the Pandas index −print("Pandas Index...", index)Get the slice locations. The "start" is the label to begin with. The "end" is the label to end withprint("The slice locations with start and stop...", index.slice_locs(start='q', end='v')) ExampleFollowing is the code −import pandas as pd # Create Pandas index object index = pd.Index(list('pqrstuvwxyz')) # Display the Pandas index print("Pandas Index...", index) # Return the number of elements in the Index print("Number of elements ... Read More
 
			
			208 Views
To compute the slice indexer for input labels, use the index.slice_indexer() method. At first, import the required libraries −import pandas as pdCreate Pandas index object −index = pd.Index(list('pqrstuvwxyz')) Display the Pandas index −print("Pandas Index...", index)Get the slice indexer. The "start" is the label to begin with. The "end" is the label to end with −print("The slice indexer with start and stop...", index.slice_indexer(start='s', end='w')) ExampleFollowing is the code −import pandas as pd # create Pandas index object index = pd.Index(list('pqrstuvwxyz')) # Display the Pandas index print("Pandas Index...", index) # Return the number of elements in the Index print("Number ... Read More
 
			
			732 Views
Suppose we have two lowercase strings s and t, they are of the same length. We can select one character from s and another from t and swap them. We can do this operation any number of times we want. Finally, we have to check whether it's possible to make the two strings same or not.So, if the input is like s = "abcd" t = "cdab", then the output will be TrueTo solve this, we will follow these steps −fre := a list containing frequencies of each elements present in concatenated string of s and tfor each cnt in ... Read More
 
			
			630 Views
Suppose we have a list of numbers called nums and the elements in nums are sorted in ascending order. We also have another value k, we have to check whether any two elements taken from the list add up to k or not. The numbers can also be negative or 0. We have to solve this problem in constant amount of space usage.So, if the input is like nums = [-8, -3, 2, 7, 9] k = 4, then the output will be True, because if we take 7 and -3, then the sum is 7 + (-3) = 4, ... Read More
 
			
			739 Views
Suppose we have a list of numbers called nums and also have a target value, we have to find the sum of the largest pair of numbers in nums whose sum is at most (target-1).So, if the input is like nums = [8, 3, 4, 9, 2] target = 8, then the output will be 7, because the sum of the largest pair of numbers less than 8 is 4 + 3 = 7.To solve this, we will follow these steps −sort the list numsp1 := 0p2 := size of nums - 1m := -infwhile p1 < p2, doif nums[p1] ... Read More
 
			
			129 Views
Suppose we want to make a data structure that has two methods −add(val) this adds the value val to the data structurefind(val) this checks whether there are two elements whose sum is val or notWe have to design this so that we can get the result on the fly. We will not search for numbers every time when a query comes.So, if the input is like create an object obj and add few numbers 6, 14, 3, 8, 11, 15, then check like obj.find(9), obj.find(11), obj.find(15), then the output will be True, True, False as 9 can be formed with ... Read More
 
			
			192 Views
Suppose we have two strings s and t. We want to form t, but there are some problems in the keyboard where some of characters stuck so they may be written 1 or more times. We have to check whether it's possible that typed s was meant to write t or not.So, if the input is like s = "appppleee" t = "apple", then the output will be True.To solve this, we will follow these steps −i := 0, j := 0s_len := size of st_len := size of tt_last := blank stringwhile j < t_len, doif i is same ... Read More
 
			
			833 Views
Suppose we have a list of numbers called nums. We have to check whether the list alternates starting from strictly increasing then strictly decreasing and then strictly increasing and so on. And also if the list is only strictly increasing, it will be valid.So, if the input is like nums = [2, 4, 8, 7, 5, 1, 5, 7, 2, 1], then the output will be True, because [2, 4, 8] are increasing, then [7, 5, 1] is decreasing, then again [5, 7] is increasing and [2, 1] is decreasing.To solve this, we will follow these steps −if nums[1] = ... Read More
 
			
			705 Views
Suppose we have a list of numbers called nums, where elements are sorted in ascending order, we have to square the elements and return the result in sorted order.So, if the input is like nums = [-8, -3, 0, 5, 6], then the output will be [0, 9, 25, 36, 64]To solve this, we will follow these steps −n := size of numsl := 0r := n - 1index := n - 1res := a list of size same as nums and fill it with 0while index >= 0, doif |nums[l]| > |nums[r]|, thenres[index] := nums[l] * nums[l]l := l ... Read More