Skip to content

Instantly share code, notes, and snippets.

View kodebinary's full-sized avatar

kodebinary

View GitHub Profile
@kodebinary
kodebinary / find-longest-substr-with-unique-chars.cpp
Last active October 23, 2020 11:22
Find the longest substring with given max unique characters. Full article at: https://kodebinary.com/find-the-longest-substring-with-given-max-unique-characters
#include <iostream>
void moveNextChar(string input, int *end) {
char curr = input.at(*end);
do {
*end = *end + 1;
if (*end == input.length()) {
break;
}
char tmp = input.at(*end);
@kodebinary
kodebinary / find-nearest-in-bst.cpp
Last active October 22, 2020 17:17
Find the nearest integer of a give number in binary search tree. Full article: https://kodebinary.com/find-the-nearest-integer-of-a-given-number-in-the-binary-search-tree
#include <iostream>
using namespace std;
struct Node {
int data;
Node *left, *right;
Node(int data) {
this->data = data;
left = NULL;
@kodebinary
kodebinary / clone-graph.cpp
Last active October 22, 2020 04:25
Clone Graph. Full article at: https://kodebinary.com/clone-given-graph
#include <iostream>
#include <list>
#include <queue>
#include <map>
using namespace std;
// Cloneing a graph.
class GraphNode {
public:
@kodebinary
kodebinary / move-zeros-right-most.cpp
Created October 11, 2020 17:11
Move zero's to right most of the array. Full article is at: https://kodebinary.com/an-algorithm-to-move-all-zeros-in-an-integer-array/
#include <iostream>
using namespace std;
void swap(int &val1, int &val2) {
int temp = val1;
val1 = val2;
val2 = temp;
}
@kodebinary
kodebinary / find-pair-with-given-sum-in-sorted-array.cpp
Last active September 23, 2020 12:53
Find if there exists a pair with a given sum in a sorted array. Full article is at: https://kodebinary.com/find-if-there-exists-a-pair-with-a-given-sum-in-a-sorted-array/
#include <iostream>
using namespace std;
/*
Solution with linear time complexity.
*/
bool findPairSum(int arr[], int size, int sum) {
int start = 0;
int end = size - 1;
@kodebinary
kodebinary / parentheses-matching-problem.cpp
Created August 2, 2020 08:30
Parentheses matching problem. Full article is at: https://kodebinary.com/parentheses-matching-problem
#include <iostream>
#include <stack>
using namespace std;
bool isParanthMatch(string inp)
{
stack<char> st;
for (int i = 0; i < inp.length(); i++)
{
@kodebinary
kodebinary / starting-point-of-sorted-rotated-array.cpp
Created August 1, 2020 04:06
Find starting point of a sorted rotate array. Full article is at: https://kodebinary.com/find-the-starting-point-of-a-sorted-rotated-array
#include <iostream>
using namespace std;
int findStartOfRotatedArray(int arr[], int start, int end)
{
int mid = (start + end) / 2;
if (mid == 0)
{
return mid;
@kodebinary
kodebinary / visible-boxes-after-fitting-in-one-another.cpp
Last active July 21, 2020 02:13
Find all visible boxes after putting smaller boxes into bigger ones. Full article is at: https://kodebinary.com/find-the-number-of-visible-boxes-after-inserting-smaller-size-boxes-into-bigger-size-boxes/
#include <iostream>
#include <unordered_map>
using namespace std;
int visibleBoxes(int arr[], int len)
{
unordered_map<int, int> res;
for (int i = 0; i < len; i++)
{
@kodebinary
kodebinary / find-all-possible-decodings-of-a-num.cpp
Last active July 19, 2020 02:00
Find all possible decodings of a given input number. Full article is at: https://kodebinary.com/find-all-possible-combinations-of-decodings-of-a-number/
#include <iostream>
#include <string>
using namespace std;
void printCombinations(int val, string res)
{
if (val == 0)
{
cout << res << endl;
@kodebinary
kodebinary / sum-linked-list-with-given-integer-lists.cpp
Last active July 19, 2020 01:53
Sum linked list with given two linked lists which represent as integers. Full article is at: https://kodebinary.com/given-two-linked-lists-both-represent-a-number-need-to-find-its-sum-linked-list/
#include <iostream>
using namespace std;
struct Node
{
int data;
Node *next;
Node(int data)
{