Arunav Konwar arunavkonwar

nylas/N1 💌 An extensible desktop mail app built on the modern web.
black-screen/black-screen A terminal emulator for the 21st century.
shockone/black-screen A terminal emulator for the 21st century.
ptmt/react-native-macos React Native for macOS
docker/kitematic Visual Docker Container Management on Mac & Windows
kitematic/kitematic Visual Docker Container Management on Mac & Windows
davezuko/wirk-starter Get started with React, Redux, and React-Router!
TelescopeJS/Telescope 🔭 An open-source social news app built with Meteor & React
coryhouse/react-slingshot React + Redux starter kit / boile

1. Learn in public

If there's a golden rule, it's this one, so I put it first. All the other rules are more or less elaborations of this rule #1.

You already know that you will never be done learning. But most people "learn in private", and lurk. They consume content without creating any themselves. Again, that's fine, but we're here to talk about being in the top quintile. What you do here is to have a habit of creating learning exhaust. Write blogs and tutorials and cheatsheets. Speak at meetups and conferences. Ask and answer things on Stackoverflow or Reddit. (Avoid the walled gardens like Slack and Discourse, they're not public). Make Youtube videos or Twitch streams. Start a newsletter. Draw cartoons (people loooove cartoons!). Whatever your thing is, make the thing you wish you had found when you were learning. Don't judge your results by "claps" or retweets or stars or upvotes - just talk to yourself from 3 months ago. I keep an almost-daily dev blog written for no one else but me.

Guess what? It

	from tkinter import *
	from PIL import ImageTk,Image
	import time
	import os

	targetImageWidth = 850
	targetImageHeight = 400

	inputImageWidth = 0
	inputImageHeight = 0

	#include <bits/stdc++.h>

	using namespace std;

	int main(){
	int n;
	string s;
	cin>>n;
	for(int i=0;i<n;i++){
	cin>>s;

	#include <iostream>

	using namespace std;

	int main(){
	long long n,m,a,rows,columns;
	cin>> n >> m >> a;
	rows=m/a;
	if(m%a) rows++;
	columns=n/a;

	#include <bits/stdc++.h>

	using namespace std;

	int main(){
	int n,c;
	cin >> n;
	// vector<int> types(n);
	int type[6]={0};
	for(int i=0;i<n;i++){

	#include <bits/stdc++.h>

	using namespace std;

	vector < int > getRecord(vector < int > s){
	// Complete this function
	int highCount=0, lowCount=0;
	int highNo=s[0];
	int lowNo=s[0];
	for(int i=1; i<s.size(); i++){

	#include <bits/stdc++.h>

	using namespace std;

	vector < int > solve(vector < int > grades){
	// Complete this function
	for(int i=0;i<grades.size();i++){
	int a=grades[i]%5;
	if(a>=3){
	if(grades[i]+5-a>=40){

	#include <map>
	#include <set>
	#include <list>
	#include <cmath>
	#include <ctime>
	#include <deque>
	#include <queue>
	#include <stack>
	#include <string>
	#include <bitset>