Posted on

How to Crack Zoho Interview [Updated 2019]

Zoho’s Interview Process :

There are five rounds in Zoho Interview process :

1.First Round: (Aptitude written round)
2.Second Round: (Normal Programming round)
3.Third Round: (Advanced Programming Round)
4.Fourth Round: (Technical Round)
5.Fifth Round: (HR round)

Here are sample question format and topics in which questions are probably asked :

1.First Round: (Aptitude, written round)

This round consisted of two sections “Reasoning Aptitude” and “Technical Aptitude”. Reasoning section was more like puzzles so do concentrate on logical puzzles. Technical Aptitude dealt more with “operator precedence”, “pointers”, “iterations”, “dynamic memory allocations”.

2.Second Round: (Normal Programming round)

1.Print the word with odd letters as


  1. Given a set of numbers like <10, 36, 54,89,12> we want to find the sum of weights based on the following conditions
    1. 5 if a perfect square
    2. 4 if multiple of 4 and divisible by 6
    3. 3 if even number

And sort the numbers based on the weight and print it as follows

<10,its_weight>,<36,its weight><89,its weight>

Should display the numbers based on increasing order.

  1. Save the string “WELCOMETOZOHOCORPORATION” in a two-dimensional array and search for a substring like “too” in the two-dimensional string both from left to right and from top to bottom.


And print the start and ending index as

Start index : <1,2>

End index: <3, 2>

  1. Given a 9×9 Sudoku, we have to evaluate it for its correctness. We have to check both the submatrix correctness and the whole sudoku correctness.

5.Given a two dimensional array of string like

<”luke”, “shaw”> <”wayne”, “rooney”> <”rooney”, “ronaldo”> <”shaw”, “rooney”>

Where the first string is “child”, the second string is “Father”. And given “ronaldo” we have to find his no of grandchildren Here “ronaldo” has 2 grandchildren. So our output should be 2.

Third Round: (Advanced Programming Round)

Here they asked us to create a “Railway reservation system” and gave us 4 modules. The modules were: 1. Booking 2. Availability checking 3. Cancellation 4. Prepare chart We were asked to create the modules for representing each data first and to continue with the implementation phase.

Fourth Round: (Technical Round)

Technical questions which are revolved around “data structures” and “OOPS”

Fifth Round: (HR round)

Some general hr questions asked mainly about our projects and about certifications if we had one.

To Access some more Practice Problems – Click here

To Master Data Structures – Checkout this Playlist Youtube

Also Checkout GUVI’s Computational Thinking course to master Algorithms and Data Structures.Click here

Content Source –

Posted on

20 Accenture interview questions that you should be ready to answer!!!

What is pointer to pointer in C?

A pointer to a pointer is a form of multiple indirections or a chain of pointers. Normally, a pointer contains the address of a variable. When we define a pointer to a pointer, the first pointer contains the address of the second pointer, which points to the location that contains the actual value. [][2]

What is dynamic memory allocation?

C dynamic memory allocation refers to performing manual memory management for dynamic memory allocation in the C programming language via a group of functions in the C standard library, namely malloc(), realloc(), calloc() and free(). What do you know about our company?

Accenture is one of the largest consulting firms in the world that provides strategy, consulting, digital, technology and operations services. A Fortune Global 500 company, it has been incorporated in Dublin, Ireland, since 1 September 2009.

What functions are used for dynamic memory allocation in C language?

malloc(),calloc() functions are used for dynamic memory allocation.

What is Encapsulation?

Encapsulation is an Object Oriented Programming concept that binds together the data and functions that manipulate the data, and that keeps both safe from outside interference and misuse.

Can we compile a program without main() function?

we can use preprocessor directive #define with arguments to give an impression that the program runs without main. But in reality, it runs with a hidden main function.C program can never run without a main().

What is a token?

A single meaningful element of a programming language. A token could be a keyword, an operator, or a punctuation mark.

What do you consider as the biggest professional achievement in your life?

when asked this one, this is a time to brag, not be humble. Think about your greatest professional accomplishments and how you achieved them. We recommend that you choose something that’s as recent as possible, and somewhat relevant to the job or your career you are applying for.

What is Polymorphism?

In object-oriented programming, polymorphism refers to a programming language’s ability to process objects differently depending on their data type or class. Generally, the ability of a single function to respond differently to different inputs is known as polymorphism.

What is a constructor?

In class-based object-oriented programming, a constructor is a special type of subroutine called to create an object. It prepares the new object for use, often accepting arguments that the constructor uses to set required member variables.

What does Scope Resolution operator do?

The ‘::’ scope resolution operator is used to get hidden names due to variable scopes so that you can still use them. The scope resolution operator can be used as both unary and binary. You can use the unary scope operator if a namespace scope or global scope name is hidden by a particular declaration of an equivalent name during a block or class. For example, if you have a global variable of name my_var and a local variable of name my_var, to access global my_var, you’ll need to use the scope resolution operator.

What are the C++ access specifiers?

There are three access specifiers in C++ Public – when members are declared as Public, they can be accessed from outside the Class through an object of the class. Protected – when members are declared as Protected then they can be accessed from outside the class but only in a class derived from it. Private – when members are declared as Private then they can only be accessed from within the class.

Define the queue data structure?

A collection of items in which only the earliest added item may be accessed. Basic operations are added to the tail, enqueue and delete from the head or dequeue.

What is RDBMS?

An RDMS is a database management system based on the relational model of data. Most databases in widespread use today are based on this model. eg:-MySQL,spanner,Sybase IQ etc

What is the 3-Tier architecture?

A three-tier architecture is a client-server architecture in which the functional process logic, data access, computer data storage and user interface are developed and maintained as independent modules on separate platforms.

What is a 2-Tier architecture?

A two-tier architecture is a software architecture in which a presentation layer or interface runs on a client, and a data layer or data structure gets stored on a server. Other kinds of multi-tier architectures add additional layers in distributed software design.

What is the static variable?

In computer programming, a static variable is a variable that has been allocated “statically”, meaning that its lifetime is the entire run of the program.

Tell me about your project?

Start by giving the shortest explanation of what the project was about, and the kind of team involved in creating it. Then, move on to which technologies you used to develop it. Finally, find something you liked about the project, and describe it.

What is ‘this’ keyword in java?

‘this’ keyword in java can be used inside the Method or constructor of Class. It works as a reference to the current Object, whose Method or constructor is being invoked. This keyword can be used to refer to any member of the current object from within an instance Method or a constructor.

What are the different storage classes in C?

There are four storage classes in C they are as follows: Automatic Storage Class. Register Storage Class. Static Storage Class. External Storage Class.


Posted on

How GUVI helped a First year student get placed in Juspay

Fahad – First year student from Kalaignar Karunanidhi Institute of Technology got placed in Juspay after attending a hackathon conducted by GUVI – How to get placed in a Startup.


Fahad has shared his journey on how he got placed in Juspay with the help of GUVI.

So how did you get Started ?

I had not started coding before twelfth standard but only after twelfth and choosing engineering I started Coding. I was very much interested in Coding platforms and especially in Shell Script.

Then I came across GUVI’s Hackathon and I developed an App Store for Linux Systems that solved dependency issues and that’s how I got started. It basically depends on how motivated or interested you are and you can achieve anything.

How was GUVI’s Hackathon Experience ?

From the hackathon I got a lot of exposure and was able to meet a lot of leaders from the industry. One such was the CEO of Juspay. I joined Juspay as an intern and I am working on cloud deployments. It’s not that these opportunities are limited to Computer science students even students from different streams can do wonders. It all depends on how much you are interested in.

I must thank GUVI because I was able to meet a lot of HR’s and CEO’s in the hackathon. It was great to have panel discussions with lot of Startups and their Founders.

What do you think about the startup Culture ?

There’s no particular role in a startup, You can choose any kind of role. If you’re good at design you can go into design field, If you’re into development you can get into development. All that matters is how fast you can learn in a startup and develop something.

What advice would you give to Students looking for jobs?

Don’t limit yourself. Be open to learn new skills. Having multiple skills is what you need, you can jump to different fields that interests you. Personally, I like to work in backend and in Frontend, I like to work around all the fields this is the spirit one should have to learn and acquire skills.

Fahad – Thank you GUVI for the amazing hackathon and the great opportunity to meet a lot of new leaders and I wish everyone all the best for their careers.

GUVI – Learn. Build your Profile. Get Hired.

Fahad’s Interview to GUVI

Posted on

Secret Sauce for Clearing Interviews

“I answered all the questions in the interview ,but I don’t know why they did not select me”

-This is the usual question from most of the people who did not clear the interview.

Why someone will reject a candidate who answered all the questions correctly.If you think from company side ,you will come to know that recruiting a right candidate is a painful process.So missing a right candidate is a costlier mistake from their side.Ok then why rejection happens?

Reasons can be one of the following

As an interviewer I am listing down my observations about the candidates whom I have evaluated.

Attending interviews without preparation

Interview is not semester exam where we used to read overnight and write the exams.90% of the time you will fail in interviews if you don’t prepare well.Interview is not an exam,its an opportunity to showcase your skills.So if you don’t posses any skills what will you showcase there.


Product or Service Company

Preparation has to be different for Product and Service Company.Product companies expect you to be strong in DS and Algos irrespective of the programming languages.Most of the times they will be ok with any programming language.They look for only logical thinking.So do some research about the companies before taking interviews.Always look for job description.



Like BigBoss Kanja Karupu some students ask me what is attitude mam? Companies does not look only for your tech skills.Most of the time you have to work in a team.So interviewer will check whether you will get aligned with their company’s work culture.A new entry may spoil an entire team because of his attitude.Some students believe that they already learnt everything ,this attitude will stop him/her from learning from others.He will try to overshadow others. attitude

I have listed only few of the reasons.Will it be interesting to hear more from the person who has taken 100’s of interviews.To know more ,register for the Interview Cracking Skills workshop by Guvi

To Book your tickets click here Register

Get the best Interview tips from the Industry expert Mr.Arun Prakash (Founder/CTO of GUVI) -Technologist with 15+ years of working experience in companies like Honeywell,KLA Tencor,Kalido,Paypal, Symantec and Guvi

Why to attend?

You will get the answer for:

  1. How to get your first job?
  2. Finding your dream company?
  3. How to build your Tech confidence?
  4. Behavior advice, resume preparation, technical preparation?
  5. Top 10 mistakes students make in interview.
  6. Short cuts to crack interview.
  7. How to prepare your job role? (Service Vs Product companies)
  8. Experience sharing
  9. How to overcome communication barriers?


Mr.Arun Prakash (Founder/CTO of GUVI) with 15+ years of experience in product companies, AI & ML expert.

Fees 799/- per head.,10% Group discount(Minimum 4 in a group)

To Book your tickets click here Register

For tech courses click GUVI

Posted on

Java – Interview Questions and Answers Collection [Updated 2019]

Q.  Difference**** between TreeMap and HashMap ? Ans. They are different the way they are stored in memory. TreeMap stores the Keys in order whereas HashMap stores the key value pairs randomly. Q.  What is the difference between List, Set**** and Map? Ans. List – Members are stored in sequence in memory and can be accessed through index. Set – There is no relevance of sequence and index. Sets doesn’t contain duplicates whereas multiset can have duplicates. Map – Contains Key , Value pairs. Q.  Which interface does java.util.Hashtable implement? Ans. Java.util.Map Q.  What is an Iterator? Ans. Iterator is an interface that provides methods to iterate over any Collection. Q.  Which interface provides the capability to store objects using a key-value pair? Ans. Q.  What is the use of hashcode in Java? Ans. Hashcode is used for bucketing in Hash implementations like HashMap, HashTable, HashSet etc. The value received from hashcode() is used as bucket number for storing elements. This bucket number is the address of the element inside the set/map. when you do contains() then it will take the hashcode of the element, then look for the bucket where hashcode points to and if more than 1 element is found in the same bucket (multiple objects can have the same hashcode) then it uses the equals() method to evaluate if object are equal, and then decide if contain() is true or false, or decide if element could be added in the set or not. Q.  Difference** between Map and HashMap ? Ans. Map is an interface where HashMap is the concrete class. **Q.  What is a Property **class ? Ans. The properties class is a subclass of Hashtable that can be read from or written to a stream. **Q.  what is the difference between collections class **vs collections interface ? Ans. Collections class is a utility class having static methods for doing operations on objects of classes which implement the Collection interface. For example, Collections has methods for finding the max element in a Collection. **Q.  Will this code give **error if i try to add two heterogeneous elements in the arraylist. ? and Why ? List list1 = new ArrayList<>(); list1.add(5); list1.add(“5”); Ans. If we don’t declare the list to be of specific type, it treats it as list of objects. int 1 is auto boxed to Integer and “1” is String and hence both are objects. **Q.  What is the difference between comparable and comparator in java.util pkg? Ans. Comparable interface is used for single sequence sorting i.e.sorting the objects based on single data member where as comparator interface is used to sort the object based on multiple data members. Q.  Advantage ****of Collection classes over Arrays? Ans. Collections are re-sizable in nature. We can increase or decrease the size as per recruitment. Collections can hold both homogeneous and heterogeneous data’s. Every collection follows some standard data structures. Collection provides many useful built in methods for traversing,sorting and search. Q.  What are the Disadvantages of using Collection Classes over **Arrays ? Ans. Collections can only hold objects, It can’t hold primitive data types. Collections have performance overheads as they deal with objects and offer dynamic memory expansion. This dynamic expansion could be a bigger overhead if the collection class needs consecutive memory location like Vectors. Collections doesn’t allow modification while traversal as it may lead to concurrentModificationException. **Q.  What is Comparable Interface? Ans. It is used to sort collections and arrays of objects using the collections.sort() and java.utils. The objects of the class implementing the Comparable interface can be ordered. Q.  Explain Set Interface? Ans. It is a collection of element which cannot contain duplicate elements. The Set interface contains only methods inherited from Collection and adds the restriction that duplicate elements are prohibited. Q.  What is the difference between the size and capacity of a Vector? Ans. The size is the number of elements actually stored in the vector, while capacity is the maximum number of elements it can store at a given instance of time. Q.  Can we use Ordered Set for performing Binary **Search ? Ans. We need to access values on the basis of an index in Binary search which is not possible with Sets. **Q.  Difference** between ArrayList and **LinkedList ? Ans. LinkedList and ArrayList are two different implementations of the List interface. LinkedList implements it with a doubly-linked list. ArrayList implements it with a dynamically resizing array. **Q.  If you are given a choice to use either ArrayList and LinkedList, Which one would you use and **Why ? Ans. ArrayList are implemented in memory as arrays and hence allows fast retrieval through indices but are costly if new elements are to be inserted in between other elements. LinkedList allows for constant-time insertions or removals using iterators, but only sequential access of elements Retrieval – If Elements are to be retrieved sequentially only, Linked List is preferred. 1. Insertion – If new Elements are to be inserted in between other elements , Array List is preferred. 2. Search – Binary Search and other optimized way of searching is not possible on Linked List. 3. Sorting – Initial sorting could be pain but lateral addition of elements in a sorted list is good with linked list. 4. Adding Elements – If sufficiently large elements needs to be added very frequently ,Linked List is preferable as elements don’t need consecutive memory location.

Q.  What are the pre-requisite for the collection to perform Binary **Search ? Ans. Collection should have an index for random access. Collection should have ordered elements. **Q.  Can you provide some implementation of a Dictionary having **large number of words ? ** Ans. Simplest implementation we can have is a List wherein we can place ordered words and hence can perform Binary Search. Other implementation with better search performance is to use HashMap with key as first character of the word and value as a LinkedList. Further level up, we can have linked Hashmaps like , hashmap { a ( key ) -> hashmap (key-aa , value (hashmap(key-aaa,value) b ( key ) -> hashmap (key-ba , value (hashmap(key-baa,value) ………………………………………………………………………… z( key ) -> hashmap (key-za , value (hashmap(key-zaa,value) } upto n levels ( where n is the average size of the word in dictionary. Q.  Which Java collection class can be used to maintain the entries in the order in which they were last accessed? Ans. LinkedHashMap **Q.  Is it legal to initialize List like **this ? LinkedList l=new LinkedList(); Ans. No, Generic parameters cannot be primitives.   Thanks for reading , Share it with your friends for more Java Interview Questions.

Learn Java In Tamil – Free Course –

Checkout Simple yet Creative Project Ideas : Click Here


Join with Us :

Official Site :

GUVI Facebook Page

GUVI Facebook Group        

Posted on

100+ Interview questions for Software Developer (SDE) / Software Developer In Test (SDET)

SDE/SDET Interview questions that will ramp-up your interview preparation

Myself, Balaji Boggaram Ramanarayan – I bag experience in taking/preparing for interviews in several big companies and always felt sharing a few of them such that it might be useful for you in interview preparation.

Note : These questions might help you ramp-up your speed in path of preparing to SDE /SDET interviews in most techie companies. 

 SDE – Software Development Engineer
 SDET – Software Development Engineer in Test 

All that you need is how well can you stand out in your interviews.
SDE and SDET Interview Questions


  1. Heap – Max Heaps and Min Heaps
  2. Conversions : Decimal ,Binary, Hex, Octal (All other possible combinations)
  3. 90 Degrees Matrix conversion
  4. Quick Sort + Applications
  5. Merge Sort + Applications
  6. Remove duplicates in a String — In place
  7. Reverse a string – Inplace
  8. Decide if 2 strings are anagrams or not ?
  9. Binary Search
  10. Reverse SLL without using any extra nodes
  11. Maximum Sub array [Kadane Algorithm]
  12. Find an element which is repeated more than n/2 times in a given set/array. [Moores Voting algorithm]
  13. Find and element in rotated Binary sorted array
  14. Implement power function without pow() function
  15.  Verify if given linked list is circular/cyclic or Acyclic. Follow up can be to indicate the starting point of cycle
  16. Implement Blocking queue
  17. Find a pair in array that will sum up to particular number
  18. Reverse a double linked list
  19. Reverse pairs in SLL. i.e I/P : a->b->c->d->e->f O/p : b->a->d->c->f->e
  20. Segregate even and odd nodes in a given linked list
  21. Addition of 2 linked lists to separate one. (also learn inplace)
  22. Convert SLL in to DLL (XOR based linked lists)
  23. Circular shift an array of integer input array by ‘k’ number of elements
  24. Search for a given pattern in text [Rabin Karp Algorithm]
  25. atio() and itoa() implementations (ASCII to integer and Integer to ASCII)
  26.  Binary Semaphores
  27. Generate subsets of given set of integers
  28. Generate all permutations of a given string
  29. Level order Traversal
  30. Inorder successor of a given node in BST (Binary Search Tree)
  31. Find ‘k’ largest /smallest elements in a given array (Hint : can use heaps)
  32. Heap Sort + applications
  33. Find minimum length unsorted sub array on which storing them makes complete sorted array
  34. Search if a given pattern exists in input text using Suffix Arrays
  35. Re-arrange a string so that all same characters are ‘d’ distant apart
  36. Knights tour problem
  37. Rat in Maze [Back tracking]
  38. Find out if two rectangles overlap or not
  39. Find closest pair of points in the given plane
  40. Find all subset of elements in the given set whose sum equals to a given target
  41. Compute x^y such that it can work for floats and negative values
  42. Find median of  given two input sorted arrays
  43. Find total no of zeros in a given array of 1’s followed by 0’s
  44. Find if there is any sub array which sums up to zero
  45. Count number of inversions in a given array
  46. Find minimum element in a rotated sorted array
  47. Find the fixed point in the given array
  48. Find the maximum sub array sum [D&C]
  49. Count # of occurrences of a number in the sorted array
  50. Find the max and min element in a given array with minimal number of comparisons
  51. Check if a number is multiple of 3 or not ?
  52. One line function to check if a number is power of 2 or not ?
  53. Function to multiple a number by 7.
  54. Function to multiple two numbers without using * product operator
  55. Function to write Fibonacci series in iterative manner
  56. Generate all prime numbers less than or equal to n [Sieve of Erastho..]
  57. Given a number, Find the next biggest palindrome number
  58. Implement logic for fair coin from biased coin
  59.  Check if a number is divisible by 7 without mod operator
  60. Find all the possible words from a phone keypad
  61. Lexicographic sort of permutation of all words
  62. Shuffle a given array / deck of cards [Fisher Yates Algo]
  63. Reservoir Sampling Algorithm
  64. Select ‘k’ random elements from ‘n’ elements
  65. Given a number ‘n’. generate a pascal triangle out of it.
  66. Write an exponential precision function [Taylor series]
  67. Generate all prime factors of a given number
  68. Generate all possible combination of ‘r’ elements in a given array of size ‘n’ [Probability Distribution Function]
  69. Length of Longest common sub sequence of given sequence of numbers
  70. Find minimum cost path in a given cost matrix
  71. Total # of solutions in a coin change problem
  72. Find binomial co-efficient
  73. Knap-sack standard problem
  74. Egg-Drop standard problem
  75. Length of longest palindrome sequence
  76. Palindrome Partitioning
  77. Maximum Length of chained increasing pair
  78. Find the middle of given linked list
  79. Check if a given Single linked list is a palindrome or not
  80. Insert/Delete/Search in max heap
  81. Implement sizeof() operator
  82. Find successor of given BST
  83. Find all triangle triples in given array
  84. Find lowest common ancestor of a given node
  85. Return a single element by knocking out all other elements by ‘k’ [Josephus]
  86. Given a sorted skewed binary tree, Create a BST out of it.
  87. Given an array with integers, Output all the elements which were repeated exactly twice
  88. Maximum depth/height/diameter of a given tree
  89. Serialize and De serialize a given binary tree
  90. Find single repeated or non-repeated number in conditional list. (XOR)
  91. Implement “diff” in linux
  92. Program to count # of set bits in a given integer.
  93. Convert BST to doubly linked list
  94. Convert integer to String without .toString()
  95. GCD of two numerals
  96. Given an array in post order traversal, check whether the given array is in BST or not
  97. Reverse the words in a given English sentence
  98. Get the median of a stream of large numbers
  99. Print all the paths of a given Binary Tree from root to leaf
  100. Modify array such that arr[i] == arr[arr[i]] Inplace
  101. Find the missing number in a billion number list
  102. Bit wise addition

Watch interesting videos for Data Structures and Algorithms & C, C++, JAVA in your native language (Tamil, Telugu, Hindi) here.

Posted on

Campus Interview tips

Hello Friends.  Welcome to GUVI Blogs again.  Today’s topic is about Campus interviews.  Campus interview is an important part of your college days and certainly very important part of your career.  It might also start to shape up the individual whom you will eventually become.  So here are some tips on how to handle a campus interview.

Campus Interview Tips

  • Don’t say I will start preparing tomorrow
    • Do it today.  Do it now.  Take small steps.  Get comfortable.  Learn technical topics that are of interests to you.  Solve some aptitude questions.  Improve your English skills.  But Start with your first step today (Innike Pillayar suzhi Podunga in Tamil 🙂 )PS
  • Prepare well
    • Preparation is key to a campus interview.  Research the internet before taking up the interview to find out the interview process of the company.  Prepare accordingly.  Learning is a key phase in preparation.  The more you learn, the more you can be comfortable.  That’s where a place like GUVI can really help you with learning and sharing.
  • Company Research
    • Research the company thoroughly.  You would need to read the Wikipedia page of the company and also check them out in the latest news.  By doing this, you will be able to understand both the history of the company and the CEOs and also know what they are doing recently.
  • Be relaxed before the interview Continue reading Campus Interview tips