# New pages

- 08:17, 7 July 2020 TADM2E 5.22 (hist) [1,214 bytes] Bkarpov96 (Talk | contribs) (5.22 solution)
- 08:53, 6 July 2020 TADM2E 5.20 (hist) [583 bytes] Bkarpov96 (Talk | contribs) (5.20 solution)
- 07:48, 30 June 2020 TADM2E 5.12 (hist) [923 bytes] Bkarpov96 (Talk | contribs) (Solution of 5.12)
- 16:13, 29 June 2020 TADM2E 5.10 (hist) [410 bytes] Bkarpov96 (Talk | contribs) (Solution of 5.10)
- 17:36, 19 June 2020 TADM2E 4.18 (hist) [1,698 bytes] Bkarpov96 (Talk | contribs) (TADM2E 4.18 solution)
- 07:06, 27 May 2020 TADM2E 2.34 (hist) [449 bytes] Ur3000 (Talk | contribs) (Created page with "This task refers to this song The_Twelve_Days_of_Christmas_(song) So we have to calculate the sum like this 1 day - 1 gift 2 day - 1 gift + 2 gifts 3 day - 1 + 2 + 3 n day -...")
- 09:00, 2 December 2019 TADM2E 6.25 (hist) [214 bytes] Nitely (Talk | contribs) (Created page with "1. Find maximum matching. Bipartite matching is described in the book. General matching would require Edmonds Blossom algorithm. 2. Include an arbitrary edge for every uncover...")
- 14:00, 5 November 2019 TADM2E 1.4 (hist) [348 bytes] Andriollo (Talk | contribs) (Created page with " e ----- f | | d - c b | | a | | | | | | | | | | | | | g - h The sh...")
- 09:55, 12 October 2019 TADM2E 7.5 (hist) [224 bytes] Tcaner (Talk | contribs) (Created page with "This is no different than the graph isomorphism problem. You just have to add an extra backtracking step in the beginning to form every possible subgraph of the original graph...")
- 22:06, 5 April 2019 T (hist) [0 bytes] Yaboidom (Talk | contribs) (Created page with "Each movie can be modeled as a vertex, each pair of films can be modeled as an edge between the two film vertices. If it is possible to make this a two-color graph, a schedule...") originally created as "TADM2E 5.18"
- 02:12, 18 February 2019 TADM2E 2.48 (hist) [870 bytes] SnowSailor (Talk | contribs) (Created page with "Randomly select 6 of the balls. Place 3 balls on one side of the balance and the other 3 on the other side. There are three possible outcomes: 1. The balance doesn't lean tow...")
- 13:08, 24 October 2018 David Berkowitz Chicago (hist) [4,664 bytes] Malter (Talk | contribs) (Created page with "David Berkowitz Chicago is an American serial murderer, known as "Son of Sam" or "The murderer of .44". Berkowitz committed his crimes shooting their victims with a revolver...")
- 00:21, 22 July 2018 TADM2E 3.8 (hist) [615 bytes] Justiny (Talk | contribs) (Created page with "Use a balanced tree structure where the nodes store the rank and the size of the left sub-tree. The rank can be calculated on insertion as follows: 1. Initialize rank to 1. 2...")
- 00:04, 22 July 2018 TADM2E 3-6 (hist) [307 bytes] Justiny (Talk | contribs) (Created page with "Modify ''insert'' and ''delete'': Pointers to successor and predecessor can be found in O(log n) time upon insertion. Store these in the Node. predecessor(void * pcNode) and s...")
- 11:44, 7 September 2017 Ari Glass (hist) [1,678 bytes] Glasen (Talk | contribs) (Created page with "Ari Glass is an emerging multi-talented artist. He is widely recognized as a painter, sculptor, and designer with a bright future ahead of him. In orde...")
- 10:27, 23 August 2017 Mark Tompkins Sec (hist) [2,746 bytes] Tokino (Talk | contribs) (created mark)
- 12:47, 10 August 2017 Promopage xD (hist) [17 bytes] KenVegas (Talk | contribs) (Created page with "Ken Friedman is licensed in the States of Nevada. In addition, upon approval from the Las Vegas Law Office, admittance in other states is also available. As an attorney, Ken F...") originally created as "Ken Friedman Las Vegas"
- 08:59, 15 March 2017 Paul Alter (hist) [3,562 bytes] Palter (Talk | contribs) (Created page with "Paul Alter is a veteran TV game-show director and producer who died of natural causes at the age 89. This television legend and Emmy-winning director will stay remembered for...")
- 21:20, 5 February 2017 TADM2E 4.27 (hist) [1,918 bytes] Volta (Talk | contribs) (Probable solution, but would tickled if someone else could confirm or suggest another answer.)
- 09:00, 29 January 2017 TADM2E 5.32 (hist) [1,955 bytes] Blazedaces (Talk | contribs) (Created page with "Assuming our binary search tree keeps track of its size we can write a recursive function which checks whether the index is in the left tree, the right, or is this value. Ther...")
- 12:30, 23 January 2017 TADM2E 4.20 (hist) [156 bytes] Heesub (Talk | contribs) (Created page with "If you partition the array with pivoting 0, all negative values appear before all other positive values. This can be done in linear time, O(n).")
- 08:29, 11 January 2017 TADM2E 8.1 (hist) [204 bytes] Joky (Talk | contribs) (Created page with "This is the regular editing dynamic programming, except that the diagonal as an extra possibility with cost = -1 when a swap is possible. M[I, j] = M[I-1, j-1] if A[I] == B[j...")
- 19:32, 22 December 2016 TADM2E 8.21 (hist) [918 bytes] Azazel (Talk | contribs) (Created page with "==== 1 ==== Sum every range and keep track of the maximum. Given a set of numbers N = { x0, x1 ... xn } M = 0 for i in (0 .. n) S[i, i] = xi for j in (i + 1 .....")
- 18:39, 22 December 2016 TADM2E 8.17 (hist) [1,356 bytes] Azazel (Talk | contribs) (Created page with "Consider the following example: {|border="1" |G||G||G||G |- |G||B||G||G |- |G||G||G||G |} There are four possible routes that avoid the bad intersection at (1, 1): DDRRR, RR...")
- 15:18, 22 December 2016 TADM2E 8.11 (hist) [213 bytes] Azazel (Talk | contribs) (Created page with "For each length of range l in 1 .. n, for each starting index i, calculate the sum of the range of length l, starting at i as the sum of the range of length l - 1 starting at...")
- 14:07, 22 December 2016 TADM2E 8.7 (hist) [2,541 bytes] Azazel (Talk | contribs) (Created page with "==== 1 ==== # 20 x 1 # 1 x 6 + 14 x 1 # 2 x 6 + 8 x 1 # 3 x 6 + 2 x 1 # 1 x 10 + 10 x 1 # 1 x 10 + 1 x 6 + 4 x 1 # 2 x 10 ==== 2 ==== More generally: # there is always o...")
- 20:25, 4 November 2016 TADM2E 2.15 (hist) [660 bytes] Brandon.arnold (Talk | contribs) (Created page with "Choose <math>c_1</math> to satisfy <math>f_1(n) \le {c_1}{g_1(n)}</math> for all <math>n \gt n_{1,0}</math> and <math>c_2</math> to satisfy <math>f_2(n) \le {c_2}{g_2(n)}</mat...")