Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Sakshi Koshta
Page 3 of 3
Find Values after N Operations to Remove N Characters of String ‘S’ With Given Constraints
What are the Specifications of Using String? To solve a specific challenge involving the given string S. The string S contains only lowercase English letters, and certain constraints must be followed while removing characters. The given constraints are − There are lowercase English letters in string S. A character can only be deleted if it appears more than once in string. Only characters that appear consecutively can be deleted. The following steps can be used to remove characters from string S − Find all characters that appear more than once as you iterate over string S. Find all of ...
Read MoreSum of Indices of Characters Removed to Obtain an Empty String Based On Given Conditions
String manipulation-related concepts like The Sum of indices of Characters deleted to obtain an Empty String are frequently utilized in programming challenges and competitions. The result is then computed using the sum of the eliminated characters' indexes. The Sum of indices of Characters deleted to obtain an Empty String is a practical idea in string manipulation that may be used to solve a variety of programming difficulties and challenges. Problem Approach We must first comprehend the problem statement and given criteria to find total of character indices eliminated to produce empty string. Given string S, the objective is to determine ...
Read MoreQueries to find Kth Greatest Character In A Range [L,R] From A String With Updates
The Fenwick Tree is a type of data structure, which enables range updates and range searches with O(log n) time complexity, also called as binary indexed tree (BIT) The fundamental concept is to keep frequency array for every letter in string, with frequency of i-th character being recorded at index i in frequency array. The frequency array can then allow range updates and range queries using Fenwick Tree. Problem Approach You can use following queries to extract Kth biggest character from string with updates in range [L, R] − Build segment tree − Create segment tree first, in which ...
Read MoreQueries to count array elements greater than or equal to given number with updates
An array can be successfully updated and put through to range queries thanks to segment trees. With updates, we can use data structure known segment tree to count no. of elements in Array which are larger than or same as no. Query − Find out how many items exist in [l, r] range that are larger than or similar to x. Give 0 if range [l, r] lies entirely beyond segment that current node of segment tree represents. Count no. of elements in range [l, r] which is larger than or similar to x if interval [l, r] ...
Read More