Giter Site home page Giter Site logo

s4nd1x / competitive-interviews-programming Goto Github PK

View Code? Open in Web Editor NEW
0.0 2.0 1.0 323 KB

In this repository you can find the problems that I have solved to date, competitive programming and interviews.

Home Page: https://docs.google.com/spreadsheets/d/15uWAt2c561fYefbGcdLXA6xrv0KEx73iFstaQOWRAsg/edit#gid=84654839

C++ 90.40% Python 3.96% Java 5.64%
codeforces leetcode competitions competitive-programming interview

competitive-interviews-programming's Introduction

Competitive Programming and Interviews

In this repository you can find the problems that I have solved to date, competitive programming and interviews.

Repo banner

Background

At the beginning I did not take it so seriously and my general knowledge of other technologies was quite limited so now that I have acquired more skills I have decided to start from scratch and really have a study guide.

So if you want to checkout my newest solutions and how I'm going you can checkout either Fresh Start or AlgoExpert folders.

I'm keeping track of my progress using Dr Mostafa Saad Ibrahim Training Sheet, so if you want to checkout my current progress you can do it on the following sheet.

Tools

For all my problems 'll be using C++17, and just to keep record if this.

Compiler arguments:

Compile (F8): g++ -std=c++17 -Wshadow -Wall -o "%e" "%f" -O2 -Wno-unused-result

Build (F9): g++ -std=c++17 -Wshadow -Wall -o "%e" "%f" -g -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG

If you get compilation errors, try changing from c++17 to c++14 and/or removing sanitizers (two fsanitize flags).

C++17 Template:

#include <bits/stdc++. h>
using namespace std;
#define SPEED ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define INF 1e18
#define eps 0.00001
#define le length
#define debug(n1) cout << n1 << endl
#define rep0(i,n) for (i = 0; i < n; ++i)
#define rep(i , j , n) for(ll i = j ; i <= n ; i++)
#define per(i , j , n) for(ll i = j ; i >= n ; i--)
int main() {
SPEED;

return 0;
}

Theory Resources

  1. Competitive Programmer’s Handbook
  2. Math/DS Algorithms
  3. Leetcode

Practice Resources

  1. https://codeforces.com/
  2. https://leetcode.com/

Credits

competitive-interviews-programming's People

Contributors

s4nd1x avatar

Watchers

James Cloos avatar  avatar

Forkers

revaz-goguadze

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.