Skip to content

Instantly share code, notes, and snippets.

View kodebinary's full-sized avatar

kodebinary

View GitHub Profile
@kodebinary
kodebinary / remove-duplicates-in-linked-list.cpp
Created June 26, 2020 03:54
Remove duplicate nodes in singly linked list. Full article is at: https://kodebinary.com/remove-duplicate-nodes-in-a-singly-linked-list
#include <iostream>
#include <unordered_map>
using namespace std;
struct Node
{
int data;
struct Node *next;
Node(int data)
@kodebinary
kodebinary / check-two-binary-trees-mirrors.cpp
Created June 19, 2020 02:56
Check if two binary trees are mirrors to each other. Full article is at: https://kodebinary.com/check-if-given-two-binary-trees-are-the-mirrors-to-each-other
#include <iostream>
using namespace std;
struct Node
{
int data;
struct Node *left;
struct Node *right;
};
@kodebinary
kodebinary / min-cost-to-reach-end-of-array.cpp
Created June 13, 2020 08:20
Minimum cost to reach end of array with given maximum jump K (recursion & dynamic programming approach), Full article is at: https://kodebinary.com/minimum-cost-to-reach-the-end-of-the-array-using-recursion-and-dynamic-programming
#include <iostream>
using namespace std;
int minCostToEndRecursion(int arr[], int size, int k)
{
int result = INT_MAX;
if (size < 0)
{
return 0;
@kodebinary
kodebinary / dijkstra-shortest-path-greedy-algo.cpp
Created June 12, 2020 11:32
Dijkstra shortest path greedy algorithm. Full article is at: https://kodebinary.com/dijkstra-algorithm-to-find-the-shortest-path-greedy-approach
#include <iostream>
#include <list>
using namespace std;
class Vertex {
public:
int data;
list<pair<int, Vertex> > edges;
Vertex() {
@kodebinary
kodebinary / check-string-palindrome-or-not.cpp
Created June 7, 2020 17:12
Check given string is palindrome or not. Complete article is at: https://kodebinary.com/check-given-string-is-palindrome-or-not
#include <iostream>
using namespace std;
bool isPalindromIterative(char *inp, int len)
{
for (int i = 0; i < len / 2; i++)
{
if (inp[i] != inp[len - 1 - i])
{
@kodebinary
kodebinary / approaches-to-reverse-a-string.cpp
Last active June 7, 2020 11:46
Reverse a string with different approaches. Full article is at: https://kodebinary.com/different-methods-to-reverse-a-string
#include <stdio.h>
#include <stdlib.h>
#include <stack>
void swap(char *a, char *b)
{
char temp = *a;
*a = *b;
*b = temp;
}
@kodebinary
kodebinary / length-of-longest-palindromic-subseq.cpp
Created June 7, 2020 04:52
Length of longest palindromic subsequence. Full article is at: https://kodebinary.com/longest-palindromic-subsequence-length-of-a-string
#include <iostream>
using namespace std;
int max(int a, int b, int c)
{
return max(a, max(b, c));
}
int longestPalindromSubseqRecur(char arr[], int len, int start, int end)
@kodebinary
kodebinary / print-all-subsequences-of-string.cpp
Created June 6, 2020 03:50
Print all subsequences of a given string, full article at: https://kodebinary.com/print-all-subsequences-of-a-given-string-recursive-approach
#include <iostream>
using namespace std;
void printSubsequences(string inp, string subs)
{
if (inp.length() == 0)
{
cout << subs << endl;
return;
@kodebinary
kodebinary / longest-common-subsequence-length.cpp
Created June 6, 2020 02:12
Longest common subsequence length problem. Full article is at: https://kodebinary.com/longest-common-subsequence-length-of-given-two-strings
#include <iostream>
using namespace std;
int longestCommonSubseqRec(char arr1[], char arr2[], int len1, int len2)
{
if (len1 == 0 || len2 == 0)
{
return 0;
}
@kodebinary
kodebinary / count-subsets-whose-sum-is-given-k.cpp
Created June 2, 2020 18:04
Count of subsets with given sum. For full article: https://kodebinary.com/count-of-all-subsets-with-given-sum-in-an-unsorted-integer-array
#include <iostream>
using namespace std;
int countSubsetSumEqualsGivenSumRec(int arr[], int size, int sum)
{
if (sum < 0 || size < -1)
{
return 0;
}