"Good afternoon everyone my name is shubham shamra, i'm from aligarh i've completed my graduation in electricak engineering from Gurukulkangri vishwavidyalaya haridwar.
I having 6.5 year+ experience in project execution, operation and vendor and client management.
Currently i'm working at vision india services pvt. ltd. here i'm managing smart metering project my role involves - leading team, coordinate with all DISCOM project manager and stake holder, billing and end to end operations.
Befor"
Shubham S. - "Good afternoon everyone my name is shubham shamra, i'm from aligarh i've completed my graduation in electricak engineering from Gurukulkangri vishwavidyalaya haridwar.
I having 6.5 year+ experience in project execution, operation and vendor and client management.
Currently i'm working at vision india services pvt. ltd. here i'm managing smart metering project my role involves - leading team, coordinate with all DISCOM project manager and stake holder, billing and end to end operations.
Befor"See full answer
"hash maps work in key value pair. The keys are hashed with a hash algorithm and resulting hashcode(integer) with related value are stored.
Accessing a value, removing an element, Searching the hash map:
1) The hash map value can be accessed in O(1) time once you know the key.
2) If the key is not known, the hashmap value can be accessed in O(n) since you have to iterate atleast once.
"
Kavithadevi P. - "hash maps work in key value pair. The keys are hashed with a hash algorithm and resulting hashcode(integer) with related value are stored.
Accessing a value, removing an element, Searching the hash map:
1) The hash map value can be accessed in O(1) time once you know the key.
2) If the key is not known, the hashmap value can be accessed in O(n) since you have to iterate atleast once.
"See full answer
Software Engineer
Data Structures & Algorithms
+1 more
🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.
"ArrayList allows constant time access (O(1)) to elements using their index because it uses a dynamic array internally, whereas LinkedList requires traversal from the head node, resulting in linear time complexity (O(n))."
Aziz V. - "ArrayList allows constant time access (O(1)) to elements using their index because it uses a dynamic array internally, whereas LinkedList requires traversal from the head node, resulting in linear time complexity (O(n))."See full answer
"The question is incomplete --- the code only passes if you return the data frame sorted by BOTH department name AND rank. While in the problem description, it mentions to only rank by department name: "The results should be ordered by department name."
Not a big difference I know, but students shouldn't need to look into the solution to get the necessary knowledge to answer the question."
Chao peter Y. - "The question is incomplete --- the code only passes if you return the data frame sorted by BOTH department name AND rank. While in the problem description, it mentions to only rank by department name: "The results should be ordered by department name."
Not a big difference I know, but students shouldn't need to look into the solution to get the necessary knowledge to answer the question."See full answer