PageSourceSearch

https://wekruit-tech.web.app/assets/codingProblems-CSiAVW1c.js

js wekruit-tech.web.app collected 2026-10-03 12:39:58 UTC 17,537 bytes, 1 lines download raw bytes

1const e=[{id:"1",title:"Two Sum",difficulty:"Easy",category:"Array",completed:!1,leetcodeNumber:1,leetcodeUrl:"https://leetcode.com/problems/two-sum/"},{id:"2",title:"Add Two Numbers",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:2,leetcodeUrl:"https://leetcode.com/problems/add-two-numbers/"},{id:"3",title:"Longest Substring Without Repeating Characters",difficulty:"Medium",category:"String",completed:!1,leetcodeNumber:3,leetcodeUrl:"https://leetcode.com/problems/longest-substring-without-repeating-characters/"},{id:"4",title:"Median of Two Sorted Arrays",difficulty:"Hard",category:"Array",completed:!1,leetcodeNumber:4,leetcodeUrl:"https://leetcode.com/problems/median-of-two-sorted-arrays/"},{id:"5",title:"Longest Palindromic Substring",difficulty:"Medium",category:"String",completed:!1,leetcodeNumber:5,leetcodeUrl:"https://leetcode.com/problems/longest-palindromic-substring/"},{id:"6",title:"Zigzag Conversion",difficulty:"Medium",category:"String",completed:!1,leetcodeNumber:6,leetcodeUrl:"https://leetcode.com/problems/zigzag-conversion/"},{id:"7",title:"Reverse Integer",difficulty:"Medium",category:"Math",completed:!1,leetcodeNumber:7,leetcodeUrl:"https://leetcode.com/problems/reverse-integer/"},{id:"8",title:"String to Integer (atoi)",difficulty:"Medium",category:"String",completed:!1,leetcodeNumber:8,leetcodeUrl:"https://leetcode.com/problems/string-to-integer-atoi/"},{id:"9",title:"Palindrome Number",difficulty:"Easy",category:"Math",completed:!1,leetcodeNumber:9,leetcodeUrl:"https://leetcode.com/problems/palindrome-number/"},{id:"10",title:"Regular Expression Matching",difficulty:"Hard",category:"Dynamic Programming",completed:!1,leetcodeNumber:10,leetcodeUrl:"https://leetcode.com/problems/regular-expression-matching/"},{id:"11",title:"Container With Most Water",difficulty:"Medium",category:"Two Pointers",completed:!1,leetcodeNumber:11,leetcodeUrl:"https://leetcode.com/problems/container-with-most-water/"},{id:"12",title:"Integer to Roman",difficulty:"Medium",category:"Math",completed:!1,leetcodeNumber:12,leetcodeUrl:"https://leetcode.com/problems/integer-to-roman/"},{id:"13",title:"Roman to Integer",difficulty:"Easy",category:"Math",completed:!1,leetcodeNumber:13,leetcodeUrl:"https://leetcode.com/problems/roman-to-integer/"},{id:"14",title:"Longest Common Prefix",difficulty:"Easy",category:"String",completed:!1,leetcodeNumber:14,leetcodeUrl:"https://leetcode.com/problems/longest-common-prefix/"},{id:"15",title:"3Sum",difficulty:"Medium",category:"Two Pointers",completed:!1,leetcodeNumber:15,leetcodeUrl:"https://leetcode.com/problems/3sum/"},{id:"16",title:"3Sum Closest",difficulty:"Medium",category:"Two Pointers",completed:!1,leetcodeNumber:16,leetcodeUrl:"https://leetcode.com/problems/3sum-closest/"},{id:"17",title:"Letter Combinations of a Phone Number",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:17,leetcodeUrl:"https://leetcode.com/problems/letter-combinations-of-a-phone-number/"},{id:"18",title:"4Sum",difficulty:"Medium",category:"Two Pointers",completed:!1,leetcodeNumber:18,leetcodeUrl:"https://leetcode.com/problems/4sum/"},{id:"19",title:"Remove Nth Node From End of List",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:19,leetcodeUrl:"https://leetcode.com/problems/remove-nth-node-from-end-of-list/"},{id:"20",title:"Valid Parentheses",difficulty:"Easy",category:"Stack",completed:!1,leetcodeNumber:20,leetcodeUrl:"https://leetcode.com/problems/valid-parentheses/"},{id:"21",title:"Merge Two Sorted Lists",difficulty:"Easy",category:"Linked List",completed:!1,leetcodeNumber:21,leetcodeUrl:"https://leetcode.com/problems/merge-two-sorted-lists/"},{id:"22",title:"Generate Parentheses",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:22,leetcodeUrl:"https://leetcode.com/problems/generate-parentheses/"},{id:"23",title:"Merge k Sorted Lists",difficulty:"Hard",category:"Linked List",completed:!1,leetcodeNumber:23,leetcodeUrl:"https://leetcode.com/problems/merge-k-sorted-lists/"},{id:"24",title:"Swap Nodes in Pairs",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:24,leetcodeUrl:"https://leetcode.com/problems/swap-nodes-in-pairs/"},{id:"25",title:"Reverse Nodes in k-Group",difficulty:"Hard",category:"Linked List",completed:!1,leetcodeNumber:25,leetcodeUrl:"https://leetcode.com/problems/reverse-nodes-in-k-group/"},{id:"26",title:"Remove Duplicates from Sorted Array",difficulty:"Easy",category:"Array",completed:!1,leetcodeNumber:26,leetcodeUrl:"https://leetcode.com/problems/remove-duplicates-from-sorted-array/"},{id:"27",title:"Remove Element",difficulty:"Easy",category:"Array",completed:!1,leetcodeNumber:27,leetcodeUrl:"https://leetcode.com/problems/remove-element/"},{id:"28",title:"Find the Index of the First Occurrence in a String",difficulty:"Easy",category:"String",completed:!1,leetcodeNumber:28,leetcodeUrl:"https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/"},{id:"29",title:"Divide Two Integers",difficulty:"Medium",category:"Math",completed:!1,leetcodeNumber:29,leetcodeUrl:"https://leetcode.com/problems/divide-two-integers/"},{id:"30",title:"Substring with Concatenation of All Words",difficulty:"Hard",category:"String",completed:!1,leetcodeNumber:30,leetcodeUrl:"https://leetcode.com/problems/substring-with-concatenation-of-all-words/"},{id:"31",title:"Next Permutation",difficulty:"Medium",category:"Array",completed:!1,leetcodeNumber:31,leetcodeUrl:"https://leetcode.com/problems/next-permutation/"},{id:"32",title:"Longest Valid Parentheses",difficulty:"Hard",category:"Dynamic Programming",completed:!1,leetcodeNumber:32,leetcodeUrl:"https://leetcode.com/problems/longest-valid-parentheses/"},{id:"33",title:"Search in Rotated Sorted Array",difficulty:"Medium",category:"Binary Search",completed:!1,leetcodeNumber:33,leetcodeUrl:"https://leetcode.com/problems/search-in-rotated-sorted-array/"},{id:"34",title:"Find First and Last Position of Element in Sorted Array",difficulty:"Medium",category:"Binary Search",completed:!1,leetcodeNumber:34,leetcodeUrl:"https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/"},{id:"35",title:"Search Insert Position",difficulty:"Easy",category:"Binary Search",completed:!1,leetcodeNumber:35,leetcodeUrl:"https://leetcode.com/problems/search-insert-position/"},{id:"36",title:"Valid Sudoku",difficulty:"Medium",category:"Hash Table",completed:!1,leetcodeNumber:36,leetcodeUrl:"https://leetcode.com/problems/valid-sudoku/"},{id:"37",title:"Sudoku Solver",difficulty:"Hard",category:"Backtracking",completed:!1,leetcodeNumber:37,leetcodeUrl:"https://leetcode.com/problems/sudoku-solver/"},{id:"38",title:"Count and Say",difficulty:"Medium",category:"String",completed:!1,leetcodeNumber:38,leetcodeUrl:"https://leetcode.com/problems/count-and-say/"},{id:"39",title:"Combination Sum",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:39,leetcodeUrl:"https://leetcode.com/problems/combination-sum/"},{id:"40",title:"Combination Sum II",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:40,leetcodeUrl:"https://leetcode.com/problems/combination-sum-ii/"},{id:"41",title:"First Missing Positive",difficulty:"Hard",category:"Array",completed:!1,leetcodeNumber:41,leetcodeUrl:"https://leetcode.com/problems/first-missing-positive/"},{id:"42",title:"Trapping Rain Water",difficulty:"Hard",category:"Two Pointers",completed:!1,leetcodeNumber:42,leetcodeUrl:"https://leetcode.com/problems/trapping-rain-water/"},{id:"43",title:"Multiply Strings",difficulty:"Medium",category:"String",completed:!1,leetcodeNumber:43,leetcodeUrl:"https://leetcode.com/problems/multiply-strings/"},{id:"44",title:"Wildcard Matching",difficulty:"Hard",category:"Dynamic Programming",completed:!1,leetcodeNumber:44,leetcodeUrl:"https://leetcode.com/problems/wildcard-matching/"},{id:"45",title:"Jump Game II",difficulty:"Medium",category:"Greedy",completed:!1,leetcodeNumber:45,leetcodeUrl:"https://leetcode.com/problems/jump-game-ii/"},{id:"46",title:"Permutations",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:46,leetcodeUrl:"https://leetcode.com/problems/permutations/"},{id:"47",title:"Permutations II",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:47,leetcodeUrl:"https://leetcode.com/problems/permutations-ii/"},{id:"48",title:"Rotate Image",difficulty:"Medium",category:"Array",completed:!1,leetcodeNumber:48,leetcodeUrl:"https://leetcode.com/problems/rotate-image/"},{id:"49",title:"Group Anagrams",difficulty:"Medium",category:"Hash Table",completed:!1,leetcodeNumber:49,leetcodeUrl:"https://leetcode.com/problems/group-anagrams/"},{id:"50",title:"Pow(x, n)",difficulty:"Medium",category:"Math",completed:!1,leetcodeNumber:50,leetcodeUrl:"https://leetcode.com/problems/powx-n/"},{id:"51",title:"N-Queens",difficulty:"Hard",category:"Backtracking",completed:!1,leetcodeNumber:51,leetcodeUrl:"https://leetcode.com/problems/n-queens/"},{id:"52",title:"N-Queens II",difficulty:"Hard",category:"Backtracking",completed:!1,leetcodeNumber:52,leetcodeUrl:"https://leetcode.com/problems/n-queens-ii/"},{id:"53",title:"Maximum Subarray",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:53,leetcodeUrl:"https://leetcode.com/problems/maximum-subarray/"},{id:"54",title:"Spiral Matrix",difficulty:"Medium",category:"Array",completed:!1,leetcodeNumber:54,leetcodeUrl:"https://leetcode.com/problems/spiral-matrix/"},{id:"55",title:"Jump Game",difficulty:"Medium",category:"Greedy",completed:!1,leetcodeNumber:55,leetcodeUrl:"https://leetcode.com/problems/jump-game/"},{id:"56",title:"Merge Intervals",difficulty:"Medium",category:"Intervals",completed:!1,leetcodeNumber:56,leetcodeUrl:"https://leetcode.com/problems/merge-intervals/"},{id:"57",title:"Insert Interval",difficulty:"Medium",category:"Intervals",completed:!1,leetcodeNumber:57,leetcodeUrl:"https://leetcode.com/problems/insert-interval/"},{id:"58",title:"Length of Last Word",difficulty:"Easy",category:"String",completed:!1,leetcodeNumber:58,leetcodeUrl:"https://leetcode.com/problems/length-of-last-word/"},{id:"59",title:"Spiral Matrix II",difficulty:"Medium",category:"Array",completed:!1,leetcodeNumber:59,leetcodeUrl:"https://leetcode.com/problems/spiral-matrix-ii/"},{id:"60",title:"Permutation Sequence",difficulty:"Hard",category:"Math",completed:!1,leetcodeNumber:60,leetcodeUrl:"https://leetcode.com/problems/permutation-sequence/"},{id:"61",title:"Rotate List",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:61,leetcodeUrl:"https://leetcode.com/problems/rotate-list/"},{id:"62",title:"Unique Paths",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:62,leetcodeUrl:"https://leetcode.com/problems/unique-paths/"},{id:"63",title:"Unique Paths II",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:63,leetcodeUrl:"https://leetcode.com/problems/unique-paths-ii/"},{id:"64",title:"Minimum Path Sum",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:64,leetcodeUrl:"https://leetcode.com/problems/minimum-path-sum/"},{id:"65",title:"Valid Number",difficulty:"Hard",category:"String",completed:!1,leetcodeNumber:65,leetcodeUrl:"https://leetcode.com/problems/valid-number/"},{id:"66",title:"Plus One",difficulty:"Easy",category:"Array",completed:!1,leetcodeNumber:66,leetcodeUrl:"https://leetcode.com/problems/plus-one/"},{id:"67",title:"Add Binary",difficulty:"Easy",category:"String",completed:!1,leetcodeNumber:67,leetcodeUrl:"https://leetcode.com/problems/add-binary/"},{id:"68",title:"Text Justification",difficulty:"Hard",category:"String",completed:!1,leetcodeNumber:68,leetcodeUrl:"https://leetcode.com/problems/text-justification/"},{id:"69",title:"Sqrt(x)",difficulty:"Easy",category:"Binary Search",completed:!1,leetcodeNumber:69,leetcodeUrl:"https://leetcode.com/problems/sqrtx/"},{id:"70",title:"Climbing Stairs",difficulty:"Easy",category:"Dynamic Programming",completed:!1,leetcodeNumber:70,leetcodeUrl:"https://leetcode.com/problems/climbing-stairs/"},{id:"71",title:"Simplify Path",difficulty:"Medium",category:"Stack",completed:!1,leetcodeNumber:71,leetcodeUrl:"https://leetcode.com/problems/simplify-path/"},{id:"72",title:"Edit Distance",difficulty:"Hard",category:"Dynamic Programming",completed:!1,leetcodeNumber:72,leetcodeUrl:"https://leetcode.com/problems/edit-distance/"},{id:"73",title:"Set Matrix Zeroes",difficulty:"Medium",category:"Array",completed:!1,leetcodeNumber:73,leetcodeUrl:"https://leetcode.com/problems/set-matrix-zeroes
1/"},{id:"74",title:"Search a 2D Matrix",difficulty:"Medium",category:"Binary Search",completed:!1,leetcodeNumber:74,leetcodeUrl:"https://leetcode.com/problems/search-a-2d-matrix/"},{id:"75",title:"Sort Colors",difficulty:"Medium",category:"Two Pointers",completed:!1,leetcodeNumber:75,leetcodeUrl:"https://leetcode.com/problems/sort-colors/"},{id:"76",title:"Minimum Window Substring",difficulty:"Hard",category:"Sliding Window",completed:!1,leetcodeNumber:76,leetcodeUrl:"https://leetcode.com/problems/minimum-window-substring/"},{id:"77",title:"Combinations",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:77,leetcodeUrl:"https://leetcode.com/problems/combinations/"},{id:"78",title:"Subsets",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:78,leetcodeUrl:"https://leetcode.com/problems/subsets/"},{id:"79",title:"Word Search",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:79,leetcodeUrl:"https://leetcode.com/problems/word-search/"},{id:"80",title:"Remove Duplicates from Sorted Array II",difficulty:"Medium",category:"Array",completed:!1,leetcodeNumber:80,leetcodeUrl:"https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/"},{id:"81",title:"Search in Rotated Sorted Array II",difficulty:"Medium",category:"Binary Search",completed:!1,leetcodeNumber:81,leetcodeUrl:"https://leetcode.com/problems/search-in-rotated-sorted-array-ii/"},{id:"82",title:"Remove Duplicates from Sorted List II",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:82,leetcodeUrl:"https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/"},{id:"83",title:"Remove Duplicates from Sorted List",difficulty:"Easy",category:"Linked List",completed:!1,leetcodeNumber:83,leetcodeUrl:"https://leetcode.com/problems/remove-duplicates-from-sorted-list/"},{id:"84",title:"Largest Rectangle in Histogram",difficulty:"Hard",category:"Stack",completed:!1,leetcodeNumber:84,leetcodeUrl:"https://leetcode.com/problems/largest-rectangle-in-histogram/"},{id:"85",title:"Maximal Rectangle",difficulty:"Hard",category:"Dynamic Programming",completed:!1,leetcodeNumber:85,leetcodeUrl:"https://leetcode.com/problems/maximal-rectangle/"},{id:"86",title:"Partition List",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:86,leetcodeUrl:"https://leetcode.com/problems/partition-list/"},{id:"87",title:"Scramble String",difficulty:"Hard",category:"Dynamic Programming",completed:!1,leetcodeNumber:87,leetcodeUrl:"https://leetcode.com/problems/scramble-string/"},{id:"88",title:"Merge Sorted Array",difficulty:"Easy",category:"Array",completed:!1,leetcodeNumber:88,leetcodeUrl:"https://leetcode.com/problems/merge-sorted-array/"},{id:"89",title:"Gray Code",difficulty:"Medium",category:"Bit Manipulation",completed:!1,leetcodeNumber:89,leetcodeUrl:"https://leetcode.com/problems/gray-code/"},{id:"90",title:"Subsets II",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:90,leetcodeUrl:"https://leetcode.com/problems/subsets-ii/"},{id:"91",title:"Decode Ways",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:91,leetcodeUrl:"https://leetcode.com/problems/decode-ways/"},{id:"92",title:"Reverse Linked List II",difficulty:"Medium",category:"Linked List",completed:!1,leetcodeNumber:92,leetcodeUrl:"https://leetcode.com/problems/reverse-linked-list-ii/"},{id:"93",title:"Restore IP Addresses",difficulty:"Medium",category:"Backtracking",completed:!1,leetcodeNumber:93,leetcodeUrl:"https://leetcode.com/problems/restore-ip-addresses/"},{id:"94",title:"Binary Tree Inorder Traversal",difficulty:"Easy",category:"Tree",completed:!1,leetcodeNumber:94,leetcodeUrl:"https://leetcode.com/problems/binary-tree-inorder-traversal/"},{id:"95",title:"Unique Binary Search Trees II",difficulty:"Medium",category:"Tree",completed:!1,leetcodeNumber:95,leetcodeUrl:"https://leetcode.com/problems/unique-binary-search-trees-ii/"},{id:"96",title:"Unique Binary Search Trees",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:96,leetcodeUrl:"https://leetcode.com/problems/unique-binary-search-trees/"},{id:"97",title:"Interleaving String",difficulty:"Medium",category:"Dynamic Programming",completed:!1,leetcodeNumber:97,leetcodeUrl:"https://leetcode.com/problems/interleaving-string/"},{id:"98",title:"Validate Binary Search Tree",difficulty:"Medium",category:"Tree",completed:!1,leetcodeNumber:98,leetcodeUrl:"https://leetcode.com/problems/validate-binary-search-tree/"},{id:"99",title:"Recover Binary Search Tree",difficulty:"Medium",category:"Tree",completed:!1,leetcodeNumber:99,leetcodeUrl:"https://leetcode.com/problems/recover-binary-search-tree/"},{id:"100",title:"Same Tree",difficulty:"Easy",category:"Tree",completed:!1,leetcodeNumber:100,leetcodeUrl:"https://leetcode.com/problems/same-tree/"}];export{e as codingProblems};

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.