## Binary Search Problem |LeetCode Problem – 1|Easy

In this article we will see some implementation problems of binary search. Before you see and learn the solution, try to solve it on your own. Just understand the problem and try to solve it…

Skip to content# GeeksToCode

## Binary Search Problem |LeetCode Problem – 1|Easy

## Binary Search

## How to Make C++ Vector using STL Explained 2020

## Linear Search in C/C++

## Array in C| All You Need To Know

## Dynamic Programming

## N Queen Problem Using Backtracking Explained

## BackTracking In C | Complete Overview Of BackTracking

Live To Code, Code To Live

In this article we will see some implementation problems of binary search. Before you see and learn the solution, try to solve it on your own. Just understand the problem and try to solve it…

In this article, we will learn how to do a binary search in an array. This is a very easy topic especially if you know the linear search technique. Let’s see more about the topic….

Vector in C++ We Already know how to declare an array in our previous post. In this post, we focus on how to declare an array as c++ vector using c++ STL library. Most importantly…

Linear Search Linear Search in C/C++ means to sequentially traverse a given list or array and check if an element is present in the respective array or list. The idea is to start traversing the…

Introduction To Array in C An array in c is a collection of items of the same data type stored at contiguous memory locations. This makes it easier to calculate the position of each element…

Solving Dynamic Problem Easy Dynamic Programming (DP) is a technique that solves a few specific form of problems in Polynomial Time. Dynamic Programming solutions are quicker than the exponential brute method and can be effortlessly…

N Queen Problem In N Queen Problem, Given a square of size N*N. You have to place 1 Queen in each row, such that no queen can attack any other Queen placed in Square, we…

Prerequisite for Backtracking The backtracking (in c) concept is very useful in Competitive Programming. Beginner’s Found Backtracking difficult to understand. Beginner’s don’t feel confident about Recursion and that is the reason why this concept is…