Skip to content

Instantly share code, notes, and snippets.

View ajinkyajawale14499's full-sized avatar
🎯
Focusing

Ajinkya ajinkyajawale14499

🎯
Focusing
View GitHub Profile
@ajinkyajawale14499
ajinkyajawale14499 / System Design.md
Created October 13, 2020 18:54 — forked from vasanthk/System Design.md
System Design Cheatsheet

System Design Cheatsheet

Picking the right architecture = Picking the right battles + Managing trade-offs

Basic Steps

  1. Clarify and agree on the scope of the system
  • User cases (description of sequences of events that, taken together, lead to a system doing something useful)
    • Who is going to use it?
    • How are they going to use it?
@ajinkyajawale14499
ajinkyajawale14499 / interviewQuestions.md
Created June 16, 2020 13:27 — forked from petkovicm/interviewQuestions.md
Junior Full-Stack Job Interview

Junior Full-Stack Developer

This is a compilation of questions that we have stumbled upon in our job interviews. None of the questions are generic or borrowed from internet, they are real questions. Me and the other authors (@rudiaj, manny) have decided not to log company names, as that would spoil the idea of the interview itself.

Question type

The questions come from multiple interviews for Full-Stack, Front-End and Back-End positions. All interviews were Junior Level. Most of the questions (level 1) deal with pretty basic stuff and serve a functional purpose of eliminating candidates that do not have a certain level of overall and precise knowledge. A smaller amount of questions are harder (level 2), and they are usually meant to test the way you solve problems. These questions are more important in the eyes of the employer, and this part of the test is often performed live or over a video call. These level 2 questions are almost always in the form of a programming task. The idea being that you are

@ajinkyajawale14499
ajinkyajawale14499 / docker-help.md
Created June 14, 2020 07:05 — forked from bradtraversy/docker-help.md
Docker Commands, Help & Tips

Docker Commands, Help & Tips

Show commands & management commands

$ docker

Docker version info

// A Smooth Sea Never Made a Skilled Sailor //
import React from 'react';
import { connect } from 'react-redux';
import { checkStationAvailability } from '../../util/APIUtils';
import './AddChargingStation.css';
import { link } from 'react-router-dom';
import {
STATION_NAME, STATION_MIN_LENGTH, STATION_MAX_LENGTH, ADDRESS_MAX_LENGTH, COUNTRY, STATE,CITY, ZIPCODE, CONTACT_PERSON_NAME, CONTACT_NUMBER
} from'../../constants';
@ajinkyajawale14499
ajinkyajawale14499 / mat.c
Created November 6, 2019 20:16
number pattern printing with matrix
#include <stdio.h>
int main(void)
{
int m,n;
//accept the number 'n' from the user
printf ("ENTER the value of n");
printf ("\n");
scanf("%d",&n);
m=n;
int a[n][n];
@ajinkyajawale14499
ajinkyajawale14499 / DFS_Disconnected.java
Created August 9, 2019 19:58
Depth First Search in Disconnected Graph
import java.util.*;
import java.io.*;
public class Graph
{
int V;
LinkedList<Integer> list[];
Graph(int V){
this.V=V;
@ajinkyajawale14499
ajinkyajawale14499 / DFScycle.java
Created August 9, 2019 19:13
Detect Cycle in a Directed Graph using DFS
import java.util.*;
import java.io.*;
public class Graph{
int V;
LinkedList<Integer> list[];
Graph(int V){
this.V=V;
list = new LinkedList[V];
@ajinkyajawale14499
ajinkyajawale14499 / DFS.java
Created August 9, 2019 17:36
Depth First Search of a graph
import java.util.LinkedList;
import java.util.Stack;
public class Graph{
int V;
LinkedList<Integer> List[];
public Graph(int V){
this.V=V;
List=new LinkedList[V];
@ajinkyajawale14499
ajinkyajawale14499 / max_depth.cpp
Created August 6, 2019 11:05
Sum of nodes at maximum depth of a Binary Tree
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int sum;
int maxlevel=INT_MIN;
class node{
public: int data;
node* left;
node* right;
@ajinkyajawale14499
ajinkyajawale14499 / maxdepth.cpp
Created August 6, 2019 09:29
max depth of binary tree
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
class node{
public: int data;
node* left;
node* right;
node(int data)
{
this->data = data;