Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Economics & Finance
A set is a collection of unique elements. We can implement a custom set data structure without using Python's built-in set class by creating a class with basic set operations. Set Operations to Implement Our custom set class will support the following methods ? Constructor to create a new set instance add(val) to insert an integer into the set exists(val) to check if a value exists in the set remove(val) to remove a value from the set Implementation Approach We'll use a dictionary where each key represents a value and maps to a ... Read More
Suppose we have a number n, there are n number of people searching for a seat, we also have a list of bits where 1 represents an already occupied seat and 0 represents empty seat. No two people can sit next to each other, so we have to check whether all n people can find a seat or not. So, if the input is like n = 2 seats = [1, 0, 0, 0, 1, 0, 0], then the output will be True, because they can seat at index 2 and 6. Approach To solve this, we ... Read More
Run-length encoding compresses data by representing consecutive identical characters as a count followed by the character. This article implements an iterator class that decodes such strings character by character using next() and hasnext() methods. Problem Understanding Given a run-length encoded string like "2b1a", we need to create an iterator that can decode it step by step. The string "2b1a" represents "bba" (2 b's followed by 1 a). Iterator Methods next() − Returns the next character in the decoded sequence hasnext() − Checks if more characters are available Algorithm Steps The solution follows ... Read More
Suppose we have a binary string s, now let us consider an operation where we select a bit and flip its value from 0 to 1 or vice-versa. We have to find the minimum number of operations needed to get a string with no three identical consecutive bits. So, if the input is like s = "10011100", then the output will be 1, because we can flip 1 to 0 the bit at index 4 to make the string "10010100" where there are no three consecutive identical bits. Algorithm To solve this, we will follow these steps ... Read More
Rate limiting is a technique used to control the frequency of requests from users. We need to design a data structure that tracks user requests and determines if a new request should be allowed based on an expiration time window. The data structure should support checking whether a user's request fails based on their previous successful request. A request fails (returns True) only when the user had a successful request within the expire time window. Problem Understanding Given an expire time, we need to: Track the last successful request timestamp for each user Check if a ... Read More
Suppose we want to develop a data structure that can build up with a list of integers, and there is a function to find sum of elements from index i to index j-1 whenever we require in an efficient way. There are two functions: Constructor that constructs a new instance with the integer array. get_sum(i, j) returns the sum of integers of array elements from starting index i and ending index j-1. So, if the input is like array = [5, 2, 3, 6, 4, 7, 8, 9, ... Read More
In Pandas, the get_slice_bound() method calculates the slice bound position for a given label. To find the left slice bound, set the side parameter to 'left'. Syntax index.get_slice_bound(label, side='left', kind='loc') Parameters label − The value to find the slice bound for side − Either 'left' or 'right' to specify which bound kind − Either 'loc' or 'getitem' for different indexing behaviors Creating a Pandas Index First, let's create a Pandas Index with numeric values − import pandas as pd # Creating Pandas index index = pd.Index([10, 20, ... Read More
To calculate the right slice bound that corresponds to a given label in Pandas, use the index.get_slice_bounds() method. Set the side parameter to right to get the right boundary index position. What is get_slice_bounds()? The get_slice_bounds() method returns the integer position that corresponds to a label in the index. When side='right', it returns the right boundary position for slicing operations. Syntax index.get_slice_bounds(label, side='right', kind='getitem') Parameters label − The label to find the slice bound for side − Either 'left' or 'right' to specify which boundary kind − The kind of slicing ... Read More
The get_loc() method in Pandas returns the integer location of a label in an index. When an exact match isn't found, you can use the method="nearest" parameter to find the closest index value. Syntax index.get_loc(key, method=None, tolerance=None) Parameters key − The label to find method − Method to use for inexact matches ('nearest', 'pad', 'backfill') tolerance − Maximum distance for inexact matches Creating a Pandas Index First, let's create a Pandas index with some values ? import pandas as pd # Creating Pandas index index = pd.Index([10, ... Read More
To get the integer location for a requested label and find the previous index value if no exact match, use the get_loc() method with the method parameter set to "ffill" (forward fill). Syntax index.get_loc(key, method='ffill') Creating a Pandas Index First, let's create a Pandas Index with some integer values − import pandas as pd # Creating Pandas index index = pd.Index([10, 20, 30, 40, 50, 60, 70]) print("Pandas Index...", index) Pandas Index... Int64Index([10, 20, 30, 40, 50, 60, 70], dtype='int64') Finding Exact Matches When the ... Read More