TIW: In Place Swapping
Among my very little interview experience, I’ve seen this type of question twice. In general, you are given an array (maybe 1D, 2D or higher), and you need t...
Recent Posts
TIW: STL #3
I will dedicate this post to two functions in particular: upper_bound and lower_bound. They make the impossible become possible. Basic facts about them:
TIW: STL #2
This should be a relatively easy post. Things covered: auto, iterator, sort, next permutation, reverse and swap. If you know all of these you can skip.
TIW: STL #1
This post in a nutshell: vector<vector<pair<int, map<int, set<int> > > > > nutshell(n, vector<pair<int, map<int, set...
Index: Tech Interview Walkthrough
In order to prove the worth of this site, I am planning to write a series of posts about writing clean code in CS tech interviews. The entire series will foc...
CS201 Project: Tank War
Dec 2021 Edit: I stopped running the server because of the log4shell exploit that affects most Java applications.
cout « "Hello World!" « endl;
Hello World!