Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Excel is a robust spreadsheet programme that provides a wide range of tools to assist you in manipulating and analysing data. Making your data readable and visually appealing requires careful formatting. The task of copying formatting from a particular range of cells and applying it to another range will be the main emphasis of this course. When you need to copy formatting from one table to another or when you want to keep your worksheet's formatting constant throughout, doing so can help you save a lot of time. This article will give you detailed instructions and real-world examples to ... Read More
Within a spreadsheet, comments are essential for adding context and explanations. You can use them to communicate critical information that might not fit straight into a cell. Sometimes, though, you might simply want to extract and transfer the comments from a few selected cells not the accompanying cell values to a different location. In this article, we'll look at a methodical process for successfully completing this work. By the end of this tutorial, you will have a firm grasp on how to efficiently extract and copy comments from Excel files, saving you time and effort. Let's get started ... Read More
You've come to the perfect place if you've ever needed to combine only particular worksheets from a large Excel workbook with other worksheets into a single, well-organized worksheet. Excel offers strong capabilities that make it possible for you to automate your data management and analysis operations. It is simpler to analyse and show your data efficiently when you combine a few worksheets to compile pertinent data from several sources and produce a consolidated perspective. You will be guided step-by-step through the process of merging particular worksheets into one during this tutorial. This technique will assist you in maintaining control over ... Read More
Excel is an effective tool for managing and analysing data, and keeping accuracy and preventing duplication can depend on your data only having unique values. Excel has a number of built-in tools and functions that can assist you in limiting entries to unique values only, regardless of whether you're dealing with a tiny dataset or a huge spreadsheet. By using these methods, you can improve data integrity, streamline your workflow, and gain critical time. You'll discover how to avoid duplicate entries in one column or across several columns, enabling you to preserve the accuracy of your data and get rid ... Read More
Powerful spreadsheet software like Excel provides a wide range of functions to help you manage and analyse your data. To ensure that positive or zero values are not accepted, you might want to limit the entry of numbers to just negative values in some circumstances. Enforcing this restriction can assist maintain data accuracy and prevent errors, whether you're working on financial modelling, budgeting, or any other scenario where negative numbers are necessary. You will learn how to configure Excel such that only negative numbers can be entered, restricting the entry of any positive or zero values, by carefully following the ... Read More
The Weighted Interval Scheduling Problem revolves around a set of intervals, each having an associated weight. In this article, we will implement the Weighted Interval Scheduling algorithm in go, using two methods: Recursive and Dynamic Programming. This classic optimization problem involves selecting non-overlapping intervals with maximum total weight. Explanation Recursive Method The Recursive Method takes a straightforward yet elegant approach. It examines each interval one by one and considers two scenarios − whether to include the current interval or skip it. This method utilises recursion to explore all possible combinations of intervals, calculating the maximum weight. While ... Read More
In this article, we will explore the implementation of a Treap data structure in Golang using two different methods. A Treap is a combination of a binary search tree and a binary heap, making it an efficient data structure for maintaining a set of ordered elements while also ensuring balanced priority. The first method will utilise a recursive approach for building and maintaining the Treap, while the second method will implement an iterative approach. The examples below showcase the creation and traversal of a randomised binary search tree, Explanation A Treap is a cool combination of two other structures, a ... Read More
A BitSet is a data structure that represents a fixed-size set of binary values, where each value can be either 0 or 1. It is commonly used for efficiently storing and manipulating large sets of boolean values. In this article, we will implement a bitset in go, using two different methods, the first one involves the use of slice of booleans as well as the second one involves using bit manipulation with unsigned integers. Implementation here means that we are going to perform various operations like setting, clearing and testing of individual bits within a bitset data structure. Explanation ... Read More
Tries are tree-like data structures used for efficient storage and retrieval of strings, making them invaluable for tasks like autocomplete, dictionary implementation, and pattern matching. The compressed node technique optimises space usage by merging common prefixes among nodes, resulting in a more memory-efficient Trie. In this article, we will explore the implementation of a Trie with Compressed Nodes in Golang using two methods to implement the Trie with Compressed Nodes, the first method utilises maps, and the second method uses arrays. Explanation A compressed trie is a trie data structure that saves the space by combining consecutive nodes with ... Read More
A Double Ended Priority Queue, in short DEPQ is a data structure that extends the functionality of a standard priority queue. In this article, we will implement a double ended priority queue in Golang using two methods: the first method uses two separate heaps for maximum and minimum priorities, while the second method augments a single heap with additional information for efficient queries. In the code examples we are going to perform the operations like insertion retrieval, deletion and updation. Explanation Double ended priority queue is a data structure that allows insertion and deletion operations and it allows efficient ... Read More