Competitive Programming
Kanalga Telegram’da o‘tish
Solving competitive Programming Questions one day at a time. Group link: https://t.me/daily1interviewprogram Please forward it to your friends
Ko'proq ko'rsatishMamlakat belgilanmaganToif belgilanmagan
4 553
Obunachilar
Ma'lumot yo'q24 soatlar
Ma'lumot yo'q7 kun
Ma'lumot yo'q30 kun
Ma'lumotlar yuklanmoqda
O'xshash kanallar
Taglar buluti
Ma'lumot yo'q
Muammo bormi? Iltimos, sahifani yangilang yoki bizning qo'llab-quvvatlash boshqaruvchimizga murojaat qiling>.
Kirish va chiqish esdaliklari
---
---
---
---
---
---
Obunachilarni jalb qilish
Oktabr '26Okt '26
Oktabr '260
0 kanalda
Sentabr '260
0 kanalda
Get PRO
Avgust '260
0 kanalda
Get PRO
Iyul '260
0 kanalda
Get PRO
Iyun '260
0 kanalda
Get PRO
May '260
0 kanalda
Get PRO
Aprel '260
0 kanalda
Get PRO
Mart '260
0 kanalda
Get PRO
Fevral '260
0 kanalda
Get PRO
Yanvar '260
0 kanalda
Get PRO
Dekabr '250
0 kanalda
Get PRO
Noyabr '250
0 kanalda
Get PRO
Oktabr '250
0 kanalda
Get PRO
Sentabr '250
0 kanalda
Get PRO
Avgust '250
0 kanalda
Get PRO
Iyul '250
0 kanalda
Get PRO
Iyun '250
0 kanalda
Get PRO
May '250
0 kanalda
Get PRO
Aprel '250
0 kanalda
Get PRO
Mart '250
0 kanalda
Get PRO
Fevral '250
0 kanalda
Get PRO
Yanvar '250
0 kanalda
Get PRO
Dekabr '240
0 kanalda
Get PRO
Noyabr '240
0 kanalda
Get PRO
Oktabr '240
0 kanalda
Get PRO
Sentabr '240
0 kanalda
Get PRO
Avgust '24
+14
0 kanalda
Get PRO
Iyul '24
+55
0 kanalda
Get PRO
Iyun '24
+40
0 kanalda
Get PRO
May '24
+35
0 kanalda
Get PRO
Aprel '240
0 kanalda
Get PRO
Mart '24
+13
0 kanalda
Get PRO
Fevral '240
0 kanalda
Get PRO
Yanvar '240
0 kanalda
Get PRO
Dekabr '230
0 kanalda
Get PRO
Noyabr '230
0 kanalda
Get PRO
Oktabr '230
0 kanalda
Get PRO
Sentabr '230
0 kanalda
Get PRO
Avgust '230
0 kanalda
Get PRO
Iyul '230
0 kanalda
Get PRO
Iyun '230
0 kanalda
Get PRO
May '230
0 kanalda
Get PRO
Aprel '230
0 kanalda
Get PRO
Mart '230
0 kanalda
Get PRO
Fevral '230
0 kanalda
Get PRO
Yanvar '230
0 kanalda
Get PRO
Dekabr '220
0 kanalda
Get PRO
Noyabr '220
0 kanalda
Get PRO
Oktabr '220
0 kanalda
Get PRO
Sentabr '22
+1
0 kanalda
Get PRO
Avgust '220
0 kanalda
Get PRO
Iyul '220
0 kanalda
Get PRO
Iyun '220
0 kanalda
Get PRO
May '22
+1
0 kanalda
Get PRO
Aprel '220
0 kanalda
Get PRO
Mart '220
0 kanalda
Get PRO
Fevral '220
0 kanalda
Get PRO
Yanvar '220
0 kanalda
Get PRO
Dekabr '210
0 kanalda
Get PRO
Noyabr '210
0 kanalda
Get PRO
Oktabr '21
+5 225
0 kanalda
| Sana | Obunachilarni jalb qilish | Esdaliklar | Kanallar | |
| 23 Oktabr | 0 | |||
| 22 Oktabr | 0 | |||
| 21 Oktabr | 0 | |||
| 20 Oktabr | 0 | |||
| 19 Oktabr | 0 | |||
| 18 Oktabr | 0 | |||
| 17 Oktabr | 0 | |||
| 16 Oktabr | 0 | |||
| 15 Oktabr | 0 | |||
| 14 Oktabr | 0 | |||
| 13 Oktabr | 0 | |||
| 12 Oktabr | 0 | |||
| 11 Oktabr | 0 | |||
| 10 Oktabr | 0 |
Kanal postlari
Day 35 Question: Rain water trapping in C++
Given *n* non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6
Before solving this problem, please take a look at “Container with most water (https://www.prodevelopertutorial.com/find-the-container-with-most-water-explanation-with-diagram-and-solution-in-cpp-language/)” problem. There I have explained in detail, how two pointers work.
Solution:
https://www.prodevelopertutorial.com/rain-water-trapping-in-c/
| 2 | Group Anagrams when given an array of strings in C++
Example:
Input: ["eat", "tea", "tan", "ate", "nat", "bat"],
Output:
[
["ate","eat","tea"],
["nat","tan"],
["bat"]
]
This problem can be solved easily using Maps.
The solution involves 2 steps:
1. Sort the element and make it as the key.
2. Take the value and place it in the key.
Solution:
https://www.prodevelopertutorial.com/group-anagrams-in-c/ | 5 516 |
| 3 | Day 33 Question: Given an n x n 2D matrix rotate it by 90 degrees (clockwise) in C++ in place
You have to rotate the image in-place (https://en.wikipedia.org/wiki/In-place_algorithm), which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
Example 1:
Given input matrix =
[
[1,2,3],
[4,5,6],
[7,8,9]
],
rotate the input matrix in-place such that it becomes:
[
[7,4,1],
[8,5,2],
[9,6,3]
]
Solution:
https://www.prodevelopertutorial.com/given-an-n-x-n-2d-matrix-rotate-it-by-90-degrees-clockwise-in-c-in-place/
Buy the book:
https://www.instamojo.com/aj_guides/ajs-guide-to-algorithm-and-data-structure-in/ | 4 825 |
| 4 | Subscribe us in Quora: https://www.quora.com/q/dailyonecodingproblem | 3 745 |
| 5 | Check if Two Trees are Mirror Structure to each other
Solution:
https://www.prodevelopertutorial.com/check-if-two-trees-are-mirror-structure-to-each-other/ | 3 664 |
| 6 | 26_DE Shaw .pdf | 6 026 |
| 7 | 25_oracle.pdf | 6 171 |
| 8 | 23_UHG.pdf | 6 443 |
| 9 | 22_UHG.pdf | 6 483 |
| 10 | 21_UHG.pdf | 6 779 |
| 11 | 20_Optum United Health Group On Campus Interview Experience.pdf | 6 426 |
| 12 | 19_United Health Group Interview Experience FTE virtual 2020.pdf | 5 866 |
| 13 | 18_United Health Group interview.pdf | 5 908 |
| 14 | 17_ServiceNow Interview Experience Oncampus.pdf | 5 663 |
| 15 | 16_UHG.pdf | 5 464 |
| 16 | 14_Accenture Interview Experience.pdf | 5 246 |
| 17 | 13_Accenture Interview Experience.pdf | 4 936 |
| 18 | 12_Accenture Interview Experience.pdf | 4 873 |
| 19 | 11_Accenture Interview Experience.pdf | 4 706 |
| 20 | 10_Accenture Campus Placement Drive 2020.pdf | 4 585 |
