You are given an N × M grid. Each cell contains some number of coins (0 ≤ coins ≤ 100). Two agents start: Agent A starts at (0, 0) — top-left corner Agent B starts at (0, M−1) — top-right corner Both agents must move to the bottom row (any column). They move simultaneously, and each step they can: Move down-left Move down Move down-right If both agents land on the same cell, the coins in that cell are counted only once.
Simple Array Qn was asked. Computer networking qns. discussion on project
Generic questions about what’s on your resume + technical coding questions.
What is IP ? What is MAC address? What is the difference between SSD and HDD?
About previous roles, CTC, and expectations
Recovery models, Clusters and Capacity Planning.
what's your strength? How do you collaborate and work within a team? Why I am interested in this position? Tell us about your leadership style
What's your previous experience that's applicable for the job I apply
Asked for cv, cover letter, qualification, and two questions
Q: How do you get someone to participate when they don't want to
Viewing 381 - 390 interview questions