대충이라도 하자

Number of Provinces -> Here is how I solved this problem. class Solution { public int findCircleNum(int[][] isConnected) { int count = 0; boolean [] visited = new boolean[isConnected.length]; for(int i = 0; i

Path Compression Optimization - Disjoint Set : find function을 최적화함 ***Recursion // UnionFind.class class UnionFind { private int[] root; public UnionFind(int size) { root = new int[size]; for (int i = 0; i < size; i++) { root[i] = i; } } public int find(int x) { if (x == root[x]) { return x; } return root[x] = find(root[x]); } public void union(int x, int y) { int rootX = find(x); int rootY = fi..

Elasticsearch는 자바로 이루어져 있기 때문에 자바가 설치되어 있어야 한다. 그리고 그 중에서는 java8(내가 현재 가지고 있는 버전)이 아니라 java11이 설치되어 있어야 한다. 1. 자바 11 설치 - 이전 버전 삭제하고 , 오라클에서 java 11 다운 ( 오라클에 가입해야 다운받을 수 있다. 귀찮.....ㅜㅜ) - JAVA_HOME 및 Path 설정 꼭 필요!!! 2. Elasticsearch 설치 https://www.elastic.co/kr/downloads/elasticsearch Download Elasticsearch Download Elasticsearch or the complete Elastic Stack (formerly ELK stack) for free and st..

Note that others might refer to it as an algorithm. In this Explore Card, the term “disjoint set” refers to a data structure. The primary use of disjoint sets is to address the connectivity between the components of a network. The “network“ here can be a computer network or a social network. For instance, we can use a disjoint set to determine if two people share a common ancestor. Parent node: ..

There are many types of “graphs”. In this Explore Card, we will introduce three types of graphs: undirected graphs, directed graphs, and weighted graphs. Undirected graphs The edges between any two vertices in an “undirected graph” do not have a direction, indicating a two-way relationship. Directed graphs The edges between any two vertices in a “directed graph” graph are directional. Weighted g..

Height Checker 자꾸 단순 구현으로 풀려고 하넼ㅋㅋㅋ(32.12%, 16.85%) import java.util.*; class Solution { public int heightChecker(int[] heights) { int result= 0; int[] expected = new int[heights.length]; for(int i = 0;i

In-Place Operations These are very important from an interviewing standpoint. In-place Array operations are where we modify an Array, without creating a new Array. : inserting and removing items by shifting existing items along. In programming interviews, the interviewer often expects you to minimise the time and space complexity of your implementation. In-place Array operations help to reduce s..

Search in an Array There's more than one way of searching an Array, but for now, we're going to focus on the simplest way. Searching means to find an occurrence of a particular element in the Array and return its position. We might need to search an Array to find out whether or not an element is present in the Array. We might also want to search an Array that is arranged in a specific fashion to..