1 MIN READ•
#Understanding Strings in various programming language
Understanding Strings in Various Programming Languages:A string is a sequence of characters that are often used to represent text. Strings are a fundamental da
Ashutosh KumarAuthor
Blog
Insights, tutorials, and ideas...
Newest first
All Posts
1 MIN READ•
Array
ArrayARRAY – Short Notes🔹 DefinitionAn array is a collection of similar data types stored in contiguous memory locations and accessed using an index.Example:in
Abhishek SinghAuthor
4 MIN READ•
#Binary Search:
Binary SearchIntuition:Binary search is an efficient algorithm to find a target value within a sorted array. It works on the idea of repeatedly dividing the sea
Abhijeet Singh RajputAuthor
3 MIN READ•
Optimal Binary Search Tree (OBST)
Optimal Binary Search Tree (Optimal BST)Let be the distinct keys ordered from the smallest to the longest andLet be the probability of searching their be the
Divya SachanAuthor
1 MIN READ•
Binary Search Tree
Binary Search TreeA Binary Search Tree (BST) is a special type of binary tree.It can be empty, but if it’s not empty, it follows these rules:Each node contains
Ashutosh KumarAuthor
1 MIN READ•
Graph
GraphA Graph is a non-linear data structure that represents a set of nodes (vertices) and links (edges) between them.It is denoted as:where:V = set of verticesE
Divya SachanAuthor
2 MIN READ•
Merge Sort
Merge SortMerge Sort is a Divide and Conquer algorithm.Given an array a[1…N], merge sort works as follows:Divide the array into two equal halves.Recursively app
Ashutosh KumarAuthor
3 MIN READ•
Quick Sort
Quick SortIt is a popular sorting method based on the divide-and-conquer approach. Unlike merge sort, where the division is always in the middle, in quicksort t
Abhijeet Singh RajputAuthor
4 MIN READ•
HWI Practice
HWI Practice1. Subarrays with Even Sum Starting with Odd NumberProblem: Find the number of subarrays with an even sum that start with an odd number.Approach: Pr
Abhijeet Singh RajputAuthor
1 MIN READ•
Fenwick Tree
FenWick TreeFenwick Tree, also known as Binary Indexed Tree, is a powerful data structure designed to efficiently handle prefix sums and updates in logarithmic
Abhishek SinghAuthor
1 MIN READ•
Square Root Decomposition
Square Root Decomposition🎯Codeclass SquareRootDecomposition{ vector<int> nums, blocks; int blockSize; public: SquareRootDecomposition(vector
Ashutosh KumarAuthor
2 MIN READ•
Decision Tree Algorithm
Decision Tree Algorithm✅ Steps to Construct a Decision TreePlace the best feature (attribute) of the dataset at the root of the tree.Split the training set into
Divya SachanAuthor
6 MIN READ•
Decision Tree
Decision TreeA decision tree is a tree-shaped diagram used to determine a course of action. Each branch of the tree represents a possible decision, occurrence,
Abhishek SinghAuthor