Eligibility Criteria : Branch -> CSE, ECE, EEE CGPA Cut-off -> 6 CGPA The selection process consists of two rounds. First OT followed by Technical… Read More The post Honeywell Interview Experience for SDE (On-Campus) 2022 appeared first on GeeksforGeeks.
Rubin
14259 posts
The modern workforce requires access to every piece of information at their fingertips. The employees too demand transparency around everything in an organization including leaves,… Read More The post 10 Amazing Softwares to track Employe Attendance appeared first on GeeksforGeeks.
Say I have data where each line starts with A, B, C, etc. and I want to add the number 1 after all the As, in position two. But I don’t want to add it after the As in any other position. Is there a way to do that?
I’d like to run a batch script on Windows that will prompt users for input (a list) that is then used to open up all the websites as tabs in one window (like a for loop) Example: set /p What websites would you like to go to? { user inputs: […]
I’m building a budget on my spreadsheet. I currently have 90 hours on my check. Hours Input to Paycheck Output – Sheet 1 Consider Hours the INPUT And Paycheck my OUTPUT I want to use the following table: Hourly Table and Pay Rate – Sheet 2 Please note: 0-80 Pay […]
I frequently need to find some web page I visited days of weeks ago, but it is really difficult because history is super spammed with pages like facebook or maps which create new history entry with each click or mouse move. So I am thinking if there is a way […]
On my Hetzner VPS are two partitions: /dev/sda1 19gB with 0% Available disk space /dev/sdb1 50 gB with 95% Available disk space My /var/lib directory is almost 17gB in size. It ‘lives’ on the sda1 partition. So it consumes most of the first partition available space. I would like to […]
Given a matrix arr[][] of size N * M, the task is to find the maximum sum of diagonals for each cell of the matrix… Read More The post Find the maximum sum of diagonals for each cell of the Matrix appeared first on GeeksforGeeks.
Given an array arr[] of N elements, the task is to find the length of the longest non-decreasing subsequence such that the differences between adjacent… Read More The post Longest non-decreasing Subsequence with adjacent differences appeared first on GeeksforGeeks.