Tutorials
Courses

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Misc8.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Sorting1.8K+ articles

Searching1.7K+ articles

Ternary Search12+ articles

Algorithms-Divide and Conquer8+ articles

In-house+ articles

Algorithms-Searching

29 posts

Understanding Opposite Polarity Concept in Binary Search

Last Updated: 20 November 2023

Opposite Polarity is a concept in Binary Search which works on the search space with the condition that the before and after regions of the search space will be reversed w...read more

article_image

Geeks Premier League

Algorithms-Searching

Geeks Premier League 2023

Minimize the Maximum Distance between runners

Last Updated: 12 December 2023

Given two arrays dist[] and speed[] of size N (number of runners) and a positive integer T (duration of a race), where dist[i], speed[i] indicating the initial distance an...read more

Competitive Programming

Algorithms-Divide and Conquer

Algorithms-Searching

Minimizing Maximum Absolute Subarray Sums

Last Updated: 10 February 2024

Given an array arr[] of size N, we can choose any real number X which when subtracted from all the elements of the array then the maximum absolute subarray sum among all t...read more

Competitive Programming

Algorithms-Divide and Conquer

Algorithms-Searching

Minimizing Distance Between Two Walkers

Last Updated: 29 December 2023

Given the starting and ending coordinates of path of two persons, the task is to find the minimum distance between the persons at any point of time. The first persons walk...read more

article_image

Competitive Programming

Algorithms-Divide and Conquer

Algorithms-Searching

Finding Minimum Time for Workers to Meet at a Point

Last Updated: 28 December 2023

Given N workers standing on a road of infinite length and two arrays point[] and time[] each of size N, such that point[i] is point where the ith worker is standing and ti...read more

Competitive Programming

Algorithms-Divide and Conquer

Algorithms-Searching

Find the minimum value of a UniModal function

Last Updated: 28 February 2024

Given a Unimodal Function f(x) = A(x * x) + Bx + C and a range for the value of x in the form of [L, R], the task and is to find the minimum value of f(x) where the value ...read more

Competitive Programming

Geeks Premier League

Algorithms-Searching

Geeks Premier League 2023

Maximize the number of boxes using red and yellow balls

Last Updated: 28 February 2024

We are given R red balls and Y yellow balls to fill in boxes. We can fill a box using one of the two ways: Using A red balls and B yellow ballsUsing B red balls and A yell...read more

Competitive Programming

Geeks Premier League

Algorithms-Searching

Geeks Premier League 2023

Difference Between Depth First Search, Breadth First Search and Depth Limit Search in AI

Last Updated: 10 April 2024

In AI, search algorithms like Depth First Search (DFS), Breadth First Search (BFS), and Depth Limit Search (DLS) are essential for systematically exploring a search space ...read more

Algorithms-Searching

Artificial Intelligence

Breadth First Search (BFS) for Artificial Intelligence

Last Updated: 15 May 2024

In artificial intelligence, the Breadth-First Search (BFS) algorithm is an essential tool for exploring and navigating various problem spaces. By systematically traversin...read more

article_image

Algorithms-Searching

Artificial Intelligence

Two Way Linear Search Algorithm

Last Updated: 15 May 2024

Two-Way Linear Search Algorithm is based on the principle of Linear Search, but the search is conducted from both ends towards the center of the array. In this article, we...read more

Algorithms-Searching

Depth First Search (DFS) for Artificial Intelligence

Last Updated: 16 May 2024

Depth-first search contributes to its effectiveness and optimization in artificial intelligence. From algorithmic insights to real-world implementations, DFS plays a huge ...read more

article_image

Algorithms-Searching

Artificial Intelligence

Memory-bounded search ( Memory Bounded Heuristic Search ) in AI

Last Updated: 13 May 2024

Search algorithms are fundamental techniques in the field of artificial intelligence (AI) that let agents or systems solve challenging issues. Memory-bounded search strate...read more

Algorithms-Searching

Artificial Intelligence

Data Science Blogathon 2024

Searching in Array

Last Updated: 23 August 2024

Searching is one of the most common operations performed in an array. Array searching can be defined as the operation of finding a particular element or a group of element...read more

Algorithms-Searching

AlphaGo Algorithm in Artificial Intelligence

Last Updated: 25 June 2024

The emergence of AlphaGo has marked a significant milestone in artificial intelligence (AI), showcasing the power of combining reinforcement learning and deep learning tec...read more

article_image

Algorithms-Searching

Artificial Intelligence

AI-ML-DS With Python

Data Science Blogathon 2024

Depth Limited Search for AI

Last Updated: 22 May 2024

Depth Limited Search is a key algorithm used in the problem space among the strategies concerned with artificial intelligence. The article provides a comprehensive overvie...read more

article_image

Algorithms-Searching

Artificial Intelligence

Data Science Blogathon 2024