Competitive Programming
前往频道在 Telegram
Solving competitive Programming Questions one day at a time. Group link: https://t.me/daily1interviewprogram Please forward it to your friends
显示更多未指定国家未指定类别
4 553
订阅者
无数据24 小时
无数据7 天
无数据30 天
数据加载中...
吸引订阅者
八月 '24
八月 '24
+14
在0个频道中
七月 '24
+55
在0个频道中
Get PRO
六月 '24
+40
在0个频道中
Get PRO
五月 '24
+35
在0个频道中
Get PRO
四月 '240
在0个频道中
Get PRO
三月 '24
+13
在0个频道中
Get PRO
二月 '240
在0个频道中
Get PRO
一月 '240
在0个频道中
Get PRO
十二月 '230
在0个频道中
Get PRO
十一月 '230
在0个频道中
Get PRO
十月 '230
在0个频道中
Get PRO
九月 '230
在0个频道中
Get PRO
八月 '230
在0个频道中
Get PRO
七月 '230
在0个频道中
Get PRO
六月 '230
在0个频道中
Get PRO
五月 '230
在0个频道中
Get PRO
四月 '230
在0个频道中
Get PRO
三月 '230
在0个频道中
Get PRO
二月 '230
在0个频道中
Get PRO
一月 '230
在0个频道中
Get PRO
十二月 '220
在0个频道中
Get PRO
十一月 '220
在0个频道中
Get PRO
十月 '220
在0个频道中
Get PRO
九月 '22
+1
在0个频道中
Get PRO
八月 '220
在0个频道中
Get PRO
七月 '220
在0个频道中
Get PRO
六月 '220
在0个频道中
Get PRO
五月 '22
+1
在0个频道中
Get PRO
四月 '220
在0个频道中
Get PRO
三月 '220
在0个频道中
Get PRO
二月 '220
在0个频道中
Get PRO
一月 '220
在0个频道中
Get PRO
十二月 '210
在0个频道中
Get PRO
十一月 '210
在0个频道中
Get PRO
十月 '21
+5 225
在0个频道中
| 日期 | 订阅者增长 | 提及 | 频道 | |
| 06 八月 | +5 | |||
| 05 八月 | 0 | |||
| 04 八月 | +4 | |||
| 03 八月 | +1 | |||
| 02 八月 | +4 | |||
| 01 八月 | 0 |
频道帖子
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 |
