Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Economics & Finance
When it is required to implement a queue using stacks, we can create a queue class that uses two stack instances. This approach leverages the LIFO (Last In First Out) nature of stacks to achieve FIFO (First In First Out) behavior of queues. A queue has two main operations: enqueue (add element) and dequeue (remove element). We'll use two stacks − one for input operations and another for output operations. How It Works The algorithm uses two stacks: Input Stack: Handles all enqueue operations Output Stack: Handles all dequeue operations When dequeuing, if output stack ... Read More
A stack follows Last-In-First-Out (LIFO) principle, while a queue follows First-In-First-Out (FIFO). This tutorial shows how to implement a stack using two queues, demonstrating an interesting data structure transformation. Stack and Queue Classes We need two classes: one for queue operations and another for stack implementation using two queues ? class Queue_structure: def __init__(self): self.items = [] self.size = 0 def check_empty(self): ... Read More
A stack is a Last-In-First-Out (LIFO) data structure. To reverse a stack using recursion, we need two key functions: one to reverse the stack and another to insert elements at the bottom of the stack. Stack Implementation First, let's create a stack class with basic operations ? class Stack: def __init__(self): self.items = [] def is_empty(self): return len(self.items) == 0 ... Read More
When it is required to select the nth largest element from a list in linear time complexity, we can use the QuickSelect algorithm. This algorithm uses a partitioning approach similar to QuickSort but only recurses on one side, achieving expected O(n) time complexity. The algorithm works by partitioning the list around a pivot element and then deciding which partition contains the nth largest element ? How the Algorithm Works The QuickSelect algorithm consists of two main functions: select_largest − The main function that finds the ith largest element start_partition − A helper function that partitions ... Read More
Let's see how a user can get the details of a specified function definition from AWS Glue Data Catalog using the Boto3 library. Problem Statement Use boto3 library in Python to get the details of a user-defined function named insert_employee_record in database employee from AWS Glue Data Catalog. Approach Step 1: Import boto3 and botocore exceptions to handle exceptions. Step 2: database_name and function_name are the required parameters. It fetches the definition of a given function in a specified database. Step 3: Create an AWS session using boto3. Make sure region_name is mentioned in the ... Read More
AWS Glue Data Catalog allows you to manage triggers for data processing workflows. Using Boto3, you can programmatically retrieve detailed information about any trigger in your account. Prerequisites Before getting trigger details, ensure you have: AWS credentials configured (via AWS CLI, IAM roles, or environment variables) Proper IAM permissions for Glue operations Boto3 library installed: pip install boto3 Approach To get trigger details from AWS Glue Data Catalog: Step 1: Import boto3 and botocore exceptions to handle errors Step 2: Create an AWS session and Glue client Step 3: Call get_trigger() ... Read More
Finding the nth smallest element from a list in expected linear time requires implementing the Quickselect algorithm. This algorithm uses partitioning similar to quicksort but only searches one partition, achieving O(n) average time complexity. The algorithm works by selecting a pivot element, partitioning the list around it, and then recursively searching only the partition that contains the nth smallest element. Algorithm Implementation Here's the implementation using two functions − one for selection and another for partitioning ? def select_smallest(numbers, beg, end, i): if end - beg k: ... Read More
When it is required to check if a string is a palindrome using stack data structure, a stack class is created, and push and pop methods are defined to add and delete values from stack. Another method checks to see if the stack is empty or not. A palindrome is a word that reads the same forwards and backwards, like "madam" or "racecar". Using a stack's LIFO (Last In, First Out) property, we can reverse a string and compare it with the original. Stack Implementation First, let's create a stack class with basic operations ? ... Read More
When it is required to reverse a specific set of elements in a linked list, a method named 'reverse_list' is defined. This iterates through the list and reverses the first N elements while keeping the remaining elements unchanged. Below is a demonstration for the same − Example class Node: def __init__(self, data): self.data = data self.next = None class LinkedList_structure: def __init__(self): self.head ... Read More
When working with linked lists, it's often useful to find the number of occurrences of elements. This implementation demonstrates how to create a linked list and count occurrences of specific elements using a custom count_elem method. Below is a demonstration for the same − Linked List Implementation First, we create the basic structure with Node and LinkedList classes: class Node: def __init__(self, data): self.data = data self.next = None class LinkedList_structure: ... Read More