2018-02-06 TIL WPS. 22 Intermediate Models

##Many-to-Many에 대해서 조금 더 공부하기

2018-02-05 TIL WPS. 21 Models

모델 이해하기

Two Scoops of Django 1. 코딩 스타일

1장 코딩 스타일 가이드에 대해서

[Stage 11] Is Lucky?

Ticket numbers usually consist of an even number of digits. A ticket number is considered lucky if the sum of the first half of the digits is equal to the sum of the second half.

[Easy] String comparison(Failed)

https://practice.geeksforgeeks.org/problems/string-comparison/0/?ref=self

Two Scoops of Django 0. 시작하기 전에

지은이의 글

[Easy] Transform the array

Transform The Array 풀어보기

2018-02-02 TIL WPS. 20 Django Tutorial Polls

첫 번째 장고 앱 작성하기 part 1

[Stage 10] Common Character Count

Given two strings, find the number of common characters between them.

[Basic] Closest Number

Given two integers n and m. The problem is to find the number closest to n and divisible by m. If there are more than one such number, then output the one having maximum absolute value. If n is completely divisible by m(not equal to 0), then output n only. Time complexity of O(1) is required.

[Basic] Sum of two large Numbers

Given a string consisting of only 0, 1, A, B, C where
A = AND B = OR C = XOR Calculate the value of the string assuming no order of precedence and evaluation is done from left to right.

2018-02-01 TIL WPS 19. DjangoGirls tutorial 마무리

템플릿 확장하기 (template extending)

[Stage 9] All Longest String

Given an array of strings, return another array containing all of its longest strings.

[Basic] Sum of two large Numbers

Given two non-negative numbers X and Y. The task is calculate the sum of X and Y.

[Basic] Set Bits

Given a positive integer N, print count of set bits in it. For example, if the given number is 6, output should be 2 as there are two set bits in it.