Andrei Vacaroiu andrei14vl
andrei14vl
/ tmux.conf
Created
May 4, 2018 14:09
— forked from spicycode/tmux.conf
The best and greatest tmux.conf ever
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # 0 is too far from ` ;) | |
| set -g base-index 1 | |
| # Automatically set window title | |
| set-window-option -g automatic-rename on | |
| set-option -g set-titles on | |
| #set -g default-terminal screen-256color | |
| set -g status-keys vi | |
| set -g history-limit 10000 |
andrei14vl
/ upper_bound.cpp
Created
January 5, 2016 20:01
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <algorithm> | |
| using namespace std; | |
| struct MyType { | |
| int val; | |
| int extra; | |
| } arr[100]; | |
| bool cmp(int val, MyType my_object) { |
andrei14vl
/ Quad Combination
Created
November 13, 2015 06:58
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| The "Quad Combination" Problem | |
| Given an array of numbers arr and a number S, find 4 different numbers in arr that sum up to S. | |
| Write a function that gets arr and S and returns an array with 4 indices of such numbers in arr, or null if no such combination exists. | |
| Explain and code the most efficient solution possible, and analyze its runtime and space complexity. | |
| Solution | |
| The naive solution is to iterate on every possible combination of 4 numbers from arr until the required combination if found. Using 4 nested loop involves O(n4) time complexity and O(1) space complexity. This is quite inefficient. |