Programming Articles

Page 211 of 2544

Given a sequence of words, print all anagrams together

Divya Sahni
Divya Sahni
Updated on 03-Nov-2023 1K+ Views

Anagrams − An anagram is a word or a phrase formed by rearranging the alphabets of another word or phrase, usually once. Some examples of anagrams are given below − Top - Pot Silent - Listen Post - Stop Dog - God Problem Statement Given an array of words arr[]. For the given array print all the anagrams together. Sample Example 1 Input arr[] = {“star”, “god”, “vile”, “save”, “evil”, “care”, “arts”, “race”, “dog”, “vase”} Output arts star care race dog god evil vile save vase ...

Read More

Find the interval which contains the maximum number of concurrent meetings

Divya Sahni
Divya Sahni
Updated on 03-Nov-2023 479 Views

Given a scenario of a company where meetings are held during fixed time slots. These slots might be overlapping or distant. Thus, optimizing meeting efficiency is important in order to accommodate maximum meetings without any conflicts between schedules. In the problem given, we’ll be going through such an optimizing meeting efficiency problem. Problem Statement Given a two-dimensional array time[][] containing the start time and end time of all the meetings that are scheduled for that day. The task is to find the time interval when most of the meetings are occurring. Sample Example 1 Input: time[][] = {{1, 5}, {2, 6}, {3, 7}, {4, ...

Read More

Design an efficient data structure for given operations

Divya Sahni
Divya Sahni
Updated on 03-Nov-2023 415 Views

In order to design efficient data structures for specific operations, the time and space complexity of the given operations for the data structure created is important. Looking into some basic operations and how they can be efficiently optimized − insert() − Inserts an element to the data structure Dynamic Arrays, Hash Tables, Binary Search Trees and Balanced Search Trees like AVL Trees or Red-Black Trees are the most efficient choice of data structures providing O(1) complexity for insertions operation. delete() − Deletes an element from the data structure Hash tables approach the deletion process in O(1) time while Binary Search Trees and Balanced Search ...

Read More

Maximum level sum in N-ary Tree

Divya Sahni
Divya Sahni
Updated on 03-Nov-2023 517 Views

The N-ary tree is a tree data structure where each node can have a maximum of N children where N is a positive integer (N >= 0). N-ary trees are used in many applications like file systems, organizational charts and syntax trees in programming languages. Example of N-ary tree with N = 4. A / / \ \ B C D E / | \ ...

Read More

How to sort the objects in a list in Python?

Vikram Chiluka
Vikram Chiluka
Updated on 03-Nov-2023 2K+ Views

In Python, a list is an ordered sequence that can hold several object types such as integer, character, or float. In other programming languages, a list is equivalent to an array. Square brackets are used to denote it, and a comma (, ) is used to divide two items in the list. In this article, we will show you how to sort the objects and elements in a list using python. Below are the different methods to accomplish this task − Using sort() method Using sorted() method Assume we have taken a list containing some elements. We will ...

Read More

Difference Between Hashtable and Synchronized Map in Java

Rudradev Das
Rudradev Das
Updated on 02-Nov-2023 563 Views

A HashTable is a compact abstract data set which converts the keys of a map to the values by computing the indexes into an array of slots to enable faster data access. On the other hand, a synchronized map is a Java collection class which is mainly used to synchronize a particular map to make it a thread safe collection and can be applied on a whole object. The map does not contain any null value. Input [ ARB, RDD, KOL, DHKA ] Output Insertion Order of objects in HashTable : [ ARB, RDD, KOL, DHKA ] Insertion Order of objects in Synchronized Map : [ ...

Read More

Difference Between IdentityHashMap, WeakHashMap, and EnumMap in Java

Rudradev Das
Rudradev Das
Updated on 02-Nov-2023 695 Views

The IdentityHashMap is a special type of hash class by which we handle the rare cases related to the reference-equality. This map compares the keys by using a " = = " operator where the normal hashmap uses the " equals " method for this. A Weak HashMap is a type of map interface where the hash table merges its keys with the weak reference type of values. This type of map class can not be used further just because of the lack of reference pointers. An enum map is a special type of map class which contains only the ...

Read More

Difference and similarities between HashSet , LinkedHashSet and TreeSet in Java

Rudradev Das
Rudradev Das
Updated on 02-Nov-2023 725 Views

The HashSet, LinkedHashSet and TreeSet are the set interface class mainly used to store the elements. HashSet − A HashSet is a container instance which stores the unique elements only in a non synchronized manner to handle the high-performance operations involving with the set. The set allows the null values which does not follow the order of insertion. LinkedHashSet − The LinkedHashSet is a cloned data structure which have the both facilities of a hashtable and linked list as a set interface. The ordered version of a LinkedHashSet always works as a doubly linked list on over the input elements. TreeSet ...

Read More

Show Uniform Discrete Distribution in Statistics using Python

Pranay Arora
Pranay Arora
Updated on 02-Nov-2023 637 Views

In the field of statistics, there is a major role played by probability distributions in modeling and analyzing various random phenomena. Uniform Discrete Distribution is one of them. It is particularly used when dealing with discrete random variables which have equally likely outcomes. Ahead in this article, we will explore Uniform Discrete Distribution in the light of Python programming, using the scipy.stats.randint() function. Scipy is a powerful python library for scientific analysis and calculations. The stats module provides tools for statistical analysis including probability distributions. The randint() function in the scipy.stats module represents the uniform discrete variable, which inherits its ...

Read More

Why do we use question mark literal in Python regular expression?

Md Waqar Tabish
Md Waqar Tabish
Updated on 02-Nov-2023 4K+ Views

Introduction The question mark makes the previous token in the regular expression optional. For example: colou?r is complementary to both colour and colour. A quantifier is what the question mark is known as. You may make multiple tokens optional by combining numerous tokens in parentheses and adding the question mark after the final set of parentheses. Like Nov(ember)? matches between Nov and Nov. Using many question marks, you may create a regular expression matching a wide range of options. Feb(ruary)? 23(rd)? Matches February 23rd, February 23, Feb 23rd and Feb 23. Curly braces can also be used to make something ...

Read More
Showing 2101–2110 of 25,433 articles
« Prev 1 209 210 211 212 213 2544 Next »
Advertisements