ashishugi

package com.dummy_java.dummy.demo.iv_set.iv;

import java.util.*;

public class Application {
    public static HashMap<Integer, String> getSortedMap(HashMap<Integer, String> mp) {
        List<Map.Entry<Integer, String>> list = new ArrayList<>(mp.entrySet());

        Collections.sort(list, (Map.Entry<Integer, String> a, Map.Entry<Integer, String> b) -> {
            return (a.getValue()).compareTo(b.getValue());

ashishugi

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?

ashishugi

package com.dummy_java.dummy;

import java.util.ArrayList;
import java.util.List;

public class DisjointSet {
    List<Integer> parent = new ArrayList<>();
    List<Integer> rank = new ArrayList<>();
    List<Integer> size = new ArrayList<>();

ashishugi

Array

• Two Sum
• Best Time to Buy and Sell Stock
• Contains Duplicate
• Product of Array Except Self
• Maximum Subarray
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array

ashishugi

class Trie {
    public: 
    char ch;
    bool isEnd;
    Trie* child[26];
    Trie(){
        this->isEnd = false;
        for(int i=0;i<26;i++) {
            this->child[i] = NULL;
        }

ashishugi

class TrieTree {
    public: 
    char ch;
    bool isEnd;
    TrieTree* child[26];
    TrieTree (){
        isEnd = false;
        for(int i=0;i<26;i++) {
            this->child[i] = NULL;
        }