6Companies30Days

KO | EN

gitlite — search

#javascript #python #nodejs #react #php #swift #express #machine-learning #graphql #deep-learning #css3 #html

6Companies30Days

★ 18 Open GitHub ↗

Challenge to solve 90 questions from 6 companies in 30 days. Solved 90/90.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

#RevisewithArsh #6Companies30days #dhindhora #stop #procastination
 
#ReviseWithArsh #6Companies30Days Challenge!

P.S This can be started anytime in the month of January.

For complete details , go through the video : https://www.youtube.com/watch?v=8ESo_bXhRC4

Let’s get started!

**Day 1-5 :**

Company Name : **Goldman Sachs**

**Day 6-10 :**

Company Name : **Amazon**

**Day 11-15 :**

Company Name : **Microsoft**

**Day 16-20 :**

Company Name : **Adobe**

**Day 21-25 :**

Company Name : **Intuit**

**Day 26-30 :**

Company Name : **Walmart**

<br>
<table>
  <thead>
    <th><b>Dates</th>
    <th><b>Company Name</th>
    <th><b>Link</th>
  </thead>
  <tr>
    <td><b>01-01-2022 - 05-01-2022</td>
    <td><b>Goldman Sachs</td>
    <td><a href="https://github.com/hiteshv01/6Companies30Days/tree/main/Goldman%20Sachs"> Check it out </a></td>
  </tr>
  <tr>
    <td><b>06-01-2022 - 10-01-2022</td>
    <td><b>Amazon</td>
    <td><a href="https://github.com/hiteshv01/6Companies30Days/tree/main/Amazon"> Check it out</a></td>
  </tr>
  <tr>
    <td><b>11-01-2022 - 15-01-2022</td>
    <td><b>Microsoft</td>
    <td><a href="https://github.com/hiteshv01/6Companies30Days/tree/main/Microsoft"> Check it out</a></td>
  </tr>
  <tr>
    <td><b>16-01-2022 - 20-01-2022</td>
    <td><b>Adobe</td>
    <td><a href="https://github.com/hiteshv01/6Companies30Days/tree/main/Adobe"> Check it out</a></td>
  </tr>
  <tr>
    <td><b>21-01-2022 - 25-01-2022</td>
    <td><b>Intuit</td>
    <td><a href="https://github.com/hiteshv01/6Companies30Days/tree/main/Intuit"> Check it out</a></td>
  </tr>
  <tr>
    <td><b>26-01-2022 - 30-01-2022</td>
    <td><b>Walmart</td>
    <td><a href="https://github.com/hiteshv01/6Companies30Days/tree/main/Walmart"> Check it out</a></td>
  </tr>
</table>
<br>

......................................................................................................................................................................

**Today, I am up with the challenge! 🚀 Dated : 30-01-2022**

......................................................................................................................................................................

<br>

## Problem Sets

<details>
<summary style="font-size: 1.2em">Goldman Sachs (15/15)</summary>

Sr  | [Problems](./goldman-sachs/README.md)                                                                                     | TryIt                                                                                                                                     | Status
----|---------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------|---------
1   | [Print Anagrams Together](./goldman-sachs/print-anagrams-together.md)                                                     | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/print-anagrams-together/1/#)                              | ✅
2   | [Overlapping Rectangles](./goldman-sachs/overlapping-rectangles1924.md)                                                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/overlapping-rectangles1924/1/)                            | ✅
3   | [Count the subarrays having product less than k](./goldman-sachs/count-the-subarrays-having-product-less-than-k1708.md)   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/1/)    | ✅
4   | [Run Length Encoding](./goldman-sachs/run-length-encoding.md)                                                             | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/run-length-encoding/1/)                                   | ✅
5   | [Ugly Number](./goldman-sachs/ugly-numbers2254.md)                                                                        | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/ugly-numbers2254/1/)                                      | ✅
6   | [Greatest Common Divisor of Strings](./goldman-sachs/greatest-common-divisor-of-strings.md)                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/greatest-common-divisor-of-strings/)                                     | ✅
7   | [Find the position of M-th item](./goldman-sachs/find-the-position-of-m-th-item1723.md)                                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/find-the-position-of-m-th-item1723/1#)                    | ✅
8   | [Total Decoding Messages](./goldman-sachs/total-decoding-messages1235.md)                                                 | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/total-decoding-messages1235/1/)                           | ✅
9   | [Number following a pattern](./goldman-sachs/number-following-a-pattern3126.md)                                           | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/number-following-a-pattern3126/1#)                        | ✅
10  | [Max 10 numbers in a list having 10M entries](./goldman-sachs/k-largest-elements3736.md)                                  | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/k-largest-elements3736/1)                                 | ✅
11  | [Find Missing And Repeating](./goldman-sachs/find-missing-and-repeating2512.md)                                           | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1/#)                       | ✅
12  | [Squares in N*N Chessboard](./goldman-sachs/squares-in-nn-chessboard1801.md)                                              | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/squares-in-nn-chessboard1801/1)                           | ✅
13  | [Decode the string](./goldman-sachs/decode-the-string2444.md)                                                             | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/decode-the-string2444/1)                                  | ✅
14  | [Minimum Size Subarray Sum](./goldman-sachs/minimum-size-subarray-sum.md)                                                 | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/minimum-size-subarray-sum/)                                              | ✅
15  | [Array Pair Sum Divisibility Problem](./goldman-sachs/array-pair-sum-divisibility-problem3257.md)                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem3257/1#)               | ✅

</details>

<details>
<summary style="font-size: 1.2em">Amazon (15/15)</summary>

Sr  | [Problems](./amazon/README.md)                                                                                | TryIt                                                                                                                                     | Status
----|---------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------------------------------------------------------------------|---------
1   | [Maximum Profit](./amazon/maximum-profit.md)                                                                  | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/maximum-profit4657/1)                                     | ✅
2   | [Longest Mountain in Array](./amazon/longest-mountain-in-array.md)                                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/longest-mountain-in-array/)                                              | ✅
3   | [IPL 2021 - Match Day 2](./amazon/ipl-2021-match-day-2.md)                                                    | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/deee0e8cf9910e7219f663c18d6d640ea0b87f87/1/)              | ✅
4   | [Brackets in Matrix Chain Multiplication](./brackets-in-matrix-chain-multiplication.md)                       | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/brackets-in-matrix-chain-multiplication1024/1/)           | ✅
5   | [Phone directory](./amazon/phone-directory.md)                                                                | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/phone-directory4628/1/)                                   | ✅
6   | [Maximum of all subarrays of size k](./amazon/maximum-of-all-subarrays-of-size.md)                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1)                 | ✅
7   | [First non-repeating character in a stream](./amazon/first-non-repeating-character-in-a-stream.md)            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1)          | ✅
8   | [Count ways to N'th Stair(Order does not matter)](./amazon/count-ways-to-nth-stairorder-does-not-matter.md)   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/count-ways-to-nth-stairorder-does-not-matter1322/1/)      | ✅
9   | [Is Sudoku Valid](./amazon/is-sudoku-valid.md)                                                                | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/is-sudoku-valid4820/1/)                                   | ✅
10  | [Nuts and Bolts Problem](./amazon/nuts-and-bolts-problem.md)                                                  | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/nuts-and-bolts-problem0431/1)                             | ✅
11  | [Serialize and Deserialize a Binary Tree](./amazon/serialize-and-deserialize-a-binary-tree.md)                | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/serialize-and-deserialize-a-binary-tree/1)                | ✅
12  | [Column name from a given column number](./amazon/column-name-from-a-given-column-number.md)                  | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/column-name-from-a-given-column-number4244/1/)            | ✅
13  | [Rotting Oranges](./amazon/rotting-oranges.md)                                                                | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/rotting-oranges/)                                                        | ✅
14  | [Burning Tree](./amazon/burning-tree.md)                                                                      | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/burning-tree/1/)                                          | ✅
15  | [Delete N nodes after M nodes of a linked list](./amazon/delete-n-nodes-after-m-nodes-of-a-linked-list.md)    | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/1/)         | ✅

</details>

<details>
<summary style="font-size: 1.2em">Microsoft (15/15)</summary>

Sr  | [Problems](./microsoft/README.md)                                                                     | TryIt                                                                                                                                     | Status
----|---------------------------------------------------------------------------------------                |-------------------------------------------------------------------------------------------------------------------------------------------|---------
1   | [Minimum sum partition](./microsoft/minimum-sum-partition.md)                                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/minimum-sum-partition3317/1/)                             | ✅
2   | [Prerequisite Tasks](./microsoft/prerequisite-tasks.md)                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/prerequisite-tasks/1/)                                    | ✅
3   | [Rotate by 90 degree](./microsoft/rotate-by-90-degree.md)                                             | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/rotate-by-90-degree0356/1/)                               | ✅
4   | [Spirally traversing a matrix](./microsoft/spirally-traversing-a-matrix.md)                           | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/spirally-traversing-a-matrix-1587115621/1/)               | ✅
5   | [Stock span problem](./microsoft/stock-span-problem.md)                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/stock-span-problem-1587115621/1)                          | ✅
6   | [Possible Words From Phone Digits](./microsoft/possible-words-from-phone-digits.md)                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/possible-words-from-phone-digits-1587115620/1/)           | ✅
7   | [Unit Area of largest region of 1's](./microsoft/length-of-largest-region-of-1s.md)                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/length-of-largest-region-of-1s-1587115620/1/)             | ✅
8   | [Connect Nodes at Same Level](./microsoft/connect-nodes-at-same-level.md)                             | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/connect-nodes-at-same-level/1/)                           | ✅
9   | [Count Number of SubTrees having given Sum](./microsoft/count-number-of-subtrees-having-given-sum.md) | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/count-number-of-subtrees-having-given-sum/1/)             | ✅
10  | [Stickler Thief](./microsoft/stickler-theif.md)                                                       | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/stickler-theif-1587115621/1/)                             | ✅
11  | [Generate Binary Numbers](./microsoft/generate-binary-numbers.md)                                     | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/generate-binary-numbers-1587115620/1/)                    | ✅
12  | [Find All Four Sum Numbers](./microsoft/find-all-four-sum-numbers.md)                                 | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1)                          | ✅
13  | [Bridge edge in a graph](./microsoft/bridge-edge-in-graph.md)                                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/bridge-edge-in-graph/1)                                   | ✅
14  | [Minimum steps to destination](./microsoft/minimum-steps-to-destination.md)                           | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/minimum-number-of-steps-to-reach-a-given-number5234/1/)   | ✅
15  | [Alien Dictionary](./microsoft/alien-dictionary.md)                                                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/alien-dictionary/1/)                                      | ✅

</details>

<details open>
<summary style="font-size: 1.2em">Adobe (15/15)</summary>

Sr  | [Problems](./adobe/README.md)                                                                             | TryIt                                                                                                                                                                 | Status
----|-----------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------------------------------------------|---------
1   | [Subarray with given sum](./adobe/subarray-with-given-sum.md)                                             | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/subarray-with-given-sum-1587115621/1)                                                 | ✅
2   | [Longest Arithmetic Progression](./adobe/longest-arithmetic-progression.md)                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/longest-arithmetic-progression1019/1/)                                                | ✅
3   | [No. of distict Words with k max contiguous vowels](./adobe/kmax-cont-vowels.md)                          | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/7b9d245852bd8caf8a27d6d3961429f0a2b245f1/1/)                                          | ✅
4   | [Partition Equal Subset Sum](./adobe/subset-sum-problem.md)                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/subset-sum-problem2014/1)                                                             | ✅
5   | [Express as sum of power of natural numbers](./adobe/sum-of-power-of-natural-numbers.md)                  | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/express-as-sum-of-power-of-natural-numbers5647/1)                                     | ✅
6   | [Generate Parentheses](./adobe/generate-parentheses.md)                                                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/generate-all-possible-parentheses/1/)                                                 | ✅
7   | Pots of Gold Game                                                                                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/pots-of-gold-game/1/)                                                                 | ✅
8   | [Implement Atoi](./adobe/implement-atoi.md)                                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/implement-atoi/1/)                                                                    | ✅
9   | [Next higher palindromic number using same digits](./adobe/next-higher-palindromic-number-same-digit.md)  | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/next-higher-palindromic-number-using-the-same-set-of-digits5859/1/)                   | ✅
10  | [Winner of an election](./adobe/winner-of-an-election.md)                                                 | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/winner-of-an-election-where-votes-are-represented-as-candidate-names-1587115621/1/)   | ✅
11  | [Amend The Sentence](./adobe/amend-the-sentence.md)                                                       | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/amend-the-sentence3235/1)                                                             | ✅
12  | [Leaders in an array](./adobe/leaders-in-an-array.md)                                                     | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/leaders-in-an-array-1587115620/1/)                                                    | ✅
13  | [Minimum operations to convert array A to B](./adobe/minimum-insertions-to-make-two-arrays-equal.md)      | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/minimum-insertions-to-make-two-arrays-equal/1/)                                       | ✅
14  | Smallest range in K lists                                                                                 | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/find-smallest-range-containing-elements-from-k-lists/1/)                              | ✅
15  | [Most Recent Library](./adobe/most-recent-library.md)                                                     |                                                                                                                                                                       | ✅

</details>

<details open>
<summary style="font-size: 1.2em">Intuit (15/15)</summary>

Sr  | Problems                                                                                          | TryIt                                                                                                                     | Status
----|---------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------|--------
1   | [Minimum sum partition](./intuit/minimum-sum-partition.md)                                        | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/minimum-sum-partition3317/1/)             | ✅
2   | [Word Search](./intuit/word-search.md)                                                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/word-search/1/)                           | ✅
3   | [Find the missing no in string](./intuit/missing-no-in-string.md)                                 | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/find-the-missing-no-in-string/1/)         | ✅
4   | [Largest number in K swaps](./intuit/largest-number-in-k-swaps.md)                                | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1)   | ✅
5   | [Split Array Largest Sum](./intuit/split-array-largest-sum.md)                                    | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/split-array-largest-sum/)                                | ✅
6   | [Find in Mountain Array](./intuit/find-in-mountain-array.md)                                      | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/find-in-mountain-array/)                                 | ✅
7   | [Capacity To Ship Packages Within D Days](./intuit/capacity-to-ship-packages-within-d-days.md)    | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)                | ✅
8   | [Number of Boomerangs](./intuit/number-of-boomerangs.md)                                          | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/number-of-boomerangs/)                                   | ✅
9   | [Pacific Atlantic Water Flow](./intuit/pacific-atlantic-water-flow.md)                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/pacific-atlantic-water-flow/)                            | ✅
10  | [Number of Provinces](./intuit/number-of-provinces.md)                                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/number-of-provinces/)                                    | ✅
11  | Construct Quad Tree                                                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/construct-quad-tree/)                                    | ✅
12  | Course Schedule II                                                                                | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/course-schedule-ii/)                                     | ✅ 
13  | Minimum Swaps to Arrange a Binary Grid                                                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/minimum-swaps-to-arrange-a-binary-grid/)                 | ✅
14  | As Far from Land as Possible                                                                      | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/as-far-from-land-as-possible/)                           | ✅
15  | Koko Eating Bananas                                                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/koko-eating-bananas/)                                    | ✅

</details>

<details open>
<summary style="font-size: 1.2em">Walmart (15/15)</summary>

Sr  | Problems                                                                                              | TryIt                                                                                                                           | Status
----|-------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------|--------
1   | Path with Maximum Probability                                                                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/path-with-maximum-probability/)                                |  ✅
2   | Stone Game                                                                                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/stone-game/)                                                   |  ✅
3   | Remove Colored Pieces if Both Neighbors are the Same Color                                            | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)   |  ✅
4   | [Number of Unique Paths](./walmart/number-of-unique-paths.md)                                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/number-of-unique-paths5339/1/)                  | ✅
5   | [Transform to Sum Tree](./walmart/transform-to-sum-tree.md)                                           | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/transform-to-sum-tree/1/)                       | ✅
6   | [Power Of Numbers](./walmart/power-of-numbers.md)                                                     | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/power-of-numbers-1587115620/1/)                 | ✅
7   | [Sorted subsequence of size 3](./walmart/sorted-subsequence-of-size-3.md)                             | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/sorted-subsequence-of-size-3/1/)                | ✅
8   | [Maximum Height Tree](./walmart/maximum-height-tree.md)                                               | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/maximum-height-tree4803/1/)                     | ✅
9   | Guess Number Higher or Lower II                                                                       | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)                              |  ✅
10  | Generate Random Point in a Circle                                                                     | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/generate-random-point-in-a-circle/)                            |  ✅
11  | Maximum Performance of a Team                                                                         | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/maximum-performance-of-a-team/)                                |  ✅
12  | Find Array Given Subset Sums                                                                          | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/find-array-given-subset-sums/)                                 |  ✅
13  | [Find the Kth Largest Integer in the Array](./walmart/find-the-kth-largest-integer-in-the-array.md)   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/)                    | ✅
14  | [Largest number in K swaps](./walmart/largest-number-in-k-swaps.md)                                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/gfg.svg)](https://practice.geeksforgeeks.org/problems/largest-number-in-k-swaps-1587115620/1/)        | ✅
15  | Divide Two Integers                                                                                   | [![Problem Link](https://raw.githubusercontent.com/hiteshv01/6Companies30Days/main/assets/lc.svg)](https://leetcode.com/problems/divide-two-integers/)                                          |  ✅

</details>

6Companies30Days

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README