Faster and better experience!
Filter interviews by
I applied via Walk-in and was interviewed in Oct 2022. There were 3 interview rounds.
Tell the leading case related to the question asked by the examiner.
Lalmon shukla versus gauru dutt
Section 304 of the Code of Civil Procedure (CPC) provides for the provision regarding legal aid.
The provision regarding legal aid is given in Section 304 of the CPC.
Section 304 of the CPC deals with the appointment of pleaders for indigent persons.
This section ensures that individuals who cannot afford legal representation are provided with legal aid.
Legal aid may include free legal services, representation by a lawyer...
Chapter 18 of the Code of Criminal Procedure deals with session trial.
Session trial is a type of trial conducted by a Sessions Court.
It is conducted for serious criminal offenses such as murder, rape, etc.
The trial is conducted in open court and the accused is given an opportunity to defend themselves.
The judge hears the evidence presented by both the prosecution and defense and delivers a verdict.
If the accused is fou...
A complaint is a written statement of facts alleging a violation of law. Section 2(d) of the Criminal Procedure Code deals with complaints.
A complaint is a formal allegation of a criminal offense made to a court or other authority.
It is a written statement of facts that sets out the details of the alleged offense.
The complaint must be signed by the complainant and verified by oath or affirmation.
Section 2(d) of the Cri...
Section 2(d) defines the complaint in legal proceedings.
Section 2(d) of the law provides the definition of a complaint in legal proceedings.
The definition of a complaint may vary depending on the jurisdiction and the specific legal context.
In general, a complaint is a formal legal document that outlines the allegations and claims made by a plaintiff against a defendant.
The complaint sets out the facts and legal argumen...
Top trending discussions
Find sum of all numbers formed from root to leaf path in a binary tree
Traverse the binary tree using DFS
At each leaf node, add the number formed from root to leaf path to a sum variable
Return the sum variable
Time complexity: O(n)
Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25
Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.
Use recursion to generate all possible combinations of spaces
For each recursive call, either add a space or don't add a space between the current character and the next character
Base case is when there are no more characters left to add spaces between
Time complexity is O(2^n) where n is the length of the string
Preorder traversal without recursion
Use a stack to keep track of nodes
Push right child first and then left child onto stack
Pop top of stack and print value
Repeat until stack is empty
Find longest continuous patch on a 12 km road with updates in patches
Maintain a variable to keep track of current patch length
Update the variable whenever a new patch is added
Maintain a variable to keep track of longest patch so far
Compare current patch length with longest patch length and update if necessary
Use a sorted data structure like a binary search tree to store the patches for efficient search
Time complexity: ...
Find median of an unsorted array.
Sort the array and find the middle element
Use quickselect algorithm to find the median in O(n) time
If the array is small, use brute force to find the median
Find 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of closest elements.
Update the queue as new characters come in.
Return the 'k' closest elements from the queue.
Design a data structure with O(1) insert, remove, find-max, and delete-max operations.
Use a doubly linked list to maintain the elements in sorted order.
Use a hash table to store the pointers to the nodes in the linked list.
Maintain a pointer to the maximum element in the hash table.
Update the pointers in the hash table when inserting or removing elements.
Update the maximum pointer when deleting or inserting the maximum
Check if a given linked list is a palindrome.
Traverse the linked list and store the values in an array.
Compare the first and last elements of the array, then move towards the center.
If all elements match, the linked list is a palindrome.
Alternatively, use two pointers to find the middle of the linked list and reverse the second half.
Compare the first half with the reversed second half to check for a palindrome.
based on 15 reviews
Rating in categories
Advocate
32
salaries
| ₹2 L/yr - ₹7 L/yr |
Legal Associate
22
salaries
| ₹2 L/yr - ₹7 L/yr |
Lawyer
21
salaries
| ₹1.8 L/yr - ₹7 L/yr |
Advocate Lawyer
17
salaries
| ₹0.8 L/yr - ₹5.7 L/yr |
Junior Advocate
10
salaries
| ₹0.9 L/yr - ₹4 L/yr |
Bar Council of India
Indian Medical Association
The Institute Of Chartered Accountants
FICCI