i
Brigosha Technologies
Filter interviews by
I applied via LinkedIn and was interviewed in Oct 2022. There were 4 interview rounds.
Basics of codding knowledge.
Be perfect what you learned and try to improve skills.
General knowledge & basic type questions regarding your graduate and your experience.
Top trending discussions
I applied via Company Website and was interviewed before Feb 2021. There were 3 interview rounds.
TNQT: TCS National Qualifier Test
posted on 23 Mar 2015
During my summer training, I learned various programming languages, software development methodologies, and practical application of theoretical concepts.
Learned programming languages such as Java, Python, and SQL
Gained knowledge of software development methodologies like Agile and Waterfall
Applied theoretical concepts in real-world projects, enhancing problem-solving skills
posted on 7 May 2017
I was interviewed before May 2016.
In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.
Continuing to enhance my technical skills through ongoing learning and certifications
Taking on more leadership responsibilities within the team
Contributing to the company's growth and success through my expertise
Mentoring junior team members to help them grow in their careers
posted on 17 Mar 2015
posted on 6 Sep 2017
I was interviewed before Sep 2016.
I am a recent graduate with a degree in Computer Science and a passion for software development.
Recent graduate with a degree in Computer Science
Passionate about software development
Experience with programming languages like Java and Python
posted on 13 Oct 2017
I was interviewed in Mar 2017.
Developed a web-based inventory management system for a retail company
Used HTML, CSS, and JavaScript for the frontend
Implemented a backend using PHP and MySQL for data storage
Designed a user-friendly interface for adding, updating, and deleting products
Implemented features like barcode scanning and real-time stock tracking
Conducted testing and debugging to ensure system functionality
As a mechanical engineering graduate, I see myself in an IT firm leveraging my problem-solving skills and technical knowledge to contribute to software development and innovation.
Applying my analytical and logical thinking skills to develop efficient software solutions
Utilizing my understanding of engineering principles to design and optimize software systems
Collaborating with cross-functional teams to integrate mechan...
My favorite subject is computer science.
I enjoy studying algorithms and data structures.
I find programming languages fascinating.
I am interested in software engineering principles and practices.
My daily routine involves a mix of coding, collaborating with team members, and continuous learning.
Start the day by checking emails and responding to any urgent messages
Attend daily stand-up meetings to discuss progress and plan the day's tasks
Work on coding tasks assigned by the team lead or project manager
Collaborate with team members to troubleshoot issues and brainstorm solutions
Participate in code reviews to ensu...
I plan to be an efficient employee by continuously improving my skills, being proactive, and collaborating effectively with my team.
Continuously improving my skills through self-learning and professional development opportunities
Being proactive in identifying and solving problems before they escalate
Collaborating effectively with my team by actively participating in meetings, sharing knowledge, and seeking feedback
Prio...
My smartphone is the most important gadget in my life.
My smartphone helps me stay connected with family and friends
I use it for work-related communication and tasks
It serves as a source of entertainment during leisure time
I can access important information and services through it
It also serves as a camera for capturing memories
Examples: iPhone, Samsung Galaxy, Google Pixel
I applied via Campus Placement and was interviewed before Jul 2020. There were 3 interview rounds.
I was interviewed before Nov 2020.
Round duration - 360 minutes
Round difficulty - Medium
They give you 6 hr. For 6 question but the good part is that you need to complete atleast 1 question and you are good to go.
Round will be cleared only after attempting one question and rest of the questions are for improving your rank.
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the problem statement.
You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to determine the minimum number of pl...
The task is to determine the minimum number of platforms needed at a railway station based on arrival and departure times of trains.
Sort the arrival and departure times in ascending order.
Use two pointers to keep track of overlapping schedules.
Increment platform count when a new train arrives before the previous one departs.
You are given a matrix of 'N' rows and 'M' columns and a non-negative integer 'K'. Determine the minimum possible sum of all elements in each submatrix after performing at m...
Given a matrix and a non-negative integer K, find the minimum possible sum of all elements in each submatrix after performing at most K decrements.
Iterate through all submatrices and find the minimum possible sum after performing decrements
Keep track of the number of decrements performed on each element
Use dynamic programming to optimize the solution
Ensure not to decrease any number below 0
Return the minimum possible s
You are given an array/list CHOCOLATES
of size 'N', where each element represents the number of chocolates in a packet. Your task is to distribute these chocolates among 'M'...
Distribute chocolates among students to minimize the difference between the largest and smallest number of chocolates.
Sort the array of chocolates packets.
Use sliding window technique to find the minimum difference between the largest and smallest packets distributed to students.
Consider edge cases like when number of students is equal to number of packets.
You are given two integers DAY_HOURS
and PARTS
. Consider a day with DAY_HOURS
hours, which can be divided into PARTS
equal parts. Your task is to determine the total ins...
Calculate total instances of equivalent prime groups in a day divided into equal parts.
Divide the day into equal parts and find prime numbers in each part.
Identify prime groups where prime numbers occur at the same position in different parts.
Count the total instances of equivalent prime groups.
Ensure each hour in a prime group is in a different part of the day.
Given a matrix named UNIVERSE
with 3 rows and 'N' columns, filled with characters {#, *, .}, where:
The task is to identify constellations shaped like vowels within a matrix filled with characters {#, *, .}.
Iterate through the matrix to find 3x3 constellations shaped like vowels.
Check for vowels 'A', 'E', 'I', 'O', 'U' in each 3x3 constellation.
Print the vowels found in each constellation for each test case.
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : learn basics
Tip 2 : learn any oops language and practice.
Tip 3 : code as much as you can.
Tip 1 : short and precise. Upto the point.
Tip 2 : keep few things aside from resume
posted on 15 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There were 4 interview rounds.
based on 4 reviews
Rating in categories
Junior Software Engineer
158
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
122
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
99
salaries
| ₹0 L/yr - ₹0 L/yr |
Embedded Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Junior Software Developer
18
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech