6Companies30Days

KO | EN

gitlite — search

#ai #typescript #llm #go #machine-learning #docker #macos #nodejs #java #windows #awesome #awesome-list #pytorch #ios

6Companies30Days

(★ 12)

A challenge to solve coding questions of top 6 companies in 30 days. An initiative started by Arsh Goyal. #RevisewithArsh #6Companies30Days

6Companies30Days 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# #6Companies30Days

[![ReviseWithArsh](https://img.shields.io/badge/ReviseWithArsh-6Companies30Days-green?style=for-the-badge&logo=github)](https://github.com/hariketsheth/6Companies30Days)
[![ReviseWithArsh](https://img.shields.io/badge/Language-C++-red?style=for-the-badge&logo=C%2B%2B)](https://github.com/hariketsheth/6Companies30Days)

>### #ReviseWithArsh : #6Companies30Days 
> A challenge to solve coding questions of top 6 companies in 30 days. An initiative started by Arsh Goyal. 
> Challenge to solve 90 questions from 6 companies in 30 days.

## Using this Repository
1. Accessing via Git:
   ```bash
   git clone https://github.com/hariketsheth/6Companies30Days
   ```
   
2. Directly from GitHub:
   - Click the `Code` and Press `Download ZIP`
   ![image](https://user-images.githubusercontent.com/72455881/147927669-90f3dd8b-0bd5-4969-a942-dfd6dad17ede.png)

3. Wish to Contribute:
   - (Optional) Open a Issue in this Repository
   - Fork this Repository
   - Add your Contributions
   - Make a Pull Request (Mention Issue Number, if following Step 1)
   - Wohoo! Wait for your contribution to get merged :) !

## Coding Challenge
<table>
 <tr>
 <th colspan ="3"> Problems </ th> 
	<th colspan ="2"> Solutions </ th>
 </tr>
 <tr>
	<center>
	<td>Company</ td> 
 <td>Title</ td> 
 <td>Language</ td> 
 <td>Question</ td> 
 <td>Solution</ td> 
	</center>
 </tr>
<tr>
	<td rowspan="15">Goldman Sachs</td>
	<td>Print Anagrams Together</td>
	<td rowspan="30">C++</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/print-anagrams-together/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/a.%20Anagrams.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Overlapping rectangles</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/overlapping-rectangles1924/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/b.%20Overlapping_Rectangles.cpp">Click Here</a></td>
	</tr>
	
<tr>
	<td>Count the subarrays having product less than k</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/count-the-subarrays-having-product-less-than-k1708/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/c.%20Subarray_Product.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Run Length Encoding</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/run-length-encoding/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/d.%20Length_Encoding.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Ugly Numbers</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/ugly-numbers2254/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/e.%20Ugly_Numbers.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Greatest Common Divisor of Strings</td>
	<td><a href="https://leetcode.com/problems/greatest-common-divisor-of-strings/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/f.%20Greatest_Common_Divisor.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Find the position of M-th item</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/find-the-position-of-m-th-item1723/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/g.%20Position_Of_Mth_Item.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Total Decoding Messages</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/total-decoding-messages1235/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/h.%20Total_Decoding_Messages.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Number following a pattern</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/number-following-a-pattern3126/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/i.%20Number_Following_Pattern.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Largest 10 numbers from 10M</td>
	<td><a href="#">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/j.%20Largest_Numbers.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Find Missing And Repeating</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/find-missing-and-repeating2512/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/k.%20Missing_And_Repeating.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Squares in N*N Chessboard</td>
	<td><a href="#">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/l.%20Square_N*N.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Decode the string</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/decode-the-string2444/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/m.%20Decode_String.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Minimum Size Subarray Sum</td>
	<td><a href="https://leetcode.com/problems/minimum-size-subarray-sum/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/n.%20Minimum_Size_Subarray.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Array Pair Sum Divisibility Problem</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/array-pair-sum-divisibility-problem3257/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone1%20-%20Goldman%20Sachs/o.%20Array_Sum_Divisibility.cpp">Click Here</a></td>
	</tr>
	
	
<tr>
	<td rowspan="15">Amazon</td>
	<td>Calculating Maximum Profit</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/maximum-profit4657/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/a.%20Maximum_Profit.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Longest Mountain</td>
	<td><a href="https://leetcode.com/problems/longest-mountain-in-array/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/b.%20Longest_Mountain.cpp">Click Here</a></td>
	</tr>
	
<tr>
	<td>IPL 2021 - Match Day 2</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/deee0e8cf9910e7219f663c18d6d640ea0b87f87/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/c.%20IPL2021.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Brackets in Multiple Chain Multiplication</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/brackets-in-matrix-chain-multiplication1024/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/d.%20Brackets_Matrix.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Phone Directory</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/phone-directory4628/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/e.%20Phone_Directory.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Maximum of all subarrays of size k</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/maximum-of-all-subarrays-of-size-k3101/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/f.%20Maximum_Subarray.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>First non-repeating character in a stream</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/g.%20Non-repeating.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Count ways to N'th Stair(Order does not matter)</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/count-ways-to-nth-stairorder-does-not-matter1322/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/h.%20Nth-Stair.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Which among them forms a perfect Sudoku Pattern ?</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/is-sudoku-valid4820/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/i.%20Valid_Sudoku.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Nuts and Bolts Problem</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/nuts-and-bolts-problem0431/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/j.%20Nuts_And_Bolts.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Tree Serialization and Deserialization</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/serialize-and-deserialize-a-binary-tree/1">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/k.%20Serialise_Binary_Tree.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Column name from a given column number</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/column-name-from-a-given-column-number4244/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/l.%20Column_Name.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Rotten Oranges</td>
	<td><a href="https://leetcode.com/problems/rotting-oranges/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/m.%20Rotting_Oranges.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Tree Burning</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/burning-tree/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/n.%20Burning_Tree.cpp">Click Here</a></td>
	</tr>
<tr>
	<td>Delete N nodes after M nodes of a linked list</td>
	<td><a href="https://practice.geeksforgeeks.org/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/1/">Link</a></td>
	<td><a href="https://github.com/hariketsheth/6Companies30Days/blob/main/Milestone2%20-%20Amazon/o.%20Delete_N_Nodes.cpp">Click Here</a></td>
	</tr>
</table>

6Companies30Days

6Companies30Days 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

6Companies30Days

6Companies30Days 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README