Filter interviews by
I applied via Company Website and was interviewed in Jan 2023. There were 2 interview rounds.
Questions related to Go programming language concepts and design patterns.
Pointer is a variable that stores the memory address of another variable, while slice is a reference to an underlying array.
Arrays have a fixed size, while slices are dynamic and can grow or shrink.
Maps are key-value pairs, used to store and retrieve data based on a unique key.
Bridge pattern is used to separate an abstraction from its implementat...
Pointers are variables that store the memory address of another variable. Channels are used for communication between goroutines.
Pointers allow direct access to memory, making it possible to modify values at a specific address.
Channels are used to pass data between goroutines, allowing for synchronization and communication.
Pointers can be used to pass large data structures to functions without copying the entire struct...
Goroutines are lightweight threads of execution in Go that allow concurrent programming.
Goroutines are created using the 'go' keyword followed by a function call.
They are executed concurrently with other goroutines and can communicate using channels.
Switch statements can be used to control the flow of execution between multiple goroutines.
Example: go func() { fmt.Println('Hello, world!') }()
Example: select { case msg :...
Explanation of Go path and Go root, and encapsulation with a program example.
Go path is an environment variable that specifies the location of Go source code and binaries.
Go root is the location where Go is installed on the system.
Encapsulation is the process of hiding implementation details and exposing only necessary information.
Example of encapsulation in Go can be creating a struct with private fields and public me...
Top trending discussions
I appeared for an interview in Dec 2020.
Round duration - 40 minutes
Round difficulty - Easy
Given an integer array ARR
of size N
, your task is to find the total number of subsequences in which all elements are equal.
A subsequence of an array i...
Count the total number of subsequences in which all elements are equal in an integer array.
Iterate through the array and count the frequency of each element.
Calculate the total number of subsequences for each element using the formula (frequency * (frequency + 1) / 2).
Sum up the total number of subsequences for all elements and return the result modulo 10^9 + 7.
Tip 1 : Do practice as much as you can
Tip 2 : Coding is key to crack
Tip 1 : It should look nice
Tip 2 : Skills should be mentioned properly
I applied via Referral and was interviewed in Apr 2021. There were 5 interview rounds.
To debug a particular program without affecting others, use breakpoints and step through the code.
Set a breakpoint in the program you want to debug
Step through the code using a debugger to identify the issue
Use logging statements to track the flow of the program
Check the call stack to see which functions are being called
Use conditional breakpoints to stop the program at specific points
I applied via Campus Placement and was interviewed before Feb 2020. There were 4 interview rounds.
If and Switch Case statements are used for conditional branching in programming.
If statements are used for simple conditional branching.
Switch Case statements are used for multiple conditional branching.
If statements are more flexible than Switch Case statements.
Switch Case statements are more efficient than If statements for large number of conditions.
If statements can be nested, but Switch Case statements cannot.
Exam...
Yes, algorithms and pseudocodes are still important in IT Services.
Algorithms are used in various fields of IT such as machine learning, data analysis, and cryptography.
Pseudocodes are used to plan and design algorithms before coding them.
Understanding algorithms and pseudocodes is essential for software engineers to write efficient and optimized code.
Examples of algorithms include sorting algorithms, search algorithms...
Yes, I am comfortable using both CLIs and IDEs for my daily tasks.
I have experience using various CLIs such as Git Bash, Windows Command Prompt, and Terminal on macOS.
I am proficient in using IDEs such as Visual Studio Code, Eclipse, and IntelliJ IDEA.
I understand the benefits and drawbacks of both CLIs and IDEs and can choose the appropriate tool for the task at hand.
I applied via Campus Placement and was interviewed in Nov 2020. There were 6 interview rounds.
OOPs concepts are the fundamental principles of object-oriented programming.
Encapsulation - binding data and functions that manipulate the data
Inheritance - creating new classes from existing ones
Polymorphism - ability of objects to take on many forms
Abstraction - hiding implementation details and showing only functionality
Storage classes in C define the scope and lifetime of variables.
There are four storage classes in C: auto, register, static, and extern.
Auto variables are local to a block and have automatic storage duration.
Register variables are stored in CPU registers for faster access.
Static variables have a lifetime throughout the program and are initialized only once.
Extern variables are declared outside any function and can be a...
I applied via Campus Placement and was interviewed in Oct 2021. There was 1 interview round.
Linked list is a linear data structure. DFS and BFS are graph traversal algorithms.
Linked list is a collection of nodes where each node points to the next node.
DFS (Depth First Search) is a traversal algorithm that explores as far as possible along each branch before backtracking.
BFS (Breadth First Search) is a traversal algorithm that explores all the vertices of a graph in breadth-first order.
Example of linked list: ...
Optimize O(n2) program to O(log n)
Use binary search instead of linear search
Divide and conquer approach can be used
Implement efficient data structures like heap, AVL tree, etc.
Reduce unnecessary iterations and comparisons
Use memoization to avoid redundant calculations
Some of the top questions asked at the Vizzve Services Golang Developer interview -
based on 1 interview experience
Difficulty level
Duration
TCS
Accenture
Wipro
Cognizant