Sort Colors LeetCode Programming Solutions | LeetCode Problem Solutions in C++, Java, & Python [๐Ÿ’ฏCorrect]

by
LeetCode Programming Solution in C++, Java, & Python | LeetCode All Problem Solutions [Latest Updateโ€ผ๏ธ]

LeetCode Problem | LeetCode Problems For Beginners | LeetCode Problems & Solutions | Improve Problem Solving Skills | LeetCode Problems Java | LeetCode Solutions in C++

Hello Programmers/Coders, Today we are going to share solutions to the Programming problems of LeetCode Solutions in C++, Java, & Python. At Each Problem with Successful submission with all Test Cases Passed, you will get a score or marks and LeetCode Coins. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for the Sort Colors in C++, Java & Python-LeetCode problem. We are providing the correct and tested solutions to coding problems present on LeetCode. If you are not able to solve any problem, then you can take help from our Blog/website.

Use โ€œCtrl+Fโ€ To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A โ€œFindโ€ Option There. Use These Option to Get Any Random Questions Answer.

About LeetCode

LeetCode is one of the most well-known online judge platforms to help you enhance your skills, expand your knowledge and prepare for technical interviews. 

LeetCode is for software engineers who are looking to practice technical questions and advance their skills. Mastering the questions in each level on LeetCode is a good way to prepare for technical interviews and keep your skills sharp. They also have a repository of solutions with the reasoning behind each step.

LeetCode has over 1,900 questions for you to practice, covering many different programming concepts. Every coding problem has a classification of either Easy, Medium, or Hard.

LeetCode problems focus on algorithms and data structures. Here is some topic you can find problems on LeetCode:

  • Mathematics/Basic Logical Based Questions
  • Arrays
  • Strings
  • Hash Table
  • Dynamic Programming
  • Stack & Queue
  • Trees & Graphs
  • Greedy Algorithms
  • Breadth-First Search
  • Depth-First Search
  • Sorting & Searching
  • BST (Binary Search Tree)
  • Database
  • Linked List
  • Recursion, etc.

Leetcode has a huge number of test cases and questions from interviews too like Google, Amazon, Microsoft, Facebook, Adobe, Oracle, Linkedin, Goldman Sachs, etc. LeetCode helps you in getting a job in Top MNCs. To crack FAANG Companies, LeetCode problems can help you in building your logic.

Link for the Problem – Sort Colorsโ€“ LeetCode Problem

Sort Colorsโ€“ LeetCode Problem

Problem:

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.

We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.

You must solve this problem without using the library’s sort function.

Example 1:

Input: nums = [2,0,2,1,1,0]
Output: [0,0,1,1,2,2]

Example 2:

Input: nums = [2,0,1]
Output: [0,1,2]

Constraints:

  • n == nums.length
  • 1 <= n <= 300
  • nums[i] is either 0, 1, or 2.
Sort Colorsโ€“ LeetCode Solutions
Sort Colors in C++:
class Solution {
 public:
  void sortColors(vector<int>& nums) {
    int l = 0;                // next 0 should be put in l
    int r = nums.size() - 1;  // next 2 should be put in r

    for (int i = 0; i <= r;)
      if (nums[i] == 0)
        swap(nums[i++], nums[l++]);
      else if (nums[i] == 1)
        ++i;
      else
        // we may swap a 0 to index i, but we're still not sure whether
        // this 0 is put in the correct index, so we can't move pointer i
        swap(nums[i], nums[r--]);
  }
};
Sort Colors in Java:
class Solution {
  public void sortColors(int[] nums) {
    int l = 0;               // next 0 should be put in l
    int r = nums.length - 1; // next 2 should be put in r

    for (int i = 0; i <= r;)
      if (nums[i] == 0)
        swap(nums, i++, l++);
      else if (nums[i] == 1)
        ++i;
      else
        // we may swap a 0 to index i, but we're still not sure whether
        // this 0 is put in the correct index, so we can't move pointer i
        swap(nums, i, r--);
  }

  private void swap(int[] nums, int i, int j) {
    final int temp = nums[i];
    nums[i] = nums[j];
    nums[j] = temp;
  }
}
Sort Colors in Python:
class Solution:
  def sortColors(self, nums: List[int]) -> None:
    zero = -1
    one = -1
    two = -1

    for num in nums:
      if num == 0:
        two += 1
        one += 1
        zero += 1
        nums[two] = 2
        nums[one] = 1
        nums[zero] = 0
      elif num == 1:
        two += 1
        one += 1
        nums[two] = 2
        nums[one] = 1
      else:
        two += 1
        nums[two] = 2

471 thoughts on “Sort Colors LeetCode Programming Solutions | LeetCode Problem Solutions in C++, Java, & Python [๐Ÿ’ฏCorrect]”

  220. Fantastic piece! The article is both informative and interesting. Adding more visuals in your future content could be a great way to elevate the reader experience.

    Reply

  221. Thoroughly enjoyed your article! ๐Ÿ˜Š The insights are valuable, and adding more visuals in your future pieces could enhance the overall reader experience. ๐Ÿ“ท

    Reply

  257. ๐ŸŒŒ Wow, this blog is like a rocket launching into the galaxy of wonder! ๐ŸŽข The thrilling content here is a thrilling for the imagination, sparking curiosity at every turn. ๐ŸŒŸ Whether it’s lifestyle, this blog is a source of exciting insights! #MindBlown ๐Ÿš€ into this thrilling experience of discovery and let your imagination fly! ๐Ÿš€ Don’t just enjoy, immerse yourself in the excitement! #FuelForThought Your brain will thank you for this thrilling joyride through the realms of discovery! ๐ŸŒ

    Reply

  259. ๐Ÿ’ซ Wow, this blog is like a fantastic adventure soaring into the galaxy of wonder! ๐ŸŽข The captivating content here is a rollercoaster ride for the imagination, sparking curiosity at every turn. ๐ŸŽข Whether it’s technology, this blog is a treasure trove of inspiring insights! #InfinitePossibilities Dive into this exciting adventure of knowledge and let your thoughts soar! ๐Ÿš€ Don’t just explore, experience the thrill! ๐ŸŒˆ Your brain will be grateful for this exciting journey through the dimensions of endless wonder! โœจ

    Reply

  282. pragmatic-ko.com
    Fang Jifan์€ ์˜ˆ์˜ ๋ฐ”๋ฅด์ง€ ์•Š๊ณ  ์ง์ ‘ ์•ž์œผ๋กœ ๋‚˜์•„๊ฐ”์Šต๋‹ˆ๋‹ค. “๋‚˜๋Š” Dowager ํ™ฉํ›„์˜ ๊ฐ€๋ฅด์นจ์„ ๋“ฃ๊ฒ ์Šต๋‹ˆ๋‹ค.”

    Reply

  301. pragmatic-ko.com
    ์ฃผ์ง€์‚ฌ๋Š” ์ž์‹ ์˜ ์˜๋ฌด์— ์ถฉ์‹คํ–ˆ์œผ๋ฉฐ ์ด์™€ ๊ด€๋ จํ•˜์—ฌ ํ•ญ์ƒ ๊ด€๋Œ€ํ•œ ์ •์ฑ…์„ ์ฑ„ํƒํ–ˆ์Šต๋‹ˆ๋‹ค.

    Reply

  341. qiyezp.com
    ๊ทธ ๊ฒฐ๊ณผ ๋งŽ์€ ๊ฐ€์กฑ๋“ค์ด ๋งค๋ฌผ๋กœ ๋‚ด๋†“์€ ๋•…์„ ์ฒ ํšŒํ•˜๊ธฐ ์œ„ํ•ด ์น˜์•„ ๊ฐ€๊ฒŒ์— ๊ฐ€๊ธฐ ์‹œ์ž‘ํ–ˆ์Šต๋‹ˆ๋‹ค.

    Reply

  347. cougarsbkjersey.com
    ็ด ๆ™ดใ‚‰ใ—ใ„่จ˜ไบ‹ใ€‚้žๅธธใซๅฝน็ซ‹ใคๆƒ…ๅ ฑใ‚’ๆไพ›ใ—ใฆใใ‚Œใฆใ‚ใ‚ŠใŒใจใ†ใ”ใ–ใ„ใพใ™ใ€‚

    Reply

  389. onair2tv.com
    Hongzhi ํ™ฉ์ œ๋Š” ๋‹ค์‹œ ๊ณ ๊ฐœ๋ฅผ ์ €์œผ๋ฉฐ ์ƒ๊ฐํ–ˆ์Šต๋‹ˆ๋‹ค. ์‚ฌ๋žŒ๋“ค์€ ์—ฌ์ „ํžˆ \u200b\u200b๋‹น์‹ ์„ ๋จน๊ฒŒํ•ฉ๋‹ˆ๋‹ค *.

    Reply

  391. werankcities.com
    ๊ทธ๋ฅผ ํฅ๋ถ„์‹œํ‚ค๋Š” ๊ฒƒ์€ Fang Jifan์˜ ๊ฒธ์†ํ•จ์ž…๋‹ˆ๋‹ค.์ด ์•„์ด์˜ ์„ฑ๊ฒฉ์— ๋งค์šฐ ๋งŒ์กฑํ•ฉ๋‹ˆ๋‹ค.

    Reply

  397. ilogidis.com
    Zhu Houzhao๋Š” ๋‹ค์‹œ ์–ผ๊ตด์ด ํŒŒ๋ž—๊ฒŒ ๋ณ€ํ–ˆ๊ณ  ์˜ค๋žซ๋™์•ˆ ๋ง์„ค์ด๋ฉฐ “๋‚˜๋„ ๊ฐˆ๊ฑฐ์•ผ”๋ผ๊ณ  ๋งํ–ˆ์Šต๋‹ˆ๋‹ค.

    Reply

  399. lacolinaecuador.com
    ๋งˆ์ฐจ๊ฐ€ ํ˜„์˜ ๋™๋ฌธ์— ๋„์ฐฉํ•˜์ž ๋ˆ„๊ตฐ๊ฐ€ ์ฆ‰์‹œ Xiao Jing์˜ ๋ฐฐ์ง€๋ฅผ ๋“ค๊ณ  ํ˜‘์ƒ์— ๋‚˜์„ฐ์Šต๋‹ˆ๋‹ค.

    Reply

  435. ๋ ˆํ”„๋ฆฌ์นธ ๋ฆฌ์น˜์Šค
    Fang Jifan์€ ์•ž์œผ๋กœ ๋‚˜์•„๊ฐ€ ๊ทธ๋ฅผ ๊ฑท์–ด์ฐจ๋Š” ์ œ์Šค์ฒ˜๋ฅผ ์ทจํ–ˆ์Šต๋‹ˆ๋‹ค. “๊ฐœ์•ผ, ๋„ˆ๋ฌด ๋Š๋ ค.”Fang Jifan์€ ์‹ฌํ˜ธํก์„ํ–ˆ์Šต๋‹ˆ๋‹ค. “๊ฐํžˆ ํํ•˜์—๊ฒŒ ๋ฌผ์–ด๋ณด์‹ญ์‹œ์˜ค. ์ด ๋ถ„๋…ธ์˜ ์ด์œ ๊ฐ€ ๋ฌด์—‡์ž…๋‹ˆ๊นŒ?”

    Reply

  451. ๋งˆ์ข… ์›จ์ด์ฆˆ 2
    Hongzhi ํ™ฉ์ œ๋Š” ํ™”๋ฅผ ๋‚ด๋ฉฐ “์™œ ๋‚˜๋ฅผ ๋ง‰์ง€ ์•Š์•˜์Šต๋‹ˆ๊นŒ? “๋ผ๊ณ  ๋งํ–ˆ์Šต๋‹ˆ๋‹ค.Hongzhi ํ™ฉ์ œ๋Š” “๊ณต์ฃผ๊ฐ€ ๋‡Œ ์งˆํ™˜์„ ์•“๊ณ  ์žˆ์Šต๋‹ˆ๊นŒ? “๋ผ๊ณ  ๋‹นํ™ฉํ–ˆ์Šต๋‹ˆ๋‹ค.

    Reply

  466. EGGC
    ๊ทธ๋Š” “๋ˆ„๊ฐ€ ์กฐ์ˆ˜๊ฐ€ ๋ ๊นŒ์š”? ๊ทธ๋ฆฌ๊ณ  ์–ด๋–ป๊ฒŒ ์—ฌ๋‚˜์š”?”๋ผ๊ณ  ๋ฌป์ง€ ์•Š์„ ์ˆ˜ ์—†์—ˆ์Šต๋‹ˆ๋‹ค.

    Reply

Leave a Comment

Ads Blocker Image Powered by Code Help Pro

Ads Blocker Detected!!!

We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker๐Ÿ™.