938:) is one of the best places on the web to find and practice programming problems. All you have to do to view the list of questions is click the View Questions link on the home page to open the Questions page shown in Figure 18-1. What’s more, you’ll find problems to practice that are asked of interviewees at various large companies, including Facebook, Google, LinkedIn, Amazon, and many others. Just click one of the companies listed in the Companies section on the right side of the Questions page. If you want to get the most out of the LeetCode site, sign up for a membership. LeetCode gives you the option of signing up for a monthly plan if you only want to use it while you’re looking for a job, or for a yearly plan if you want to use LeetCode as a resource for one calendar year. As of this writing, the monthly subscription costs $ 35 per month and the yearly subscription costs $ 159 per year."
992:
verify the correctness of the code, and the tests of many questions have comprehensive considerations for extreme boundary conditions, complexity and performance requirements. In order to ensure the correctness of the code, you must develop a practice of reviewing the questions when doing the questions 2. There are many and new languages supported. LeetCode will regularly update the versions of supported languages to ensure that the latest language features can be used. 3. Discussion The content is rich. LeetCode now has two versions, Chinese and
English, and the comments under each version are very rich. By reading other people’s comments, we can deepen our understanding of the topic and gain new ideas. Of course, LeetCode also has some shortcomings, such as the topic There are too many, not concise enough, and there are too few exercises related to strings, etc."
1072:. LeetCode is a popular Question Pool website (QP). Such websites provide various coding questions on different topics (array, algorithm, sorting, etc) along with corresponding tests to check correctness. ... LeetCode also provides a publicly available API to fetch submission details. Figure 2a shows an example LeetCode question, named Longest Increasing Path in a Matrix. The question contains information like the input (m x n integers matrix), the expected output (the length of the longest increasing path in a matrix), and any assumptions (no wrap-around). Each question also comes with a coding environment to submit solutions, shown in Figure 2b. This coding environment contains the function name (longestIncreasingPath) and parameters (self, matrix) with clear details into the type of each parameter."
317:- Practical note: this is actually a second nomination, it was previously deleted under the name "LeetCode" in 2016. If this article is kept this time, the article should be moved to LeetCode, which currently exists as a redirect but was previously deleted. Now, to notability: Sourcing looks worse than I assumed it would. Part of the issue here is that LeetCode is ubiquitous in tech blogs and online discussions, so there are many passing mentions: 500+ hits on Google Scholar, dozens on Google Books, etc. that make finding significant coverage challenging. There has been comparatively little coverage in the mainstream or business press (e.g. see the paragraph description of the product in the New York Times). There are articles like
1146:
trivial to import packages outside the standard library or to run tests via go test. With Python, it’s not obvious how to run tests using the unittest package. The free version restricts the number of
Playgrounds (currently 10); the paid subscription removes this restriction and offers a host of other features, such as debugging and autocompletion. Figure A-4 shows a LeetCode window with JavaScript code from Chapter 1. The test in the code has been deliberately broken test to illustrate how test failures appear in LeetCode."
849:
students to learn programming, testing and debugging, with realistic industry‐interview used programming problems. The browser‐based platform is easily accessible. Some of our students even worked on problems on smartphones in their spare time. ... A good grade on LeetCode challenge implies a student’s continuous, diligent and fruitful working on LeedCode problem solving, which requires not only spending time online, but thinking in computation, and efficient coding and debugging capability."
945:, you have to sign up for an account by clicking on the Create Account button shown in Figure 8-2. After you create an account, you can sign in by clicking the Sign In link in the upper-right corner of the screen. Like Codility, LeetCode has plenty of programming topics you can learn about, and you can take tests over and over again until you get a perfect score. You can also participate in contests against other LeetCode members. LeetCode also has several additional features: ..."
1222:
the user to type in code in a selected language. The code can be executed (to see how well it works) or critiqued by other users. LeetCode offers a path for anyone, from 10-year-old prodigies to mid-career switchers, to learn coding. It allows users to conduct mock job interviews with questions, rated by difficulty, that have been asked at specific companies. Other sites, such as HackerRank, InterviewBit, and
Topcoder, offer similar features."
988:: "LeetCode是推荐最多的算法题练习网站,本书的算法题也都精选自 LeetCode。我认为LeetCode有以下几个优点。 1.测试覆盖率高。在提交代码以后,LeetCode会跑很多测试来验证代 码的正确性,而且很多题目的测试对于极端边界情况、复杂度和性能的要 求都有全面的考虑。为了保证代码的正确性,做题目的时候要养成审题的 习惯,仔细分析题目的条件范围,不要因为极端案例导致程序失败。 2.支持的语言比较多和新。LeetCode会定期更新支持的语言的版本, 保证能够利用到最新的语言特性。 3.讨论内容丰富。LeetCode现在有中文和英文两个版本,每个版本下 的评论都很丰富,通过阅读他人的评论可以加深我们对题目的理解,获得 新的思路。 当然,LeetCode也有一些缺点,比如题目数量太多、不够精练,而与 字符串相关的练习题偏少等。"
1038:
companies. Demand for its services in China surged in 2018, so it set up a
Chinese site to operate independently in the local market. ... LeetCode has over 100 million annual code submissions, and roughly half of Chinese programmers are believed to be using the platform, with many colleges and universities using LeetCode questions for auxiliary teaching."
1106:
representative samples from other users along this distribution. We scraped all such available samples across 32 array problems, for a total of 1,836 code snippets. This allowed us to study real implementations of the same problem at variable run-times, and to isolate syntax as the cause of either high or low performance."
1182:
the larger public and to help software engineers prepare. I have been fortunate that the only time that I encountered a LeetCode problem during a screening process was for Amazon. As tedious as studying for LeetCode problems is, I have compiled steps that made solving them easier and faster as I was grinding algorithms."
1076:
snippets “meet various time and space restrictions and pass corner cases” for the given problem. Users are also able to see a history of their submission status for the current coding problem and any past code solutions submitted for the same question, as shown in Figure 2c. The possible statuses are: ..."
1181:
The book notes: "LeetCode is a platform that specializes in algorithm questions ranked from “Easy” to “Hard” based on the complexity of the subject and solution. They also have a forum where people share what interview questions they encountered in phone screens and on-site interviews to share with
991:
From Google
Translate: "LeetCode is the most recommended algorithm problem practice website, and the algorithm problems in this book are also selected from LeetCode. I think LeetCode has the following advantages. 1. High test coverage. After submitting the code , LeetCode will run a lot of tests to
1221:
The book notes: "The equivalent for software engineers is the “LeetCode interview." LeetCode is a popular coding and interview-prep website that offers engineers hundreds of typical technical questions and interview work assignments. The right side of the
Leetcode window is a code editor allowing
1075:
The book notes on page 2: "LeetCode’s coding environment also contains a set of test cases in multiple programming languages. Figure 2b shows the Python coding environment for testing a submission against LeetCode’s predefined set of test cases. ... LeetCode’s tests also ensure that submitted code
1064:
The article notes on page 1: "To evaluate the correctness of
Copilot’s suggestions, we use LeetCode, a question pool website, which provides us with the context needed to create Copilot queries (function name, parameters, input, and output of the function) as well as test cases that we can use to
848:
The article notes: "LeetCode is a website for preparing and practicing programming interviews. It has 200 questions spanning many aspects in computer programming. All are rated based on difficulties. Users can type in source code and submit for testing online. LeetCode makes a good venue for our
704:
LeetCode stands as a widely recognized and exceptional company, with a reputation that echoes through the software engineering communities of the US, India, and China. This website has left an indelible mark, aiding countless engineers globally in realizing their career aspirations and setting a
1145:
The book notes: "LeetCode encourages social interaction with other developers with coding contests, challenges, and discussions. The “Playground” feature allows you to write code in several languages, including Go, JavaScript, and Python. However, there are some limitations. With Go, it is not
705:
benchmark within the industry. Despite their limited engagement in self-promotion, their prominence remains undeniable. A brief exploration would affirm this fact. Considering their extensive user base and substantial industry influence, they undoubtedly fulfill the criteria with distinction.
1037:
The article notes: "LeetCode, a US startup that helps prepare software engineers for job interviews, has secured funding of nearly USD10 million from
Lightspeed China Partners. ... Founded in Silicon Valley in 2011, LeetCode’s questions are widely used in interviews by major internet and tech
1105:
The article notes: "Leetcode is an online platform for practicing algorithmic coding challenges designed to prepare software engineers for technical interviews. After a correct solution is submitted, leetcode provides a distribution of accepted solutions according to run-time, along with
581:), but I'm also not aware of any site with editorial oversight that writes traditional "reviews" for sites/products like this. Instead, I notice a number of informal discussions of the product "where author describes personal opinions and experiences" in books from publishers like
593:. None of the individual sources comprises more than a few paragraphs (and in the case of the academic sources usually 1-2 sentences); I would love to see someone uncover a source that discusses LeetCode in more depth relative to its many competitors.
1065:
evaluate correctness of the suggestions. LeetCode questions come with test cases in various programming languages, allowing us to assess the correctness of
Copilot’s suggestions in 4 different languages (Python, Java, JavaScript, and C)."
368:
Dice.com is a commercial website. I do not see any editorial guidelines and there is no indication of editorial oversight. While it is possible to use it for citing content, it would not be considered reliable to establish notability.
772:
I am confused. Your statement of "I understand that this doesn't meet
Knowledge (XXG)'s strict standard for notability" is an agreement that it should be deleted. I am unsure of why it should be kept then unless this is a
749:
I understand that this doesn't meet Knowledge (XXG)'s strict standard for notability, but let's be honest, since that standard was written, most sources that would have covered Leetcode have gone out of business.
751:
202:
477:
No, I just asked because you said that you ran a search and did not find enough acceptable sources, but you did not review all of the Google Scholar results. I just wanted to know and clarify. -
1008:
777:
vote. Your argument is saying you disagree with community consensus on notability guidelines, not that this page doesn't meet them. Let me know if I misunderstood what you are saying. --
683:
159:
668:
at least based on user counts and general popularity. The article reads a bit like it is about the company behind the service, so it might benefit a bit from a bit of cleanup.
519:
511:
515:
274:
270:
266:
1086:
SPLASH Companion 2020: Companion Proceedings of the 2020 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity
589:(Apress). The two books cited plus the coverage in the New York Times and Business Insider together comprise significant coverage of the product and its use to meet
463:). It would be on you to present which specific Google Scholar articles meet that guideline. Your argument would be similar to me telling someone "check Google." --
808:
196:
941:
The book further notes in a later chapter: "Leetcode is also a popular site for programmers who want to get up to speed. When you open the LeetCode website at
91:
106:
1231:
799:
507:
262:
52:. I have low-weighted a lot of weak Keep !votes, particularly those not based on relevant notability guidelines, but there is still consensus here.
615:. Also, none of what you described adds up to significant coverage so I must be misunderstanding your assessment of the notability requirements. --
1022:
318:
1278:
1201:
1171:
1125:
964:
916:
611:
So it fails NCORP but we should keep it anyway is what I believe you are saying. I am not sure what guideline would allow that other than
1089:
1048:
712:
384:
238:
86:
79:
17:
455:
To clarify, I have not. Am I required to? You presented an argument that Google Scholar contains the in-depth coverage required by
1002:
From Google Translate: "LeetCode (力扣) originated in Silicon Valley, USA, and is one of the earliest Online Judge (OJ) platforms."
1251:
350:- this is a well-known site which should have enough support from the current references and others available online such as
100:
96:
1274:
1247:
727:
351:
835:
427:
Finding it difficult to believe is not an argument for AfD. We present our opinions based on guidelines and policies. --
132:
127:
1313:
217:
40:
163:
136:
184:
1276:
119:
1190:
How Do You Fight a Horse-Sized Duck?: Secrets to Succeeding at Interview Mind Games and Getting the Job You Want
809:"Computational Thinking Guided Programming Training for Oversea Students with Diverse Computer Literacy Skills"
1243:
708:
570:
716:
482:
446:
406:
388:
359:
242:
178:
1309:
1043:
Nguyen, Nhan; Nadi, Sarah (2022-10-17). "An Empirical Evaluation of GitHub Copilot's Code Suggestions".
735:
690:
673:
305:
282:
250:
36:
322:
295:
957:
669:
1292:
1018:
866:
326:
174:
541:
456:
1296:
1264:
1194:
892:
870:
786:
763:
739:
720:
694:
677:
650:
646:
624:
602:
598:
553:
531:
527:
486:
472:
450:
436:
410:
392:
378:
363:
342:
338:
309:
286:
254:
210:
61:
1013:
638:
1256:
884:
782:
759:
620:
549:
468:
432:
374:
590:
562:
224:
1198:
1168:
1122:
1112:
961:
913:
909:
903:
828:
582:
478:
442:
402:
355:
233:
By IP: I suggest this article be nominated for AfD since it does not show why this website is
75:
29:
The following discussion is an archived debate of the proposed deletion of the article below.
1308:
Subsequent comments should be made on the appropriate discussion page (such as the article's
1188:
985:
951:
774:
329:
which would be unreliable for politics but may be reliable for business news (inferring from
54:
35:
Subsequent comments should be made on the appropriate discussion page (such as the article's
1260:
1235:
1160:
1093:
1052:
996:
888:
820:
731:
686:
301:
278:
246:
58:
665:
612:
330:
1283:
1118:
857:
586:
1045:
MSR '22: Proceedings of the 19th International Conference on Mining Software Repositories
574:
642:
594:
523:
334:
875:
Good catch, the publisher (Science and Engineering Publishing Company) is included on
352:
https://www.dice.com/career-advice/coding-and-whiteboard-job-interviews-how-to-prepare
237:. The only reliable source here is the Business Insider article, which is not enough.
234:
190:
880:
778:
755:
616:
545:
464:
428:
370:
123:
569:
at all. Is the product/site notable? I was only able to find some non-reliable blog
1213:
1137:
1079:
The book notes on page 4: "LeetCode stops execution at the first failed test case."
976:
928:
153:
1084:
Kolak, Sophia (2020-11-15). "Detecting Performance Patterns with Deep Learning".
1280:
plus book sources brought up above should suggest that this website is notable.
441:
So to clarify, have you actually reviewed all 500+ results on Google Scholar? -
398:
1009:"IT Job Interview Prepper LeetCode Pockets USD10 Million From Lightspeed China"
824:
1164:
1114:
Learning Test-Driven Development: A Polyglot Guide to Writing Uncluttered Code
831:
401:. I find it difficult to believe the subject would not meet on notability. -
397:
That was just an example. Please do a search on Google Scholar for LeetCode:
1097:
1056:
578:
1153:
A Software Engineer’s Guide to Seniority: A Guide to Technical Leadership
115:
67:
1156:
540:- References on the page and those I found in a search did not meet
637:
passes NCORP. The individual book sources, for example, contribute
383:
I'm not sure a single paragraph is enough to establish notability.
752:
Category:Defunct computer magazines published in the United States
854:
This appears to be an article published to a predatory journal.
1304:
The above discussion is preserved as an archive of the debate.
813:
Journal of Information Technology and Application in Education
876:
999:: "LeetCode (力扣) 起源于美国硅谷,是最早的在线评测(Online Judge, OJ)平台之一。"
1244:
Knowledge (XXG):Notability#General notability guideline
942:
935:
460:
149:
145:
141:
209:
807:
Cui, Cong; Dossetov, Ualkikhan; Wei, Songjie (2015).
798:
per the significant coverage in multiple independent
1273:, reliable sources with significant coverage found:
565:; I was unable to find any in-depth coverage of the
223:
43:). No further edits should be made to this page.
1316:). No further edits should be made to this page.
682:I don't think that a high user count is enough.
506:Note: This discussion has been included in the
261:Note: This discussion has been included in the
1007:Liao, Shumin (2021-12-01). Litting, Tom (ed.).
664:Leetcode is a popular site and should meet the
399:https://scholar.google.com/scholar?q=leetcode
8:
107:Help, my article got nominated for deletion!
883:. I've stricken this source from the list.
1246:, which requires "significant coverage in
706:
505:
260:
325:, which is published by a subsidiary of
934:The book notes: "The LeetCode website (
629:Apologies for the lack of clarity: the
18:Knowledge (XXG):Articles for deletion
7:
1090:Association for Computing Machinery
1049:Association for Computing Machinery
905:Programming Interviews For Dummies
902:Sonmez, John; Butow, Eric (2020).
24:
1230:There is sufficient coverage in
510:lists for the following topics:
265:lists for the following topics:
92:Introduction to deletion process
1155:. Wilmington, North Carolina:
1068:The article notes on page 2: "
1:
245:) 22:59, 8 August 2023 (UTC)
1187:Poundstone, William (2021).
1297:13:48, 15 August 2023 (UTC)
1265:08:48, 15 August 2023 (UTC)
893:06:35, 16 August 2023 (UTC)
871:13:39, 15 August 2023 (UTC)
787:19:00, 14 August 2023 (UTC)
764:11:16, 13 August 2023 (UTC)
740:05:52, 13 August 2023 (UTC)
721:04:05, 13 August 2023 (UTC)
695:06:00, 13 August 2023 (UTC)
678:20:59, 12 August 2023 (UTC)
651:23:31, 11 August 2023 (UTC)
625:22:39, 11 August 2023 (UTC)
603:22:12, 11 August 2023 (UTC)
554:07:20, 11 August 2023 (UTC)
532:18:11, 10 August 2023 (UTC)
487:22:46, 11 August 2023 (UTC)
473:22:29, 11 August 2023 (UTC)
451:22:06, 11 August 2023 (UTC)
437:20:48, 11 August 2023 (UTC)
411:15:04, 11 August 2023 (UTC)
393:08:14, 11 August 2023 (UTC)
379:07:19, 11 August 2023 (UTC)
364:17:17, 10 August 2023 (UTC)
343:16:40, 10 August 2023 (UTC)
310:13:34, 10 August 2023 (UTC)
287:13:29, 10 August 2023 (UTC)
255:13:27, 10 August 2023 (UTC)
82:(AfD)? Read these primers!
62:20:35, 17 August 2023 (UTC)
1333:
1117:. Sebastopol, California:
825:10.14355/jitae.2015.04.008
319:this one from Yicai Global
1239:
1165:10.1007/978-1-4842-8783-5
1111:Siddiqui, Saleem (2022).
726:Hm. But is that what the
321:that seems to me to meet
1306:Please do not modify it.
1151:Harper, Jocelyn (2023).
912:. pp. 108–109, 219–220.
459:(a guideline you called
300:to join the discussion.
32:Please do not modify it.
1098:10.1145/3426430.3428132
1057:10.1145/3524842.3528470
956:(in Chinese). Beijing:
908:. Hoboken, New Jersey:
164:edits since nomination
950:Wu, Jiang 吴江 (2021).
633:fails NCORP, but the
80:Articles for deletion
1019:Shanghai Media Group
943:https://leetcode.com
936:https://leetcode.com
561:- The company fails
327:Shanghai Media Group
1234:to allow LeetCode (
1195:Little, Brown Spark
55:(non-admin closure)
1203:978-0-316-49457-1
1173:978-1-4842-8782-8
1127:978-1-098-10647-8
966:978-7-115-55198-6
918:978-1-119-56502-4
723:
711:comment added by
641:product reviews.
534:
289:
97:Guide to deletion
87:How to contribute
57:
1324:
1290:
1288:
1254:of the subject".
1248:reliable sources
1241:
1232:reliable sources
1217:
1211:
1210:
1177:
1141:
1135:
1134:
1101:
1060:
1033:
1031:
1030:
1021:. Archived from
980:
974:
973:
958:Beijing Book Co.
932:
926:
925:
864:
862:
846:
844:
843:
834:. Archived from
800:reliable sources
728:reliable sources
508:deletion sorting
299:
263:deletion sorting
228:
227:
213:
157:
139:
77:
53:
34:
1332:
1331:
1327:
1326:
1325:
1323:
1322:
1321:
1320:
1314:deletion review
1284:
1281:
1208:
1206:
1204:
1186:
1174:
1150:
1132:
1130:
1128:
1121:. pp. 220–221.
1110:
1083:
1042:
1028:
1026:
1006:
971:
969:
967:
949:
923:
921:
919:
901:
858:
855:
841:
839:
806:
587:Springer Nature
293:
170:
130:
114:
111:
74:
71:
48:The result was
41:deletion review
30:
22:
21:
20:
12:
11:
5:
1330:
1328:
1319:
1318:
1300:
1299:
1268:
1228:
1226:
1225:
1224:
1202:
1184:
1172:
1148:
1126:
1119:O'Reilly Media
1108:
1081:
1040:
1004:
965:
953:高效制胜：程序员面试典型题解
947:
917:
899:
898:
897:
896:
895:
792:
791:
790:
789:
767:
766:
744:
743:
742:
699:
698:
697:
658:
657:
656:
655:
654:
653:
606:
605:
556:
535:
502:
501:
500:
499:
498:
497:
496:
495:
494:
493:
492:
491:
490:
489:
418:
417:
416:
415:
414:
413:
381:
345:
312:
290:
231:
230:
167:
110:
109:
104:
94:
89:
72:
70:
65:
46:
45:
25:
23:
15:
14:
13:
10:
9:
6:
4:
3:
2:
1329:
1317:
1315:
1311:
1307:
1302:
1301:
1298:
1294:
1289:
1287:
1279:
1277:
1275:
1272:
1269:
1267:
1266:
1262:
1258:
1253:
1249:
1245:
1237:
1233:
1229:
1227:
1223:
1219:
1215:
1205:
1200:
1196:
1192:
1191:
1185:
1183:
1179:
1175:
1170:
1166:
1162:
1158:
1154:
1149:
1147:
1143:
1139:
1129:
1124:
1120:
1116:
1115:
1109:
1107:
1103:
1099:
1095:
1091:
1087:
1082:
1080:
1077:
1073:
1071:
1066:
1062:
1058:
1054:
1050:
1046:
1041:
1039:
1035:
1025:on 2023-08-15
1024:
1020:
1016:
1015:
1010:
1005:
1003:
1000:
998:
993:
989:
987:
982:
978:
968:
963:
959:
955:
954:
948:
946:
944:
939:
937:
930:
920:
915:
911:
907:
906:
900:
894:
890:
886:
882:
878:
874:
873:
872:
868:
863:
861:
853:
852:
851:
850:
838:on 2018-06-03
837:
833:
830:
826:
822:
818:
814:
810:
804:
803:
801:
797:
794:
793:
788:
784:
780:
776:
771:
770:
769:
768:
765:
761:
757:
756:Sean Brunnock
753:
748:
745:
741:
737:
733:
729:
725:
724:
722:
718:
714:
710:
703:
700:
696:
692:
688:
685:
681:
680:
679:
675:
671:
667:
663:
660:
659:
652:
648:
644:
640:
636:
632:
628:
627:
626:
622:
618:
614:
610:
609:
608:
607:
604:
600:
596:
592:
588:
584:
580:
576:
572:
568:
564:
560:
557:
555:
551:
547:
543:
539:
536:
533:
529:
525:
521:
517:
513:
509:
504:
503:
488:
484:
480:
476:
475:
474:
470:
466:
462:
458:
454:
453:
452:
448:
444:
440:
439:
438:
434:
430:
426:
425:
424:
423:
422:
421:
420:
419:
412:
408:
404:
400:
396:
395:
394:
390:
386:
382:
380:
376:
372:
367:
366:
365:
361:
357:
353:
349:
346:
344:
340:
336:
332:
328:
324:
320:
316:
313:
311:
307:
303:
297:
291:
288:
284:
280:
276:
272:
268:
264:
259:
258:
257:
256:
252:
248:
244:
240:
236:
226:
222:
219:
216:
212:
208:
204:
201:
198:
195:
192:
189:
186:
183:
180:
176:
173:
172:Find sources:
168:
165:
161:
155:
151:
147:
143:
138:
134:
129:
125:
121:
117:
113:
112:
108:
105:
102:
98:
95:
93:
90:
88:
85:
84:
83:
81:
76:
69:
66:
64:
63:
60:
56:
51:
44:
42:
38:
33:
27:
26:
19:
1305:
1303:
1285:
1270:
1255:
1220:
1218:
1214:Google Books
1207:. Retrieved
1193:. New York:
1189:
1180:
1178:
1152:
1144:
1142:
1138:Google Books
1131:. Retrieved
1113:
1104:
1102:
1085:
1078:
1074:
1069:
1067:
1063:
1061:
1044:
1036:
1034:
1027:. Retrieved
1023:the original
1014:Yicai Global
1012:
1001:
994:
990:
983:
981:
977:Google Books
970:. Retrieved
952:
940:
933:
929:Google Books
922:. Retrieved
904:
881:Beall's List
859:
847:
840:. Retrieved
836:the original
816:
812:
805:
795:
746:
713:98.47.209.29
707:— Preceding
701:
661:
634:
630:
566:
558:
537:
479:Indefensible
443:Indefensible
403:Indefensible
385:93.72.49.123
356:Indefensible
347:
314:
296:93.72.49.123
239:93.72.49.123
232:
220:
214:
206:
199:
193:
187:
181:
171:
73:
49:
47:
31:
28:
1252:independent
1051:. pp. 1–5.
877:the website
732:NotAGenious
702:Strong Keep
687:NotAGenious
670:Anton.bersh
461:"imperfect"
323:WP:NPRODUCT
302:NotAGenious
279:NotAGenious
247:NotAGenious
197:free images
59:Actualcpscm
1293:talk to me
1242:) to pass
1209:2023-08-15
1133:2023-08-15
1029:2023-08-15
972:2023-08-15
924:2023-08-15
867:talk to me
842:2023-08-15
542:WP:ORGCRIT
457:WP:ORGCRIT
1310:talk page
1250:that are
1159:. p. 20.
995:The book
984:The book
832:2227-6459
819:: 59–60.
643:Suriname0
639:WP:SIGCOV
595:Suriname0
559:Weak Keep
524:Suriname0
520:Computing
512:Companies
335:Suriname0
292:Inviting
37:talk page
1312:or in a
1286:Deadbeef
1070:LeetCode
860:Deadbeef
779:CNMall41
709:unsigned
617:CNMall41
591:WP:NCORP
563:WP:NCORP
546:CNMall41
516:Products
465:CNMall41
429:CNMall41
371:CNMall41
275:Websites
271:Software
267:Internet
160:View log
116:Leetcode
101:glossary
68:Leetcode
39:or in a
1236:Chinese
775:WP:LIKE
635:product
631:company
571:reviews
567:company
518:, and
315:Comment
273:, and
235:notable
203:WP refs
191:scholar
133:protect
128:history
78:New to
1257:Cunard
1212:– via
1157:Apress
1136:– via
975:– via
927:– via
885:Cunard
684:WP:BIG
666:WP:GNG
613:WP:IAR
573:(e.g.
538:Delete
331:WP:RSP
175:Google
137:delete
997:notes
986:notes
910:Wiley
730:say?
583:Wiley
218:JSTOR
179:books
154:views
146:watch
142:links
16:<
1291:→∞ (
1271:keep
1261:talk
1199:ISBN
1169:ISBN
1123:ISBN
962:ISBN
914:ISBN
889:talk
865:→∞ (
829:ISSN
796:Keep
783:talk
760:talk
747:Keep
736:talk
717:talk
691:talk
674:talk
662:Keep
647:talk
621:talk
599:talk
585:and
550:talk
544:. --
528:talk
483:talk
469:talk
447:talk
433:talk
407:talk
389:talk
375:talk
360:talk
354:. -
348:Keep
339:talk
306:talk
283:talk
251:talk
243:talk
211:FENS
185:news
150:logs
124:talk
120:edit
50:keep
1161:doi
1094:doi
1053:doi
879:of
821:doi
333:).
225:TWL
158:– (
1295:)
1282:0x
1263:)
1240:力扣
1238::
1197:.
1167:.
1092:.
1088:.
1047:.
1017:.
1011:.
960:.
891:)
869:)
856:0x
827:.
815:.
811:.
802:.
785:)
762:)
754:.
738:)
719:)
693:)
676:)
649:)
623:)
601:)
577:,
552:)
530:)
522:.
514:,
485:)
471:)
449:)
435:)
409:)
391:)
377:)
369:--
362:)
341:)
308:)
285:)
277:.
269:,
253:)
205:)
162:|
152:|
148:|
144:|
140:|
135:|
131:|
126:|
122:|
1259:(
1216:.
1176:.
1163::
1140:.
1100:.
1096::
1059:.
1055::
1032:.
979:.
931:.
887:(
845:.
823::
817:4
781:(
758:(
734:(
715:(
689:(
672:(
645:(
619:(
597:(
579:2
575:1
548:(
526:(
481:(
467:(
445:(
431:(
405:(
387:(
373:(
358:(
337:(
304:(
298::
294:@
281:(
249:(
241:(
229:)
221:·
215:·
207:·
200:·
194:·
188:·
182:·
177:(
169:(
166:)
156:)
118:(
103:)
99:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.