Skip to content

feyza-droid/leetcode_solutions

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

34 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Python solutions to LeetCode problems.

Milestones

  • 30/30
  • 42/50

LeetCode, Cracking the Coding Interview Questions

https://leetcode.com/discuss/general-discussion/1152824/cracking-the-coding-interview-6th-edition-in-leetcode

Arrays and Strings

  • 1.1 Is Unique -> 217. Contains Duplicate (similar)
  • 1.2 Check Permutation -> 242. Valid Anagram (same)
  • [-] 1.3 URLify (not in leetcode)
  • [-] 1.4 Palindrome Permutation -> 266. Palindrome Permutation (same) (premium)
  • [-] 1.5 One Away -> 161. One Edit Distance (same) (premium)
  • 1.6 String Compression -> 443. String Compression (same)
  • 1.7 Rotate Matrix -> 48. Rotate Image (same)
  • 1.8 Zero Matrix -> 73. Set Matrix Zeroes (same)
  • 1.9 String Rotation -> 796. Rotate String (same)

Linked Lists

  • [-] 2.1 Remove Dups -> 1836. Remove Duplicates From an Unsorted Linked List (same) (premium)
  • 2.2 Return Kth to Last -> 19. Remove Nth Node From End of List (similar)
  • 2.3 Delete Middle Node -> 237. Delete Node in a Linked List (same)
  • 2.4 Partition -> 86. Partition List (same)
  • 2.5 Sum Lists -> 2. Add Two Numbers (same)
  • 2.6 Palindrome -> 234. Palindrome Linked List (same)
  • 2.7 Intersection -> 160. Intersection of Two Linked Lists (same)
  • 2.8 Loop Detection -> 142. Linked List Cycle II (same)

Stacks and Queues

  • 3.2 Stack Min -> 155. Min Stack (same)
  • 3.3 Stack of Plates -> 1172. Dinner Plate Stacks (same)
  • 3.4 Queue via Stacks -> 232. Implement Queue using Stacks (same)

Trees and Graphs

  • 4.1 Route Between Nodes -> 1971. Find if Path Exists in Graph (similar)
  • 4.2 Minimal Tree -> 108. Convert Sorted Array to Binary Search Tree
  • 4.3 List of Depths -> 102. Binary Tree Level Order Traversal
  • 4.4 Check Balanced -> 110. Balanced Binary Tree
  • 4.5 Validate BST -> 98. Validate Binary Search Tree
  • 4.6 Successor -> 510. Inorder Successor in BST II
  • 4.7 Build Order -> 210. Course Schedule II
  • 4.8 First Common Ancestor -> 236. Lowest Common Ancestor of a Binary Tree
  • 4.9 BST Sequences -> 1569. Number of Ways to Reorder Array to Get Same BST
  • 4.10 Check Subtree -> 572. Subtree of Another Tree
  • 4.12 Paths with Sum -> 437. Path Sum III

Recursion and Dynamic Programming

  • 8.1 Triple Step -> 11137. N-th Tribonacci Number (same)
  • 8.2 Robot in a Grid -> 63. Unique Paths II (same)
  • 8.4 Power Set -> 78. Subsets (same)
  • 8.5 Recursive Multiply -> 29. Divide Two Integers (similar)
  • 8.7 Permutation without Dups -> 46. Permutations
  • 8.8 Permutation with Duplicates -> 47. Permutations II (same)
  • 8.9 Parens -> 22. Generate Parentheses (same)
  • 8.10 Paint Fill -> 733. Flood Fill (same)
  • 8.11 Coins -> 518. Coin Change 2 (same)
  • 8.12 Eight Queens -> 51. N-Queens (same)
  • 8.13 Stack of Boxes -> 1691. Maximum Height by Stacking Cuboids

Sorting and Searching

  • 10.1 Sorted Merge -> 88. Merge Sorted Array (same)
  • 10.2 Group Anagrams -> 49. Group Anagrams (same)
  • 10.3 Search in Rotated Array -> 81. Search in Rotated Sorted Array II (same)
  • 10.4 Sorted Search -> 702. Search in a Sorted Array of Unknown Size (same)
  • 10.7 Missing Int -> 268. Missing Number
  • 10.8 Find Duplicates -> 287. Find the Duplicate Number (same)
  • 10.9 Sorted Matrix Search -> 240. Search a 2D Matrix II (same)
  • 10.10 Rank from Stream -> 703. Kth Largest Element in a Stream
  • 10.11 Peaks and Valleys -> 280. Wiggle Sort (same)

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages