Skip to content

Instantly share code, notes, and snippets.

View kodebinary's full-sized avatar

kodebinary

View GitHub Profile
@kodebinary
kodebinary / remove-duplicate-chars-from-a-string.cpp
Last active July 14, 2020 04:37
Remove duplicate characters from a string in-place. Full article is at: https://kodebinary.com/remove-duplicate-characters-from-a-string-in-place/
#include <iostream>
using namespace std;
#define MAX_CHARS 127
void removeDupChars(char inp[], int len)
{
int dp[MAX_CHARS];
int cnt = 0;
@kodebinary
kodebinary / remove-alternate-duplicate-chars.cpp
Last active July 12, 2020 14:41
Remove alternate duplicate characters from the input string in-place. Full article is at: https://kodebinary.com/remove-alternate-duplicate-characters-in-a-sentence-in-place
#include <iostream>
using namespace std;
#define MAX_CHARS 127
void removeAlternateDups(char inp[], int len)
{
// Keep an array of 127 size to store character occurrence.
// As the size is constant, we can consider this as constant space.
@kodebinary
kodebinary / find-next-higher-number-with-same-digits.cpp
Last active July 11, 2020 18:23
Find next higher number with the same digits. Full article is at: https://kodebinary.com/find-the-next-higher-number-with-the-same-digits-as-in-the-input-number/
#include <iostream>
using namespace std;
void swap(char *a, char *b)
{
char tmp = *a;
*a = *b;
*b = tmp;
}
@kodebinary
kodebinary / two-nodes-with-input-sum-in-bst.cpp
Last active July 10, 2020 15:33
Find two nodes with a given input sum in a binary search tree. Full article is at: https://kodebinary.com/find-two-nodes-with-a-given-sum-in-a-binary-search-tree
#include <iostream>
#include <unordered_map>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;
@kodebinary
kodebinary / queue-using-two-stacks.cpp
Created July 5, 2020 17:20
Implement Queue using two stacks. Full article is at: https://kodebinary.com/queue-using-two-stacks
#include <iostream>
#include <stack>
using namespace std;
class Queue {
stack<int> st;
public:
Queue() {};
~Queue() {}
@kodebinary
kodebinary / swap-two-integers-without-temp.cpp
Created July 4, 2020 15:47
Swap two integers without using any third variable. See full article: https://kodebinary.com/swap-two-integers-without-using-the-third-variable
#include <iostream>
using namespace std;
// Common approach using a "temp" variable.
void swap(int &a, int &b) {
int temp = a;
a = b;
b = temp;
}
@kodebinary
kodebinary / number-of-ones-in-sorted-binary-array.cpp
Last active June 30, 2020 16:34
Find number of 1s in a sorted binary array. Full article is at: https://kodebinary.com/find-the-number-of-1's-in-a-sorted-binary-array
#include <iostream>
using namespace std;
int findStartOfOnes(int inp[], int start, int end) {
if(start <= end) {
int mid = (start + end) / 2;
if(inp[mid] == 1 && inp[mid-1] == 0) {
return mid;
}
@kodebinary
kodebinary / shuffle-integer-array.cpp
Created June 28, 2020 16:19
Shuffle an integer array. For full article: https://kodebinary.com/shuffle-an-integer-array
#include <iostream>
using namespace std;
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
@kodebinary
kodebinary / check-two-strings-are-anagrams.cpp
Created June 27, 2020 15:30
Check if two strings are anagrams or not. Full article is at: https://kodebinary.com/check-if-two-string-are-anagrams-to-one-another
#include <iostream>
#define MAX_CHAR 255
using namespace std;
bool checkAnagrams(string str1, string str2)
{
int arr[MAX_CHAR] = {0};
if (str1.length() != str2.length())
{
return false;
@kodebinary
kodebinary / kth-node-from-last.cpp
Created June 27, 2020 02:37
Find K-th node from last. Full article is at: https://kodebinary.com/find-the-kth-node-from-the-end-in-a-singly-linked-list
#include <iostream>
using namespace std;
struct Node
{
int data;
struct Node *next;
Node(int data)
{