Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Introduction Businesses have understood that the only way to stand out in today’s competitive era is not through price and product innovation but through customer relations, or customer bonding. Every day, new companies enter the market with better products and prices. Thousands of Skincare brands are available in the market, and all of them promise users similar benefits; however, Dove is a brand that has managed to get connected with its customers quite easily right from the start. Dove is not just a brand that provides skincare; it is a brand that cares about its customers and their skin. ... Read More
Introduction Mobility has been an issue in the community. People who do not know how to drive or do not have vehicles have always had the problem of commuting to the bus stand or taxi stand and then waiting for their ride. OLA cabs, through its applications and different services, is solving the mobility issue for the company. OLA saw an opportunity and grabbed it with both hands. It is crucial for us to read more about the journey of OLA to understand how businesses enter the already-developing market and what strategies they can adopt for success. In this article, ... Read More
Introduction Brands have understood that there is no blue ocean; every market is a red ocean and hence extremely competitive. In the sense that consumers are spoiled with choices. There are similar and identical products for every product line, and what can set the companies apart is their marketing communication or their price differentiation. Axe, as a brand, has proven that effective marketing communication and channels can make a difference. Let us see in this article the birth and growth trajectory of Axe, the brief of the Unilever brand, and the excellent marketing initiatives of Axe by Unilever. Image ... Read More
In this problem, we will find the size of sets of all non−empty connected cells. We will learn two different approaches for finding the size of all non−empty connected cells of a matrix. In the first approach, we will use the breadth−first search algorithm, and in the second approach, we will use the depth−first search algorithm to traverse the matrix and find the size of all non-empty connected cells. Problem statement − We have given matrix[][] 2D array containing only 0 and 1. Here, 0 represents the empty cell, and 1 represents the non−empty cells. We need to find the ... Read More
The number of disconnected subgraphs created by the remaining vertices in a graph following the removal of Q specified vertices is represented by the count of connected components. There are no edges linking the various components; instead, each connected component is made up of a collection of vertices connected by edges. Some vertices may become isolated as a result of the removal of the Q vertices, causing connections to fall apart and new components to form. The approach seeks to ascertain how many disconnected subgraphs there will ultimately be. Numerous applications, including network analysis, social network studies, and optimisation methods, ... Read More
Analyse the connectedness of each edge in the Graph to locate edges whose removal won't break the Graph. We can identify which edges are essential for preserving connectivity between nodes by methodically examining the effect of eliminating individual edges. "Bridge edges" or "critical edges" are edges that, when eliminated, nonetheless leave the Graph connected. These edges are essential for maintaining the general structure of the Graph and avoiding disconnection. To ensure system robustness and effective communication, such edges must be identified in network analysis, transportation planning, and infrastructure design. Methods Used Tarjan's Algorithm Kruskal's Algorithm Tarjan's Algorithm In ... Read More
We can use the following technique to find the cheapest way to multiply X or right−rotate its digits from 1 to N. To monitor the initial lowest cost, create a cost variable. Check to see if N is evenly divided by X at each stage as you progress from N to 1. If so, divide N by X to update it and carry on with the process. Rotate N's digits to the right to increase its value if it is not divisible by X. Increase the cost variable in this situation. The ultimate cost variable value will be the least ... Read More
In this topic, we seek the relationally constrained lexicographically minimal permutation of numbers from 1 to N. The relation describes the relative order of certain of the permutation's components. We ensure that the resulting permutation is the least possible when comparing lexicographically by carefully organising the numbers based on this relation. In order to achieve the lowest feasible arrangement of the numbers, the best sequence must be found that both meets the relation restrictions and does so. To efficiently produce the intended outcome, the procedure entails thorough analysis and element selection. Methods Used Greedy Approach Backtracking Greedy Approach ... Read More
Diverse domains, including CS, social networks, and logistics, use directed graphs, also known as digraphs. Arrows indicating the direction of links serve to depict the interconnections between the various components. They have the ability to represent intricate connections, handle data quickly, and facilitate pathfinding algorithms. Their drawbacks, however, include the potential for analysis complexity, the challenge of visualising vast graphs, and the requirement for cautious treatment of cyclic structures. Despite these drawbacks, directed graphs continue to be fundamental tools for comprehending, evaluating, and enhancing interconnected systems in a variety of real−world contexts. Methods Used Topological Sorting Strongly Connected Components ... Read More
Graphs are used in different disciplines. They are utilised in biology to represent gene interactions, in transportation for route optimisation, and in social networks for user connection analysis. The visual representation of intricate relationships and the capacity to see patterns and trends are two benefits of graphs. However, dealing with large datasets can make graphs bulky and difficult to understand. Additionally, creating graphs can take time and necessitate knowledge. Despite these drawbacks, graphs continue to be an effective tool for data analysis and decision−making across a range of disciplines. Methods Used Set Representation Linked Representation Sequential Representaion Set ... Read More