Binary Search in C++
<predata-previewers=””>#include<iostream> using namespace std; // A recursive binary search function. It returns // location of x in given array arr[l..r] is present, // otherwise -1 int binarySearch(int arr[], int
Read More<predata-previewers=””>#include<iostream> using namespace std; // A recursive binary search function. It returns // location of x in given array arr[l..r] is present, // otherwise -1 int binarySearch(int arr[], int
Read MoreWrite a program to reverse a string in C++ There are numerous ways to solve this problem. Let’s start with the simplest one – Using the inbuilt “reverse” function.
Read MoreHere is a brute force solution: <predata-previewers=””>#include <iostream> #include <vector> using namespace std; class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { int n = nums.size(); for (int
Read MoreIn computer science, a jagged array, also known as a ragged array, is an array of arrays of which the member arrays can be of different lengths,[1] producing rows
Read More<predata-previewers=””>#include <string> #include <vector> #include <iostream> #include <bitset> using namespace std; bool isUniqueChars(const string &str){ if (str.length() > 128){ return false; } vector<bool> char_set(128); for (int i = 0;
Read More